TSTP Solution File: GRP226-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP226-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 300s
% DateTime : Mon May 20 20:47:03 EDT 2024
% Result : Unsatisfiable 0.17s 0.50s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 16
% Syntax : Number of clauses : 86 ( 24 unt; 55 nHn; 70 RR)
% Number of literals : 185 ( 184 equ; 47 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(sk_c4,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c4,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_21,negated_conjecture,
( inverse(X1) != sk_c7
| multiply(X1,sk_c6) != sk_c7
| multiply(sk_c7,X2) != sk_c6
| multiply(X3,sk_c7) != X2
| inverse(X3) != sk_c7
| inverse(X4) != sk_c7
| multiply(X4,sk_c6) != sk_c7
| multiply(X5,sk_c6) != sk_c7
| inverse(X5) != sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| multiply(sk_c5,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_1,negated_conjecture,
( inverse(sk_c1) = sk_c7
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_12,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| multiply(sk_c4,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_9,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c2,sk_c7) = sk_c3
| multiply(sk_c5,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_19,negated_conjecture,
( inverse(sk_c2) = sk_c7
| multiply(sk_c5,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c2,sk_c7) = sk_c3
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_20,negated_conjecture,
( inverse(sk_c2) = sk_c7
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_20) ).
cnf(c_0_16,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_17,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_18,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_19,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(sk_c4,sk_c6) = sk_c7 ),
prove_this_6 ).
cnf(c_0_21,negated_conjecture,
( multiply(inverse(sk_c1),sk_c7) = sk_c6
| multiply(sk_c4,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c4,sk_c6) = sk_c7 ),
prove_this_2 ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c4,sk_c6) = sk_c7
| multiply(sk_c7,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( multiply(inverse(sk_c4),sk_c7) = sk_c6
| multiply(sk_c7,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| inverse(sk_c4) = sk_c7 ),
prove_this_5 ).
cnf(c_0_26,negated_conjecture,
( inverse(X1) != sk_c7
| multiply(X1,sk_c6) != sk_c7
| multiply(sk_c7,X2) != sk_c6
| multiply(X3,sk_c7) != X2
| inverse(X3) != sk_c7
| inverse(X4) != sk_c7
| multiply(X4,sk_c6) != sk_c7
| multiply(X5,sk_c6) != sk_c7
| inverse(X5) != sk_c6 ),
inference(fof_simplification,[status(thm)],[prove_this_21]) ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c1,sk_c6) = sk_c7
| multiply(sk_c7,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( inverse(X1) != sk_c7
| multiply(X1,sk_c6) != sk_c7
| multiply(sk_c7,X2) != sk_c6
| multiply(X3,sk_c7) != X2
| inverse(X3) != sk_c7
| inverse(X4) != sk_c7
| multiply(X4,sk_c6) != sk_c7
| multiply(X5,sk_c6) != sk_c7
| inverse(X5) != sk_c6 ),
c_0_26 ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| multiply(sk_c5,sk_c6) = sk_c7 ),
prove_this_11 ).
cnf(c_0_30,negated_conjecture,
( multiply(inverse(sk_c1),sk_c7) = sk_c6
| multiply(sk_c7,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c1) = sk_c7
| inverse(sk_c4) = sk_c7 ),
prove_this_1 ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c7,multiply(X1,sk_c7)) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| multiply(X3,sk_c6) != sk_c7
| multiply(X4,sk_c6) != sk_c7
| inverse(X2) != sk_c6
| inverse(X3) != sk_c7
| inverse(X1) != sk_c7
| inverse(X4) != sk_c7 ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| inverse(sk_c5) = sk_c6 ),
prove_this_12 ).
cnf(c_0_34,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_35,negated_conjecture,
( multiply(inverse(sk_c5),sk_c7) = sk_c6
| multiply(sk_c7,sk_c3) = sk_c6 ),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| multiply(sk_c4,sk_c6) = sk_c7 ),
prove_this_10 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c7,sk_c7) = sk_c6
| inverse(sk_c4) = sk_c7 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| multiply(sk_c7,multiply(X1,sk_c7)) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| multiply(X3,sk_c6) != sk_c7
| inverse(X2) != sk_c7
| inverse(X1) != sk_c7
| inverse(X3) != sk_c7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_29]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| inverse(sk_c4) = sk_c7 ),
prove_this_9 ).
cnf(c_0_40,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| multiply(sk_c6,sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_35,c_0_33]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c4,multiply(sk_c6,X1)) = multiply(sk_c7,X1)
| multiply(sk_c7,sk_c3) = sk_c6 ),
inference(spm,[status(thm)],[c_0_16,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
multiply(sk_c7,sk_c7) = sk_c6,
inference(spm,[status(thm)],[c_0_24,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( multiply(sk_c2,sk_c7) = sk_c3
| multiply(sk_c5,sk_c6) = sk_c7 ),
prove_this_15 ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| multiply(sk_c7,multiply(X1,sk_c7)) != sk_c6
| multiply(X2,sk_c6) != sk_c7
| inverse(X1) != sk_c7
| inverse(X2) != sk_c7 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_36]) ).
cnf(c_0_46,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| identity = sk_c7 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_41]),c_0_17]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| multiply(sk_c4,sk_c6) = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_41]),c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( multiply(inverse(sk_c2),sk_c3) = sk_c7
| multiply(sk_c5,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_44]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| multiply(X1,sk_c6) != sk_c7
| inverse(X1) != sk_c7 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_18]),c_0_43])]),c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c7,sk_c3) = sk_c6
| sk_c6 = sk_c7 ),
inference(spm,[status(thm)],[c_0_36,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
( multiply(inverse(inverse(sk_c2)),sk_c7) = sk_c3
| multiply(sk_c5,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( inverse(sk_c2) = sk_c7
| multiply(sk_c5,sk_c6) = sk_c7 ),
prove_this_19 ).
cnf(c_0_54,negated_conjecture,
multiply(sk_c7,sk_c3) = sk_c6,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_46]),c_0_18]),c_0_47]),c_0_51]) ).
cnf(c_0_55,negated_conjecture,
multiply(inverse(sk_c7),sk_c6) = sk_c7,
inference(spm,[status(thm)],[c_0_19,c_0_43]) ).
cnf(c_0_56,negated_conjecture,
( multiply(sk_c5,sk_c6) = sk_c7
| identity = sk_c3 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_17]) ).
cnf(c_0_57,negated_conjecture,
sk_c3 = sk_c7,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_54]),c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c5,sk_c6) = sk_c7
| identity = sk_c7 ),
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,negated_conjecture,
( multiply(inverse(sk_c5),sk_c7) = sk_c6
| identity = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_58]) ).
cnf(c_0_60,negated_conjecture,
( multiply(sk_c2,sk_c7) = sk_c3
| inverse(sk_c5) = sk_c6 ),
prove_this_16 ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c5,sk_c6) = sk_c7
| multiply(sk_c7,sk_c3) = sk_c7 ),
inference(spm,[status(thm)],[c_0_49,c_0_53]) ).
cnf(c_0_62,negated_conjecture,
( multiply(inverse(inverse(sk_c5)),sk_c6) = sk_c7
| identity = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c2,sk_c7) = sk_c7
| inverse(sk_c5) = sk_c6 ),
inference(rw,[status(thm)],[c_0_60,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( multiply(inverse(sk_c5),sk_c7) = sk_c6
| multiply(sk_c7,sk_c3) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
( multiply(sk_c2,sk_c7) = sk_c7
| identity = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_17])]) ).
cnf(c_0_66,negated_conjecture,
( multiply(inverse(inverse(sk_c5)),sk_c6) = sk_c7
| multiply(sk_c7,sk_c3) = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
( multiply(inverse(sk_c2),sk_c7) = sk_c7
| identity = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
( inverse(sk_c2) = sk_c7
| inverse(sk_c5) = sk_c6 ),
prove_this_20 ).
cnf(c_0_69,negated_conjecture,
( multiply(inverse(inverse(sk_c5)),sk_c6) = sk_c7
| sk_c6 = sk_c7 ),
inference(rw,[status(thm)],[c_0_66,c_0_54]) ).
cnf(c_0_70,negated_conjecture,
( inverse(sk_c5) = sk_c6
| identity = sk_c7
| sk_c6 = sk_c7 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_43]) ).
cnf(c_0_71,negated_conjecture,
( sk_c6 = sk_c7
| identity = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_17])]) ).
cnf(c_0_72,negated_conjecture,
( inverse(sk_c7) = sk_c7
| sk_c6 = sk_c7 ),
inference(spm,[status(thm)],[c_0_46,c_0_71]) ).
cnf(c_0_73,negated_conjecture,
( multiply(inverse(sk_c7),sk_c6) = sk_c3
| identity = sk_c7 ),
inference(spm,[status(thm)],[c_0_19,c_0_47]) ).
cnf(c_0_74,negated_conjecture,
( sk_c6 = sk_c7
| identity = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_72]),c_0_43]) ).
cnf(c_0_75,negated_conjecture,
( multiply(inverse(sk_c7),sk_c6) = sk_c7
| identity = sk_c7 ),
inference(rw,[status(thm)],[c_0_73,c_0_57]) ).
cnf(c_0_76,negated_conjecture,
sk_c6 = sk_c7,
inference(spm,[status(thm)],[c_0_71,c_0_74]) ).
cnf(c_0_77,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_78,negated_conjecture,
identity = sk_c7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76]),c_0_17])]) ).
cnf(c_0_79,plain,
multiply(inverse(inverse(X1)),sk_c7) = X1,
inference(rw,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_80,plain,
multiply(inverse(inverse(inverse(X1))),X1) = sk_c7,
inference(spm,[status(thm)],[c_0_19,c_0_79]) ).
cnf(c_0_81,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_80]),c_0_79]) ).
cnf(c_0_82,plain,
multiply(X1,sk_c7) = X1,
inference(rw,[status(thm)],[c_0_79,c_0_81]) ).
cnf(c_0_83,plain,
multiply(sk_c7,X1) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_78]) ).
cnf(c_0_84,plain,
inverse(sk_c7) = sk_c7,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_78]),c_0_78]) ).
cnf(c_0_85,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_76]),c_0_76]),c_0_76]),c_0_76]),c_0_76]),c_0_82]),c_0_83]),c_0_82]),c_0_82]),c_0_82])])])])]),c_0_84])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP226-1 : TPTP v8.2.0. Released v2.5.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 06:03:08 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.50 # Version: 3.1.0
% 0.17/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 # Starting sh5l with 300s (1) cores
% 0.17/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 32664 completed with status 0
% 0.17/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.17/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.50 # No SInE strategy applied
% 0.17/0.50 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.17/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.17/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.50 # Starting sh5l with 136s (1) cores
% 0.17/0.50 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 32669 completed with status 0
% 0.17/0.50 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.17/0.50 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/0.50 # No SInE strategy applied
% 0.17/0.50 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.17/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.50 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.17/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/0.50 # Preprocessing time : 0.001 s
% 0.17/0.50 # Presaturation interreduction done
% 0.17/0.50
% 0.17/0.50 # Proof found!
% 0.17/0.50 # SZS status Unsatisfiable
% 0.17/0.50 # SZS output start CNFRefutation
% See solution above
% 0.17/0.50 # Parsed axioms : 24
% 0.17/0.50 # Removed by relevancy pruning/SinE : 0
% 0.17/0.50 # Initial clauses : 24
% 0.17/0.50 # Removed in clause preprocessing : 0
% 0.17/0.50 # Initial clauses in saturation : 24
% 0.17/0.50 # Processed clauses : 534
% 0.17/0.50 # ...of these trivial : 83
% 0.17/0.50 # ...subsumed : 142
% 0.17/0.50 # ...remaining for further processing : 309
% 0.17/0.50 # Other redundant clauses eliminated : 14
% 0.17/0.50 # Clauses deleted for lack of memory : 0
% 0.17/0.50 # Backward-subsumed : 43
% 0.17/0.50 # Backward-rewritten : 214
% 0.17/0.50 # Generated clauses : 1394
% 0.17/0.50 # ...of the previous two non-redundant : 1218
% 0.17/0.50 # ...aggressively subsumed : 0
% 0.17/0.50 # Contextual simplify-reflections : 18
% 0.17/0.50 # Paramodulations : 1389
% 0.17/0.50 # Factorizations : 0
% 0.17/0.50 # NegExts : 0
% 0.17/0.50 # Equation resolutions : 14
% 0.17/0.50 # Disequality decompositions : 0
% 0.17/0.50 # Total rewrite steps : 1350
% 0.17/0.50 # ...of those cached : 1197
% 0.17/0.50 # Propositional unsat checks : 0
% 0.17/0.50 # Propositional check models : 0
% 0.17/0.50 # Propositional check unsatisfiable : 0
% 0.17/0.50 # Propositional clauses : 0
% 0.17/0.50 # Propositional clauses after purity: 0
% 0.17/0.50 # Propositional unsat core size : 0
% 0.17/0.50 # Propositional preprocessing time : 0.000
% 0.17/0.50 # Propositional encoding time : 0.000
% 0.17/0.50 # Propositional solver time : 0.000
% 0.17/0.50 # Success case prop preproc time : 0.000
% 0.17/0.50 # Success case prop encoding time : 0.000
% 0.17/0.50 # Success case prop solver time : 0.000
% 0.17/0.50 # Current number of processed clauses : 23
% 0.17/0.50 # Positive orientable unit clauses : 23
% 0.17/0.50 # Positive unorientable unit clauses: 0
% 0.17/0.50 # Negative unit clauses : 0
% 0.17/0.50 # Non-unit-clauses : 0
% 0.17/0.50 # Current number of unprocessed clauses: 42
% 0.17/0.50 # ...number of literals in the above : 78
% 0.17/0.50 # Current number of archived formulas : 0
% 0.17/0.50 # Current number of archived clauses : 281
% 0.17/0.50 # Clause-clause subsumption calls (NU) : 1101
% 0.17/0.50 # Rec. Clause-clause subsumption calls : 783
% 0.17/0.50 # Non-unit clause-clause subsumptions : 188
% 0.17/0.50 # Unit Clause-clause subsumption calls : 128
% 0.17/0.50 # Rewrite failures with RHS unbound : 0
% 0.17/0.50 # BW rewrite match attempts : 33
% 0.17/0.50 # BW rewrite match successes : 19
% 0.17/0.50 # Condensation attempts : 0
% 0.17/0.50 # Condensation successes : 0
% 0.17/0.50 # Termbank termtop insertions : 17475
% 0.17/0.50 # Search garbage collected termcells : 26
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.033 s
% 0.17/0.51 # System time : 0.003 s
% 0.17/0.51 # Total time : 0.036 s
% 0.17/0.51 # Maximum resident set size: 1604 pages
% 0.17/0.51
% 0.17/0.51 # -------------------------------------------------
% 0.17/0.51 # User time : 0.169 s
% 0.17/0.51 # System time : 0.007 s
% 0.17/0.51 # Total time : 0.176 s
% 0.17/0.51 # Maximum resident set size: 1708 pages
% 0.17/0.51 % E---3.1 exiting
% 0.17/0.51 % E exiting
%------------------------------------------------------------------------------