## TSTP Solution File: GRP125-1.003 by iProverMo---2.5-0.1

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : iProverMo---2.5-0.1
% Problem  : GRP125-1.003 : TPTP v8.1.0. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : iprover_modulo %s %d

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sat Jul 16 09:44:57 EDT 2022

% Result   : Unsatisfiable 6.07s 6.27s
% Output   : CNFRefutation 6.07s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)

%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
cnf(product_idempotence,axiom,
product(X,X,X),
input ).

fof(product_idempotence_0,plain,
! [X] :
( product(X,X,X)
| \$false ),
inference(orientation,[status(thm)],[product_idempotence]) ).

cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
input ).

fof(e_3_is_not_e_2_0,plain,
( ~ equalish(e_3,e_2)
| \$false ),
inference(orientation,[status(thm)],[e_3_is_not_e_2]) ).

cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
input ).

fof(e_3_is_not_e_1_0,plain,
( ~ equalish(e_3,e_1)
| \$false ),
inference(orientation,[status(thm)],[e_3_is_not_e_1]) ).

cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
input ).

fof(e_2_is_not_e_3_0,plain,
( ~ equalish(e_2,e_3)
| \$false ),
inference(orientation,[status(thm)],[e_2_is_not_e_3]) ).

cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
input ).

fof(e_2_is_not_e_1_0,plain,
( ~ equalish(e_2,e_1)
| \$false ),
inference(orientation,[status(thm)],[e_2_is_not_e_1]) ).

cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
input ).

fof(e_1_is_not_e_3_0,plain,
( ~ equalish(e_1,e_3)
| \$false ),
inference(orientation,[status(thm)],[e_1_is_not_e_3]) ).

cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
input ).

fof(e_1_is_not_e_2_0,plain,
( ~ equalish(e_1,e_2)
| \$false ),
inference(orientation,[status(thm)],[e_1_is_not_e_2]) ).

cnf(element_3,axiom,
group_element(e_3),
input ).

fof(element_3_0,plain,
( group_element(e_3)
| \$false ),
inference(orientation,[status(thm)],[element_3]) ).

cnf(element_2,axiom,
group_element(e_2),
input ).

fof(element_2_0,plain,
( group_element(e_2)
| \$false ),
inference(orientation,[status(thm)],[element_2]) ).

cnf(element_1,axiom,
group_element(e_1),
input ).

fof(element_1_0,plain,
( group_element(e_1)
| \$false ),
inference(orientation,[status(thm)],[element_1]) ).

fof(def_lhs_atom1,axiom,
( lhs_atom1
<=> group_element(e_1) ),
inference(definition,[],]) ).

fof(to_be_clausified_0,plain,
( lhs_atom1
| \$false ),
inference(fold_definition,[status(thm)],[element_1_0,def_lhs_atom1]) ).

fof(def_lhs_atom2,axiom,
( lhs_atom2
<=> group_element(e_2) ),
inference(definition,[],]) ).

fof(to_be_clausified_1,plain,
( lhs_atom2
| \$false ),
inference(fold_definition,[status(thm)],[element_2_0,def_lhs_atom2]) ).

fof(def_lhs_atom3,axiom,
( lhs_atom3
<=> group_element(e_3) ),
inference(definition,[],]) ).

fof(to_be_clausified_2,plain,
( lhs_atom3
| \$false ),
inference(fold_definition,[status(thm)],[element_3_0,def_lhs_atom3]) ).

fof(def_lhs_atom4,axiom,
( lhs_atom4
<=> ~ equalish(e_1,e_2) ),
inference(definition,[],]) ).

fof(to_be_clausified_3,plain,
( lhs_atom4
| \$false ),
inference(fold_definition,[status(thm)],[e_1_is_not_e_2_0,def_lhs_atom4]) ).

fof(def_lhs_atom5,axiom,
( lhs_atom5
<=> ~ equalish(e_1,e_3) ),
inference(definition,[],]) ).

fof(to_be_clausified_4,plain,
( lhs_atom5
| \$false ),
inference(fold_definition,[status(thm)],[e_1_is_not_e_3_0,def_lhs_atom5]) ).

fof(def_lhs_atom6,axiom,
( lhs_atom6
<=> ~ equalish(e_2,e_1) ),
inference(definition,[],]) ).

fof(to_be_clausified_5,plain,
( lhs_atom6
| \$false ),
inference(fold_definition,[status(thm)],[e_2_is_not_e_1_0,def_lhs_atom6]) ).

fof(def_lhs_atom7,axiom,
( lhs_atom7
<=> ~ equalish(e_2,e_3) ),
inference(definition,[],]) ).

fof(to_be_clausified_6,plain,
( lhs_atom7
| \$false ),
inference(fold_definition,[status(thm)],[e_2_is_not_e_3_0,def_lhs_atom7]) ).

fof(def_lhs_atom8,axiom,
( lhs_atom8
<=> ~ equalish(e_3,e_1) ),
inference(definition,[],]) ).

fof(to_be_clausified_7,plain,
( lhs_atom8
| \$false ),
inference(fold_definition,[status(thm)],[e_3_is_not_e_1_0,def_lhs_atom8]) ).

fof(def_lhs_atom9,axiom,
( lhs_atom9
<=> ~ equalish(e_3,e_2) ),
inference(definition,[],]) ).

fof(to_be_clausified_8,plain,
( lhs_atom9
| \$false ),
inference(fold_definition,[status(thm)],[e_3_is_not_e_2_0,def_lhs_atom9]) ).

fof(def_lhs_atom10,axiom,
! [X] :
( lhs_atom10(X)
<=> product(X,X,X) ),
inference(definition,[],]) ).

fof(to_be_clausified_9,plain,
! [X] :
( lhs_atom10(X)
| \$false ),
inference(fold_definition,[status(thm)],[product_idempotence_0,def_lhs_atom10]) ).

% Start CNF derivation
fof(c_0_0,axiom,
! [X1] :
( lhs_atom10(X1)
| ~ \$true ),
file('<stdin>',to_be_clausified_9) ).

fof(c_0_1,axiom,
( lhs_atom9
| ~ \$true ),
file('<stdin>',to_be_clausified_8) ).

fof(c_0_2,axiom,
( lhs_atom8
| ~ \$true ),
file('<stdin>',to_be_clausified_7) ).

fof(c_0_3,axiom,
( lhs_atom7
| ~ \$true ),
file('<stdin>',to_be_clausified_6) ).

fof(c_0_4,axiom,
( lhs_atom6
| ~ \$true ),
file('<stdin>',to_be_clausified_5) ).

fof(c_0_5,axiom,
( lhs_atom5
| ~ \$true ),
file('<stdin>',to_be_clausified_4) ).

fof(c_0_6,axiom,
( lhs_atom4
| ~ \$true ),
file('<stdin>',to_be_clausified_3) ).

fof(c_0_7,axiom,
( lhs_atom3
| ~ \$true ),
file('<stdin>',to_be_clausified_2) ).

fof(c_0_8,axiom,
( lhs_atom2
| ~ \$true ),
file('<stdin>',to_be_clausified_1) ).

fof(c_0_9,axiom,
( lhs_atom1
| ~ \$true ),
file('<stdin>',to_be_clausified_0) ).

fof(c_0_10,plain,
! [X1] : lhs_atom10(X1),
inference(fof_simplification,[status(thm)],[c_0_0]) ).

fof(c_0_11,plain,
lhs_atom9,
inference(fof_simplification,[status(thm)],[c_0_1]) ).

fof(c_0_12,plain,
lhs_atom8,
inference(fof_simplification,[status(thm)],[c_0_2]) ).

fof(c_0_13,plain,
lhs_atom7,
inference(fof_simplification,[status(thm)],[c_0_3]) ).

fof(c_0_14,plain,
lhs_atom6,
inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_15,plain,
lhs_atom5,
inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_16,plain,
lhs_atom4,
inference(fof_simplification,[status(thm)],[c_0_6]) ).

fof(c_0_17,plain,
lhs_atom3,
inference(fof_simplification,[status(thm)],[c_0_7]) ).

fof(c_0_18,plain,
lhs_atom2,
inference(fof_simplification,[status(thm)],[c_0_8]) ).

fof(c_0_19,plain,
lhs_atom1,
inference(fof_simplification,[status(thm)],[c_0_9]) ).

fof(c_0_20,plain,
! [X2] : lhs_atom10(X2),
inference(variable_rename,[status(thm)],[c_0_10]) ).

fof(c_0_21,plain,
lhs_atom9,
c_0_11 ).

fof(c_0_22,plain,
lhs_atom8,
c_0_12 ).

fof(c_0_23,plain,
lhs_atom7,
c_0_13 ).

fof(c_0_24,plain,
lhs_atom6,
c_0_14 ).

fof(c_0_25,plain,
lhs_atom5,
c_0_15 ).

fof(c_0_26,plain,
lhs_atom4,
c_0_16 ).

fof(c_0_27,plain,
lhs_atom3,
c_0_17 ).

fof(c_0_28,plain,
lhs_atom2,
c_0_18 ).

fof(c_0_29,plain,
lhs_atom1,
c_0_19 ).

cnf(c_0_30,plain,
lhs_atom10(X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_31,plain,
lhs_atom9,
inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_32,plain,
lhs_atom8,
inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_33,plain,
lhs_atom7,
inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_34,plain,
lhs_atom6,
inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_35,plain,
lhs_atom5,
inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_36,plain,
lhs_atom4,
inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_37,plain,
lhs_atom3,
inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_38,plain,
lhs_atom2,
inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_39,plain,
lhs_atom1,
inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_40,plain,
lhs_atom10(X1),
c_0_30,
[final] ).

cnf(c_0_41,plain,
lhs_atom9,
c_0_31,
[final] ).

cnf(c_0_42,plain,
lhs_atom8,
c_0_32,
[final] ).

cnf(c_0_43,plain,
lhs_atom7,
c_0_33,
[final] ).

cnf(c_0_44,plain,
lhs_atom6,
c_0_34,
[final] ).

cnf(c_0_45,plain,
lhs_atom5,
c_0_35,
[final] ).

cnf(c_0_46,plain,
lhs_atom4,
c_0_36,
[final] ).

cnf(c_0_47,plain,
lhs_atom3,
c_0_37,
[final] ).

cnf(c_0_48,plain,
lhs_atom2,
c_0_38,
[final] ).

cnf(c_0_49,plain,
lhs_atom1,
c_0_39,
[final] ).

% End CNF derivation
cnf(c_0_40_0,axiom,
product(X1,X1,X1),
inference(unfold_definition,[status(thm)],[c_0_40,def_lhs_atom10]) ).

cnf(c_0_41_0,axiom,
~ equalish(e_3,e_2),
inference(unfold_definition,[status(thm)],[c_0_41,def_lhs_atom9]) ).

cnf(c_0_42_0,axiom,
~ equalish(e_3,e_1),
inference(unfold_definition,[status(thm)],[c_0_42,def_lhs_atom8]) ).

cnf(c_0_43_0,axiom,
~ equalish(e_2,e_3),
inference(unfold_definition,[status(thm)],[c_0_43,def_lhs_atom7]) ).

cnf(c_0_44_0,axiom,
~ equalish(e_2,e_1),
inference(unfold_definition,[status(thm)],[c_0_44,def_lhs_atom6]) ).

cnf(c_0_45_0,axiom,
~ equalish(e_1,e_3),
inference(unfold_definition,[status(thm)],[c_0_45,def_lhs_atom5]) ).

cnf(c_0_46_0,axiom,
~ equalish(e_1,e_2),
inference(unfold_definition,[status(thm)],[c_0_46,def_lhs_atom4]) ).

cnf(c_0_47_0,axiom,
group_element(e_3),
inference(unfold_definition,[status(thm)],[c_0_47,def_lhs_atom3]) ).

cnf(c_0_48_0,axiom,
group_element(e_2),
inference(unfold_definition,[status(thm)],[c_0_48,def_lhs_atom2]) ).

cnf(c_0_49_0,axiom,
group_element(e_1),
inference(unfold_definition,[status(thm)],[c_0_49,def_lhs_atom1]) ).

% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2,X3,X4] :
( ~ product(X3,X2,X4)
| ~ product(X3,X2,X1)
| equalish(X4,X1) ),
file('<stdin>',product_total_function2) ).

fof(c_0_1_002,axiom,
! [X1,X2,X3,X4] :
( ~ product(X3,X4,X2)
| ~ product(X3,X1,X2)
| equalish(X4,X1) ),
file('<stdin>',product_right_cancellation) ).

fof(c_0_2_003,axiom,
! [X1,X2,X3,X4] :
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X4,X1) ),
file('<stdin>',product_left_cancellation) ).

fof(c_0_3_004,axiom,
! [X2,X3] :
( ~ group_element(X3)
| ~ group_element(X2)
| product(X3,X2,e_1)
| product(X3,X2,e_2)
| product(X3,X2,e_3) ),
file('<stdin>',product_total_function1) ).

fof(c_0_4_005,plain,
! [X1,X2,X3,X4] :
( ~ product(X3,X2,X4)
| ~ product(X3,X2,X1)
| equalish(X4,X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).

fof(c_0_5_006,plain,
! [X1,X2,X3,X4] :
( ~ product(X3,X4,X2)
| ~ product(X3,X1,X2)
| equalish(X4,X1) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).

fof(c_0_6_007,plain,
! [X1,X2,X3,X4] :
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X4,X1) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).

fof(c_0_7_008,plain,
! [X2,X3] :
( ~ group_element(X3)
| ~ group_element(X2)
| product(X3,X2,e_1)
| product(X3,X2,e_2)
| product(X3,X2,e_3) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).

fof(c_0_8_009,plain,
! [X5,X6,X7,X8] :
( ~ product(X7,X6,X8)
| ~ product(X7,X6,X5)
| equalish(X8,X5) ),
inference(variable_rename,[status(thm)],[c_0_4]) ).

fof(c_0_9_010,plain,
! [X5,X6,X7,X8] :
( ~ product(X7,X8,X6)
| ~ product(X7,X5,X6)
| equalish(X8,X5) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).

fof(c_0_10_011,plain,
! [X5,X6,X7,X8] :
( ~ product(X8,X6,X7)
| ~ product(X5,X6,X7)
| equalish(X8,X5) ),
inference(variable_rename,[status(thm)],[c_0_6]) ).

fof(c_0_11_012,plain,
! [X4,X5] :
( ~ group_element(X5)
| ~ group_element(X4)
| product(X5,X4,e_1)
| product(X5,X4,e_2)
| product(X5,X4,e_3) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).

cnf(c_0_12_013,plain,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13_014,plain,
( equalish(X1,X2)
| ~ product(X3,X2,X4)
| ~ product(X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14_015,plain,
( equalish(X1,X2)
| ~ product(X2,X3,X4)
| ~ product(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15_016,plain,
( product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1)
| ~ group_element(X2)
| ~ group_element(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16_017,plain,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
c_0_12,
[final] ).

cnf(c_0_17_018,plain,
( equalish(X1,X2)
| ~ product(X3,X2,X4)
| ~ product(X3,X1,X4) ),
c_0_13,
[final] ).

cnf(c_0_18_019,plain,
( equalish(X1,X2)
| ~ product(X2,X3,X4)
| ~ product(X1,X3,X4) ),
c_0_14,
[final] ).

cnf(c_0_19_020,plain,
( product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1)
| ~ group_element(X2)
| ~ group_element(X1) ),
c_0_15,
[final] ).

% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_16_0,axiom,
( equalish(X1,X2)
| ~ product(X3,X4,X2)
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_16]) ).

cnf(c_0_16_1,axiom,
( ~ product(X3,X4,X2)
| equalish(X1,X2)
| ~ product(X3,X4,X1) ),
inference(literals_permutation,[status(thm)],[c_0_16]) ).

cnf(c_0_16_2,axiom,
( ~ product(X3,X4,X1)
| ~ product(X3,X4,X2)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_16]) ).

cnf(c_0_17_0,axiom,
( equalish(X1,X2)
| ~ product(X3,X2,X4)
| ~ product(X3,X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_17]) ).

cnf(c_0_17_1,axiom,
( ~ product(X3,X2,X4)
| equalish(X1,X2)
| ~ product(X3,X1,X4) ),
inference(literals_permutation,[status(thm)],[c_0_17]) ).

cnf(c_0_17_2,axiom,
( ~ product(X3,X1,X4)
| ~ product(X3,X2,X4)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_17]) ).

cnf(c_0_18_0,axiom,
( equalish(X1,X2)
| ~ product(X2,X3,X4)
| ~ product(X1,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_18]) ).

cnf(c_0_18_1,axiom,
( ~ product(X2,X3,X4)
| equalish(X1,X2)
| ~ product(X1,X3,X4) ),
inference(literals_permutation,[status(thm)],[c_0_18]) ).

cnf(c_0_18_2,axiom,
( ~ product(X1,X3,X4)
| ~ product(X2,X3,X4)
| equalish(X1,X2) ),
inference(literals_permutation,[status(thm)],[c_0_18]) ).

cnf(c_0_19_0,axiom,
( product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1)
| ~ group_element(X2)
| ~ group_element(X1) ),
inference(literals_permutation,[status(thm)],[c_0_19]) ).

cnf(c_0_19_1,axiom,
( product(X1,X2,e_2)
| product(X1,X2,e_3)
| product(X1,X2,e_1)
| ~ group_element(X2)
| ~ group_element(X1) ),
inference(literals_permutation,[status(thm)],[c_0_19]) ).

cnf(c_0_19_2,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X2)
| ~ group_element(X1) ),
inference(literals_permutation,[status(thm)],[c_0_19]) ).

cnf(c_0_19_3,axiom,
( ~ group_element(X2)
| product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| ~ group_element(X1) ),
inference(literals_permutation,[status(thm)],[c_0_19]) ).

cnf(c_0_19_4,axiom,
( ~ group_element(X1)
| ~ group_element(X2)
| product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3) ),
inference(literals_permutation,[status(thm)],[c_0_19]) ).

% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_021,negated_conjecture,
! [X1,X2,X3,X4] :
( ~ product(X4,X3,X2)
| ~ product(X3,X4,X1)
| product(X2,X1,X4) ),
file('<stdin>',qg3) ).

fof(c_0_1_022,negated_conjecture,
! [X1,X2,X3,X4] :
( ~ product(X4,X3,X2)
| ~ product(X3,X4,X1)
| product(X2,X1,X4) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).

fof(c_0_2_023,negated_conjecture,
! [X5,X6,X7,X8] :
( ~ product(X8,X7,X6)
| ~ product(X7,X8,X5)
| product(X6,X5,X8) ),
inference(variable_rename,[status(thm)],[c_0_1]) ).

cnf(c_0_3_024,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X3,X2)
| ~ product(X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4_025,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X3,X2)
| ~ product(X3,X4,X1) ),
c_0_3,
[final] ).

% End CNF derivation

%-------------------------------------------------------------
% Proof by iprover

cnf(c_24,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X0,X3)
| product(X2,X3,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c8cedb.p',c_0_4) ).

cnf(c_27,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X0,X3)
| product(X2,X3,X0) ),
inference(copy,[status(esa)],[c_24]) ).

cnf(c_31,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X0,X3)
| product(X2,X3,X0) ),
inference(copy,[status(esa)],[c_27]) ).

cnf(c_32,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X0,X3)
| product(X2,X3,X0) ),
inference(copy,[status(esa)],[c_31]) ).

cnf(c_33,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X0,X3)
| product(X2,X3,X0) ),
inference(copy,[status(esa)],[c_32]) ).

cnf(c_58,negated_conjecture,
( ~ product(X0,X1,X2)
| ~ product(X1,X0,X3)
| product(X2,X3,X0) ),
inference(copy,[status(esa)],[c_33]) ).

cnf(c_369666,plain,
( ~ product(e_2,X0,X1)
| ~ product(X0,e_2,X2)
| product(X1,X2,e_2) ),
inference(instantiation,[status(thm)],[c_58]) ).

cnf(c_369832,plain,
( product(e_3,X0,e_2)
| ~ product(e_2,X1,e_3)
| ~ product(X1,e_2,X0) ),
inference(instantiation,[status(thm)],[c_369666]) ).

cnf(c_369897,plain,
( product(e_3,e_3,e_2)
| ~ product(e_2,X0,e_3)
| ~ product(X0,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_369832]) ).

cnf(c_369902,plain,
( product(e_3,e_3,e_2)
| ~ product(e_2,e_1,e_3)
| ~ product(e_1,e_2,e_3) ),
inference(instantiation,[status(thm)],[c_369897]) ).

cnf(c_1,plain,
( ~ product(X0,X1,X2)
| equalish(X2,X3)
| ~ product(X0,X1,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c8cedb.p',c_0_16_1) ).

cnf(c_35,plain,
( ~ product(X0,X1,X2)
| equalish(X2,X3)
| ~ product(X0,X1,X3) ),
inference(copy,[status(esa)],[c_1]) ).

cnf(c_369630,plain,
( equalish(e_2,e_3)
| ~ product(X0,X1,e_3)
| ~ product(X0,X1,e_2) ),
inference(instantiation,[status(thm)],[c_35]) ).

cnf(c_369792,plain,
( equalish(e_2,e_3)
| ~ product(e_3,e_3,e_3)
| ~ product(e_3,e_3,e_2) ),
inference(instantiation,[status(thm)],[c_369630]) ).

cnf(c_5,plain,
( equalish(X0,X1)
| ~ product(X2,X1,X3)
| ~ product(X2,X0,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c8cedb.p',c_0_17_2) ).

cnf(c_39,plain,
( equalish(X0,X1)
| ~ product(X2,X1,X3)
| ~ product(X2,X0,X3) ),
inference(copy,[status(esa)],[c_5]) ).

cnf(c_369598,plain,
( equalish(e_1,e_2)
| ~ product(X0,e_2,X1)
| ~ product(X0,e_1,X1) ),
inference(instantiation,[status(thm)],[c_39]) ).

cnf(c_369748,plain,
( equalish(e_1,e_2)
| ~ product(e_2,e_2,e_2)
| ~ product(e_2,e_1,e_2) ),
inference(instantiation,[status(thm)],[c_369598]) ).

cnf(c_8,plain,
( equalish(X0,X1)
| ~ product(X1,X2,X3)
| ~ product(X0,X2,X3) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c8cedb.p',c_0_18_2) ).

cnf(c_42,plain,
( equalish(X0,X1)
| ~ product(X1,X2,X3)
| ~ product(X0,X2,X3) ),
inference(copy,[status(esa)],[c_8]) ).

cnf(c_369621,plain,
( equalish(e_2,e_1)
| ~ product(e_2,X0,X1)
| ~ product(e_1,X0,X1) ),
inference(instantiation,[status(thm)],[c_42]) ).

cnf(c_369720,plain,
( equalish(e_2,e_1)
| ~ product(e_2,e_2,e_2)
| ~ product(e_1,e_2,e_2) ),
inference(instantiation,[status(thm)],[c_369621]) ).

cnf(c_23,plain,
product(X0,X0,X0),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c8cedb.p',c_0_40_0) ).

cnf(c_57,plain,
product(X0,X0,X0),
inference(copy,[status(esa)],[c_23]) ).

cnf(c_369695,plain,
product(e_3,e_3,e_3),
inference(instantiation,[status(thm)],[c_57]) ).

cnf(c_13,plain,
( product(X0,X1,e_3)
| product(X0,X1,e_2)
| product(X0,X1,e_1)
| ~ group_element(X1)
| ~ group_element(X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c8cedb.p',c_0_19_4) ).

cnf(c_47,plain,
( product(X0,X1,e_3)
| product(X0,X1,e_2)
| product(X0,X1,e_1)
| ~ group_element(X1)
| ~ group_element(X0) ),
inference(copy,[status(esa)],[c_13]) ).

cnf(c_369684,plain,
( product(X0,e_2,e_3)
| product(X0,e_2,e_2)
| product(X0,e_2,e_1)
| ~ group_element(e_2)
| ~ group_element(X0) ),
inference(instantiation,[status(thm)],[c_47]) ).

cnf(c_369689,plain,
( product(e_1,e_2,e_3)
| product(e_1,e_2,e_2)
| product(e_1,e_2,e_1)
| ~ group_element(e_2)
| ~ group_element(e_1) ),
inference(instantiation,[status(thm)],[c_369684]) ).

cnf(c_369673,plain,
( product(e_2,X0,e_3)
| product(e_2,X0,e_2)
| product(e_2,X0,e_1)
| ~ group_element(e_2)
| ~ group_element(X0) ),
inference(instantiation,[status(thm)],[c_47]) ).

cnf(c_369678,plain,
( product(e_2,e_1,e_3)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_1)
| ~ group_element(e_2)
| ~ group_element(e_1) ),
inference(instantiation,[status(thm)],[c_369673]) ).

cnf(c_369669,plain,
product(e_2,e_2,e_2),
inference(instantiation,[status(thm)],[c_57]) ).

cnf(c_369597,plain,
( equalish(e_1,e_2)
| ~ product(e_2,X0,X1)
| ~ product(e_1,X0,X1) ),
inference(instantiation,[status(thm)],[c_42]) ).

cnf(c_369601,plain,
( equalish(e_1,e_2)
| ~ product(e_2,e_1,e_1)
| ~ product(e_1,e_1,e_1) ),
inference(instantiation,[status(thm)],[c_369597]) ).

cnf(c_369600,plain,
( equalish(e_1,e_2)
| ~ product(e_1,e_2,e_1)
| ~ product(e_1,e_1,e_1) ),
inference(instantiation,[status(thm)],[c_369598]) ).

cnf(c_14,plain,
group_element(e_1),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c8cedb.p',c_0_49_0) ).

cnf(c_15,plain,
group_element(e_2),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c8cedb.p',c_0_48_0) ).

cnf(c_17,plain,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c8cedb.p',c_0_46_0) ).

cnf(c_19,plain,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c8cedb.p',c_0_44_0) ).

cnf(c_20,plain,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox2/tmp/iprover_modulo_c8cedb.p',c_0_43_0) ).

cnf(c_25,plain,
product(e_1,e_1,e_1),
inference(instantiation,[status(thm)],[c_23]) ).

\$false,
inference(minisat,[status(thm)],[c_369902,c_369792,c_369748,c_369720,c_369695,c_369689,c_369678,c_369669,c_369601,c_369600,c_14,c_15,c_17,c_19,c_20,c_25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP125-1.003 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.13  % Command  : iprover_modulo %s %d
% 0.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jun 13 22:59:09 EDT 2022
% 0.13/0.34  % CPUTime  :
% 0.13/0.34  % Running in mono-core mode
% 0.20/0.40  % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40  % Orientation found
% 0.20/0.40  % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format  " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_842551.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_c8cedb.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_e4095c | grep -v "SZS"
% 0.20/0.42
% 0.20/0.42  %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.42
% 0.20/0.42  %
% 0.20/0.42  % ------  iProver source info
% 0.20/0.42
% 0.20/0.42  % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.42  % git: non_committed_changes: true
% 0.20/0.42  % git: last_make_outside_of_git: true
% 0.20/0.42
% 0.20/0.42  %
% 0.20/0.42  % ------ Input Options
% 0.20/0.42
% 0.20/0.42  % --out_options                         all
% 0.20/0.42  % --tptp_safe_out                       true
% 0.20/0.42  % --problem_path                        ""
% 0.20/0.42  % --include_path                        ""
% 0.20/0.42  % --clausifier                          .//eprover
% 0.20/0.42  % --clausifier_options                  --tstp-format
% 0.20/0.42  % --stdin                               false
% 0.20/0.42  % --dbg_backtrace                       false
% 0.20/0.42  % --dbg_dump_prop_clauses               false
% 0.20/0.42  % --dbg_dump_prop_clauses_file          -
% 0.20/0.42  % --dbg_out_stat                        false
% 0.20/0.42
% 0.20/0.42  % ------ General Options
% 0.20/0.42
% 0.20/0.42  % --fof                                 false
% 0.20/0.42  % --time_out_real                       150.
% 0.20/0.42  % --time_out_prep_mult                  0.2
% 0.20/0.42  % --time_out_virtual                    -1.
% 0.20/0.42  % --schedule                            none
% 0.20/0.42  % --ground_splitting                    input
% 0.20/0.42  % --splitting_nvd                       16
% 0.20/0.42  % --non_eq_to_eq                        false
% 0.20/0.42  % --prep_gs_sim                         true
% 0.20/0.42  % --prep_unflatten                      false
% 0.20/0.42  % --prep_res_sim                        true
% 0.20/0.42  % --prep_upred                          true
% 0.20/0.42  % --res_sim_input                       true
% 0.20/0.42  % --clause_weak_htbl                    true
% 0.20/0.42  % --gc_record_bc_elim                   false
% 0.20/0.42  % --symbol_type_check                   false
% 0.20/0.42  % --clausify_out                        false
% 0.20/0.42  % --large_theory_mode                   false
% 0.20/0.42  % --prep_sem_filter                     none
% 0.20/0.42  % --prep_sem_filter_out                 false
% 0.20/0.42  % --preprocessed_out                    false
% 0.20/0.42  % --sub_typing                          false
% 0.20/0.42  % --brand_transform                     false
% 0.20/0.42  % --pure_diseq_elim                     true
% 0.20/0.42  % --min_unsat_core                      false
% 0.20/0.42  % --pred_elim                           true
% 0.20/0.42  % --soft_assumptions                    false
% 0.20/0.42  % --reset_solvers                       false
% 0.20/0.42  % --bc_imp_inh                          []
% 0.20/0.42  % --conj_cone_tolerance                 1.5
% 0.20/0.42  % --prolific_symb_bound                 500
% 0.20/0.42  % --lt_threshold                        2000
% 0.20/0.42
% 0.20/0.42  % ------ SAT Options
% 0.20/0.42
% 0.20/0.42  % --sat_mode                            false
% 0.20/0.42  % --sat_fm_restart_options              ""
% 0.20/0.42  % --sat_gr_def                          false
% 0.20/0.42  % --sat_epr_types                       true
% 0.20/0.42  % --sat_non_cyclic_types                false
% 0.20/0.42  % --sat_finite_models                   false
% 0.20/0.42  % --sat_fm_lemmas                       false
% 0.20/0.42  % --sat_fm_prep                         false
% 0.20/0.42  % --sat_fm_uc_incr                      true
% 0.20/0.42  % --sat_out_model                       small
% 0.20/0.42  % --sat_out_clauses                     false
% 0.20/0.42
% 0.20/0.42  % ------ QBF Options
% 0.20/0.42
% 0.20/0.42  % --qbf_mode                            false
% 0.20/0.42  % --qbf_elim_univ                       true
% 0.20/0.42  % --qbf_sk_in                           true
% 0.20/0.42  % --qbf_pred_elim                       true
% 0.20/0.42  % --qbf_split                           32
% 0.20/0.42
% 0.20/0.42  % ------ BMC1 Options
% 0.20/0.42
% 0.20/0.42  % --bmc1_incremental                    false
% 0.20/0.42  % --bmc1_axioms                         reachable_all
% 0.20/0.42  % --bmc1_min_bound                      0
% 0.20/0.42  % --bmc1_max_bound                      -1
% 0.20/0.42  % --bmc1_max_bound_default              -1
% 0.20/0.42  % --bmc1_symbol_reachability            true
% 0.20/0.42  % --bmc1_property_lemmas                false
% 0.20/0.42  % --bmc1_k_induction                    false
% 0.20/0.42  % --bmc1_non_equiv_states               false
% 0.20/0.42  % --bmc1_ucm                            false
% 0.20/0.42  % --bmc1_unsat_core_children            false
% 0.20/0.42  % --bmc1_unsat_core_extrapolate_axioms  false
% 0.20/0.42  % --bmc1_out_stat                       full
% 0.20/0.42  % --bmc1_ground_init                    false
% 0.20/0.42  % --bmc1_pre_inst_next_state            false
% 0.20/0.42  % --bmc1_pre_inst_state                 false
% 0.20/0.42  % --bmc1_pre_inst_reach_state           false
% 0.20/0.42  % --bmc1_out_unsat_core                 false
% 0.20/0.42  % --bmc1_aig_witness_out                false
% 0.20/0.42  % --bmc1_verbose                        false
% 0.20/0.42  % --bmc1_dump_clauses_tptp              false
% 0.20/0.43  % --bmc1_dump_unsat_core_tptp           false
% 0.20/0.43  % --bmc1_dump_file                      -
% 0.20/0.43  % --bmc1_ucm_expand_uc_limit            128
% 0.20/0.43  % --bmc1_ucm_n_expand_iterations        6
% 0.20/0.43  % --bmc1_ucm_extend_mode                1
% 0.20/0.43  % --bmc1_ucm_init_mode                  2
% 0.20/0.43  % --bmc1_ucm_cone_mode                  none
% 0.20/0.43  % --bmc1_ucm_reduced_relation_type      0
% 0.20/0.43  % --bmc1_ucm_relax_model                4
% 0.20/0.43  % --bmc1_ucm_full_tr_after_sat          true
% 0.20/0.43  % --bmc1_ucm_expand_neg_assumptions     false
% 0.20/0.43  % --bmc1_ucm_layered_model              none
% 0.20/0.43  % --bmc1_ucm_max_lemma_size             10
% 0.20/0.43
% 0.20/0.43  % ------ AIG Options
% 0.20/0.43
% 0.20/0.43  % --aig_mode                            false
% 0.20/0.43
% 0.20/0.43  % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43  % --instantiation_flag                  true
% 0.20/0.43  % --inst_lit_sel                        [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43  % --inst_solver_per_active              750
% 0.20/0.43  % --inst_solver_calls_frac              0.5
% 0.20/0.43  % --inst_passive_queue_type             priority_queues
% 0.20/0.43  % --inst_passive_queues                 [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43  % --inst_passive_queues_freq            [25;2]
% 0.20/0.43  % --inst_dismatching                    true
% 0.20/0.43  % --inst_eager_unprocessed_to_passive   true
% 0.20/0.43  % --inst_prop_sim_given                 true
% 0.20/0.43  % --inst_prop_sim_new                   false
% 0.20/0.43  % --inst_orphan_elimination             true
% 0.20/0.43  % --inst_learning_loop_flag             true
% 0.20/0.43  % --inst_learning_start                 3000
% 0.20/0.43  % --inst_learning_factor                2
% 0.20/0.43  % --inst_start_prop_sim_after_learn     3
% 0.20/0.43  % --inst_sel_renew                      solver
% 0.20/0.43  % --inst_lit_activity_flag              true
% 0.20/0.43  % --inst_out_proof                      true
% 0.20/0.43
% 0.20/0.43  % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43  % --resolution_flag                     true
% 0.20/0.43  % --res_lit_sel                         kbo_max
% 0.20/0.43  % --res_to_prop_solver                  none
% 0.20/0.43  % --res_prop_simpl_new                  false
% 0.20/0.43  % --res_prop_simpl_given                false
% 0.20/0.43  % --res_passive_queue_type              priority_queues
% 0.20/0.43  % --res_passive_queues                  [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43  % --res_passive_queues_freq             [15;5]
% 0.20/0.43  % --res_forward_subs                    full
% 0.20/0.43  % --res_backward_subs                   full
% 0.20/0.43  % --res_forward_subs_resolution         true
% 0.20/0.43  % --res_backward_subs_resolution        true
% 0.20/0.43  % --res_orphan_elimination              false
% 0.20/0.43  % --res_time_limit                      1000.
% 0.20/0.43  % --res_out_proof                       true
% 0.20/0.43  % --proof_out_file                      /export/starexec/sandbox2/tmp/iprover_proof_842551.s
% 0.20/0.43  % --modulo                              true
% 0.20/0.43
% 0.20/0.43  % ------ Combination Options
% 0.20/0.43
% 0.20/0.43  % --comb_res_mult                       1000
% 0.20/0.43  % --comb_inst_mult                      300
% 0.20/0.43  % ------
% 0.20/0.43
% 0.20/0.43  % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e  pe_s  pe_e  snvd_s sp: 0 0s snvd_e %
% 0.20/0.43
% 0.20/0.43  % ------ Proving...
% 0.20/0.43  % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43  %
% 0.20/0.43  % EPR                                   true
% 0.20/0.43  % Horn                                  false
% 0.20/0.43  % Has equality                          false
% 0.20/0.43
% 0.20/0.43  % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43  % % ------ Current options:
% 0.20/0.43
% 0.20/0.43  % ------ Input Options
% 0.20/0.43
% 0.20/0.43  % --out_options                         all
% 0.20/0.43  % --tptp_safe_out                       true
% 0.20/0.43  % --problem_path                        ""
% 0.20/0.43  % --include_path                        ""
% 0.20/0.43  % --clausifier                          .//eprover
% 0.20/0.43  % --clausifier_options                  --tstp-format
% 0.20/0.43  % --stdin                               false
% 0.20/0.43  % --dbg_backtrace                       false
% 0.20/0.43  % --dbg_dump_prop_clauses               false
% 0.20/0.43  % --dbg_dump_prop_clauses_file          -
% 0.20/0.43  % --dbg_out_stat                        false
% 0.20/0.43
% 0.20/0.43  % ------ General Options
% 0.20/0.43
% 0.20/0.43  % --fof                                 false
% 0.20/0.43  % --time_out_real                       150.
% 0.20/0.43  % --time_out_prep_mult                  0.2
% 0.20/0.43  % --time_out_virtual                    -1.
% 0.20/0.43  % --schedule                            none
% 0.20/0.43  % --ground_splitting                    input
% 0.20/0.43  % --splitting_nvd                       16
% 0.20/0.43  % --non_eq_to_eq                        false
% 0.20/0.43  % --prep_gs_sim                         true
% 0.20/0.43  % --prep_unflatten                      false
% 0.20/0.43  % --prep_res_sim                        true
% 0.20/0.43  % --prep_upred                          true
% 0.20/0.43  % --res_sim_input                       true
% 0.20/0.43  % --clause_weak_htbl                    true
% 0.20/0.43  % --gc_record_bc_elim                   false
% 0.20/0.43  % --symbol_type_check                   false
% 0.20/0.43  % --clausify_out                        false
% 0.20/0.43  % --large_theory_mode                   false
% 0.20/0.43  % --prep_sem_filter                     none
% 0.20/0.43  % --prep_sem_filter_out                 false
% 0.20/0.43  % --preprocessed_out                    false
% 0.20/0.43  % --sub_typing                          false
% 0.20/0.43  % --brand_transform                     false
% 0.20/0.43  % --pure_diseq_elim                     true
% 0.20/0.43  % --min_unsat_core                      false
% 0.20/0.43  % --pred_elim                           true
% 0.20/0.43  % --soft_assumptions                    false
% 0.20/0.43  % --reset_solvers                       false
% 0.20/0.43  % --bc_imp_inh                          []
% 0.20/0.43  % --conj_cone_tolerance                 1.5
% 0.20/0.43  % --prolific_symb_bound                 500
% 0.20/0.43  % --lt_threshold                        2000
% 0.20/0.43
% 0.20/0.43  % ------ SAT Options
% 0.20/0.43
% 0.20/0.43  % --sat_mode                            false
% 0.20/0.43  % --sat_fm_restart_options              ""
% 0.20/0.43  % --sat_gr_def                          false
% 0.20/0.43  % --sat_epr_types                       true
% 0.20/0.43  % --sat_non_cyclic_types                false
% 0.20/0.43  % --sat_finite_models                   false
% 0.20/0.43  % --sat_fm_lemmas                       false
% 0.20/0.43  % --sat_fm_prep                         false
% 0.20/0.43  % --sat_fm_uc_incr                      true
% 0.20/0.43  % --sat_out_model                       small
% 0.20/0.43  % --sat_out_clauses                     false
% 0.20/0.43
% 0.20/0.43  % ------ QBF Options
% 0.20/0.43
% 0.20/0.43  % --qbf_mode                            false
% 0.20/0.43  % --qbf_elim_univ                       true
% 0.20/0.43  % --qbf_sk_in                           true
% 0.20/0.43  % --qbf_pred_elim                       true
% 0.20/0.43  % --qbf_split                           32
% 0.20/0.43
% 0.20/0.43  % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43  % --bmc1_incremental                    false
% 0.20/0.43  % --bmc1_axioms                         reachable_all
% 0.20/0.43  % --bmc1_min_bound                      0
% 0.20/0.43  % --bmc1_max_bound                      -1
% 0.20/0.43  % --bmc1_max_bound_default              -1
% 0.20/0.43  % --bmc1_symbol_reachability            true
% 0.20/0.43  % --bmc1_property_lemmas                false
% 0.20/0.43  % --bmc1_k_induction                    false
% 0.20/0.43  % --bmc1_non_equiv_states               false
% 0.20/0.43  % --bmc1_ucm                            false
% 0.20/0.43  % --bmc1_unsat_core_children            false
% 0.20/0.43  % --bmc1_unsat_core_extrapolate_axioms  false
% 0.20/0.43  % --bmc1_out_stat                       full
% 0.20/0.43  % --bmc1_ground_init                    false
% 0.20/0.43  % --bmc1_pre_inst_next_state            false
% 0.20/0.43  % --bmc1_pre_inst_state                 false
% 0.20/0.43  % --bmc1_pre_inst_reach_state           false
% 0.20/0.43  % --bmc1_out_unsat_core                 false
% 0.20/0.43  % --bmc1_aig_witness_out                false
% 0.20/0.43  % --bmc1_verbose                        false
% 0.20/0.43  % --bmc1_dump_clauses_tptp              false
% 0.20/0.43  % --bmc1_dump_unsat_core_tptp           false
% 0.20/0.43  % --bmc1_dump_file                      -
% 0.20/0.43  % --bmc1_ucm_expand_uc_limit            128
% 0.20/0.43  % --bmc1_ucm_n_expand_iterations        6
% 0.20/0.43  % --bmc1_ucm_extend_mode                1
% 0.20/0.43  % --bmc1_ucm_init_mode                  2
% 0.20/0.43  % --bmc1_ucm_cone_mode                  none
% 0.20/0.43  % --bmc1_ucm_reduced_relation_type      0
% 0.20/0.43  % --bmc1_ucm_relax_model                4
% 0.20/0.43  % --bmc1_ucm_full_tr_after_sat          true
% 0.20/0.43  % --bmc1_ucm_expand_neg_assumptions     false
% 0.20/0.43  % --bmc1_ucm_layered_model              none
% 0.20/0.43  % --bmc1_ucm_max_lemma_size             10
% 0.20/0.43
% 0.20/0.43  % ------ AIG Options
% 0.20/0.43
% 0.20/0.43  % --aig_mode                            false
% 0.20/0.43
% 0.20/0.43  % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43  % --instantiation_flag                  true
% 0.20/0.43  % --inst_lit_sel                        [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43  % --inst_solver_per_active              750
% 0.20/0.43  % --inst_solver_calls_frac              0.5
% 0.20/0.43  % --inst_passive_queue_type             priority_queues
% 0.20/0.43  % --inst_passive_queues                 [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43  % --inst_passive_queues_freq            [25;2]
% 0.20/0.43  % --inst_dismatching                    true
% 0.20/0.43  % --inst_eager_unprocessed_to_passive   true
% 0.20/0.43  % --inst_prop_sim_given                 true
% 6.07/6.26  % --inst_prop_sim_new                   false
% 6.07/6.26  % --inst_orphan_elimination             true
% 6.07/6.26  % --inst_learning_loop_flag             true
% 6.07/6.26  % --inst_learning_start                 3000
% 6.07/6.26  % --inst_learning_factor                2
% 6.07/6.26  % --inst_start_prop_sim_after_learn     3
% 6.07/6.26  % --inst_sel_renew                      solver
% 6.07/6.26  % --inst_lit_activity_flag              true
% 6.07/6.26  % --inst_out_proof                      true
% 6.07/6.26
% 6.07/6.26  % ------ Resolution Options
% 6.07/6.26
% 6.07/6.26  % --resolution_flag                     true
% 6.07/6.26  % --res_lit_sel                         kbo_max
% 6.07/6.26  % --res_to_prop_solver                  none
% 6.07/6.26  % --res_prop_simpl_new                  false
% 6.07/6.26  % --res_prop_simpl_given                false
% 6.07/6.26  % --res_passive_queue_type              priority_queues
% 6.07/6.26  % --res_passive_queues                  [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 6.07/6.26  % --res_passive_queues_freq             [15;5]
% 6.07/6.26  % --res_forward_subs                    full
% 6.07/6.26  % --res_backward_subs                   full
% 6.07/6.26  % --res_forward_subs_resolution         true
% 6.07/6.26  % --res_backward_subs_resolution        true
% 6.07/6.26  % --res_orphan_elimination              false
% 6.07/6.26  % --res_time_limit                      1000.
% 6.07/6.26  % --res_out_proof                       true
% 6.07/6.26  % --proof_out_file                      /export/starexec/sandbox2/tmp/iprover_proof_842551.s
% 6.07/6.26  % --modulo                              true
% 6.07/6.26
% 6.07/6.26  % ------ Combination Options
% 6.07/6.26
% 6.07/6.26  % --comb_res_mult                       1000
% 6.07/6.26  % --comb_inst_mult                      300
% 6.07/6.26  % ------
% 6.07/6.26
% 6.07/6.26
% 6.07/6.26
% 6.07/6.26  % ------ Proving...
% 6.07/6.26  %
% 6.07/6.26
% 6.07/6.26
% 6.07/6.26  % ------                             Statistics
% 6.07/6.26
% 6.07/6.26  % ------ General
% 6.07/6.26
% 6.07/6.26  % num_of_input_clauses:                 25
% 6.07/6.26  % num_of_input_neg_conjectures:         1
% 6.07/6.26  % num_of_splits:                        0
% 6.07/6.26  % num_of_split_atoms:                   0
% 6.07/6.26  % num_of_sem_filtered_clauses:          0
% 6.07/6.26  % num_of_subtypes:                      0
% 6.07/6.26  % monotx_restored_types:                0
% 6.07/6.26  % sat_num_of_epr_types:                 0
% 6.07/6.26  % sat_num_of_non_cyclic_types:          0
% 6.07/6.26  % sat_guarded_non_collapsed_types:      0
% 6.07/6.26  % is_epr:                               1
% 6.07/6.26  % is_horn:                              0
% 6.07/6.26  % has_eq:                               0
% 6.07/6.26  % num_pure_diseq_elim:                  0
% 6.07/6.26  % simp_replaced_by:                     0
% 6.07/6.26  % res_preprocessed:                     2
% 6.07/6.26  % prep_upred:                           0
% 6.07/6.26  % prep_unflattend:                      0
% 6.07/6.26  % pred_elim_cands:                      0
% 6.07/6.26  % pred_elim:                            0
% 6.07/6.26  % pred_elim_cl:                         0
% 6.07/6.26  % pred_elim_cycles:                     0
% 6.07/6.26  % forced_gc_time:                       0
% 6.07/6.26  % gc_basic_clause_elim:                 0
% 6.07/6.26  % parsing_time:                         0.001
% 6.07/6.26  % sem_filter_time:                      0.
% 6.07/6.26  % pred_elim_time:                       0.
% 6.07/6.26  % out_proof_time:                       0.
% 6.07/6.26  % monotx_time:                          0.
% 6.07/6.26  % subtype_inf_time:                     0.
% 6.07/6.26  % unif_index_cands_time:                0.006
% 6.07/6.26  % total_time:                           5.857
% 6.07/6.26  % num_of_symbols:                       31
% 6.07/6.26  % num_of_terms:                         409
% 6.07/6.26
% 6.07/6.26  % ------ Propositional Solver
% 6.07/6.26
% 6.07/6.26  % prop_solver_calls:                    5
% 6.07/6.26  % prop_fast_solver_calls:               9
% 6.07/6.26  % prop_num_of_clauses:                  166
% 6.07/6.26  % prop_preprocess_simplified:           274
% 6.07/6.26  % prop_fo_subsumed:                     0
% 6.07/6.26  % prop_solver_time:                     0.
% 6.07/6.26  % prop_fast_solver_time:                0.
% 6.07/6.26  % prop_unsat_core_time:                 0.
% 6.07/6.26
% 6.07/6.26  % ------ QBF
% 6.07/6.26
% 6.07/6.26  % qbf_q_res:                            0
% 6.07/6.26  % qbf_num_tautologies:                  0
% 6.07/6.26  % qbf_prep_cycles:                      0
% 6.07/6.26
% 6.07/6.26  % ------ BMC1
% 6.07/6.26
% 6.07/6.26  % bmc1_current_bound:                   -1
% 6.07/6.26  % bmc1_last_solved_bound:               -1
% 6.07/6.26  % bmc1_unsat_core_size:                 -1
% 6.07/6.26  % bmc1_unsat_core_parents_size:         -1
% 6.07/6.26  % bmc1_merge_next_fun:                  0
% 6.07/6.26  % bmc1_unsat_core_clauses_time:         0.
% 6.07/6.26
% 6.07/6.26  % ------ Instantiation
% 6.07/6.26
% 6.07/6.26  % inst_num_of_clauses:                  131
% 6.07/6.26  % inst_num_in_passive:                  40
% 6.07/6.26  % inst_num_in_active:                   66
% 6.07/6.26  % inst_num_in_unprocessed:              19
% 6.07/6.26  % inst_num_of_loops:                    68
% 6.07/6.26  % inst_num_of_learning_restarts:        0
% 6.07/6.26  % inst_num_moves_active_passive:        0
% 6.07/6.26  % inst_lit_activity:                    51
% 6.07/6.26  % inst_lit_activity_moves:              0
% 6.07/6.26  % inst_num_tautologies:                 0
% 6.07/6.26  % inst_num_prop_implied:                0
% 6.07/6.26  % inst_num_existing_simplified:         0
% 6.07/6.26  % inst_num_eq_res_simplified:           0
% 6.07/6.26  % inst_num_child_elim:                  0
% 6.07/6.26  % inst_num_of_dismatching_blockings:    23
% 6.07/6.26  % inst_num_of_non_proper_insts:         139
% 6.07/6.26  % inst_num_of_duplicates:               118
% 6.07/6.26  % inst_inst_num_from_inst_to_res:       0
% 6.07/6.26  % inst_dismatching_checking_time:       0.
% 6.07/6.26
% 6.07/6.26  % ------ Resolution
% 6.07/6.26
% 6.07/6.26  % res_num_of_clauses:                   38719
% 6.07/6.26  % res_num_in_passive:                   38239
% 6.07/6.26  % res_num_in_active:                    780
% 6.07/6.26  % res_num_of_loops:                     1000
% 6.07/6.26  % res_forward_subset_subsumed:          140705
% 6.07/6.26  % res_backward_subset_subsumed:         352
% 6.07/6.26  % res_forward_subsumed:                 196
% 6.07/6.26  % res_backward_subsumed:                13
% 6.07/6.26  % res_forward_subsumption_resolution:   26
% 6.07/6.26  % res_backward_subsumption_resolution:  0
% 6.07/6.26  % res_clause_to_clause_subsumption:     590282
% 6.07/6.26  % res_orphan_elimination:               0
% 6.07/6.26  % res_tautology_del:                    0
% 6.07/6.26  % res_num_eq_res_simplified:            0
% 6.07/6.26  % res_num_sel_changes:                  0
% 6.07/6.26  % res_moves_from_active_to_pass:        0
% 6.07/6.26
% 6.07/6.27  % Status Unsatisfiable
% 6.07/6.27  % SZS status Unsatisfiable
% 6.07/6.27  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------
```