%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP355-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:43:18 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 18
% Syntax : Number of clauses : 82 ( 19 unt; 45 nHn; 67 RR)
% Number of literals : 223 ( 222 equ; 103 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this_22,negated_conjecture,
( inverse(X5) != sk_c8
| multiply(X5,sk_c8) != X4
| multiply(sk_c8,X4) != sk_c6
| inverse(X3) != sk_c6
| multiply(X3,sk_c6) != sk_c7
| inverse(X2) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| multiply(X1,sk_c8) != sk_c7
| multiply(sk_c7,sk_c6) != sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c4) = sk_c8
| inverse(sk_c1) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_18,negated_conjecture,
( inverse(sk_c3) = sk_c6
| inverse(sk_c1) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_18) ).
cnf(prove_this_17,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c7
| inverse(sk_c1) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_17) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c7
| multiply(sk_c7,sk_c6) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_16,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c1) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| inverse(sk_c1) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c3) = sk_c6
| multiply(sk_c7,sk_c6) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_20,negated_conjecture,
( multiply(sk_c4,sk_c8) = sk_c5
| inverse(sk_c1) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_19,negated_conjecture,
( multiply(sk_c8,sk_c5) = sk_c6
| inverse(sk_c1) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_8,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| multiply(sk_c1,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_9,negated_conjecture,
( inverse(sk_c2) = sk_c8
| multiply(sk_c1,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_9) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c4,sk_c8) = sk_c5
| multiply(sk_c7,sk_c6) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_7,negated_conjecture,
( inverse(sk_c4) = sk_c8
| multiply(sk_c7,sk_c6) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c8,sk_c5) = sk_c6
| multiply(sk_c7,sk_c6) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(c_0_18,negated_conjecture,
( inverse(X5) != sk_c8
| multiply(X5,sk_c8) != X4
| multiply(sk_c8,X4) != sk_c6
| inverse(X3) != sk_c6
| multiply(X3,sk_c6) != sk_c7
| inverse(X2) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| multiply(X1,sk_c8) != sk_c7
| multiply(sk_c7,sk_c6) != sk_c8 ),
inference(fof_simplification,[status(thm)],[prove_this_22]) ).
cnf(c_0_19,negated_conjecture,
( inverse(X5) != sk_c8
| multiply(X5,sk_c8) != X4
| multiply(sk_c8,X4) != sk_c6
| inverse(X3) != sk_c6
| multiply(X3,sk_c6) != sk_c7
| inverse(X2) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| inverse(X1) != sk_c8
| multiply(X1,sk_c8) != sk_c7
| multiply(sk_c7,sk_c6) != sk_c8 ),
c_0_18 ).
cnf(c_0_20,negated_conjecture,
( inverse(X4) != sk_c8
| inverse(X3) != sk_c8
| inverse(X2) != sk_c6
| inverse(X1) != sk_c8
| multiply(X4,sk_c8) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| multiply(X2,sk_c6) != sk_c7
| multiply(sk_c7,sk_c6) != sk_c8
| multiply(sk_c8,multiply(X1,sk_c8)) != sk_c6 ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( inverse(sk_c4) = sk_c8
| inverse(sk_c1) = sk_c8 ),
prove_this_21 ).
cnf(c_0_22,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_23,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_24,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_25,negated_conjecture,
( inverse(X3) != sk_c8
| inverse(X2) != sk_c8
| inverse(X1) != sk_c6
| multiply(X3,sk_c8) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X1,sk_c6) != sk_c7
| multiply(sk_c7,sk_c6) != sk_c8
| multiply(sk_c8,multiply(sk_c4,sk_c8)) != sk_c6
| inverse(sk_c1) = sk_c8 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( inverse(sk_c3) = sk_c6
| inverse(sk_c1) = sk_c8 ),
prove_this_18 ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c7
| inverse(sk_c1) = sk_c8 ),
prove_this_17 ).
cnf(c_0_28,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c3,sk_c6) = sk_c7
| multiply(sk_c7,sk_c6) = sk_c8 ),
prove_this_3 ).
cnf(c_0_30,negated_conjecture,
( inverse(X2) != sk_c8
| inverse(X1) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| multiply(X1,sk_c8) != sk_c7
| multiply(sk_c7,sk_c6) != sk_c8
| multiply(sk_c8,multiply(sk_c4,sk_c8)) != sk_c6
| inverse(sk_c1) = sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c2) = sk_c8
| inverse(sk_c1) = sk_c8 ),
prove_this_16 ).
cnf(c_0_32,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| inverse(sk_c1) = sk_c8 ),
prove_this_15 ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(inverse(sk_c3),sk_c7) = sk_c6 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( inverse(sk_c3) = sk_c6
| multiply(sk_c7,sk_c6) = sk_c8 ),
prove_this_4 ).
cnf(c_0_35,negated_conjecture,
( inverse(X1) != sk_c8
| multiply(X1,sk_c8) != sk_c7
| multiply(sk_c7,sk_c6) != sk_c8
| multiply(sk_c8,multiply(sk_c4,sk_c8)) != sk_c6
| inverse(sk_c1) = sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c6,sk_c7) = sk_c6
| multiply(sk_c7,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c7,sk_c6) != sk_c8
| multiply(sk_c8,multiply(sk_c4,sk_c8)) != sk_c6
| inverse(sk_c1) = sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_31]),c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( identity = sk_c7
| multiply(sk_c7,sk_c6) = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_36]),c_0_23]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c4,sk_c8) = sk_c5
| inverse(sk_c1) = sk_c8 ),
prove_this_20 ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c8,sk_c5) = sk_c6
| inverse(sk_c1) = sk_c8 ),
prove_this_19 ).
cnf(c_0_41,negated_conjecture,
( multiply(sk_c8,multiply(sk_c4,sk_c8)) != sk_c6
| identity = sk_c7
| inverse(sk_c1) = sk_c8 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c8,sk_c1) = identity
| multiply(sk_c4,sk_c8) = sk_c5 ),
inference(spm,[status(thm)],[c_0_23,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c8,sk_c1) = identity
| multiply(sk_c8,sk_c5) = sk_c6 ),
inference(spm,[status(thm)],[c_0_23,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( identity = sk_c7
| inverse(sk_c1) = sk_c8
| multiply(sk_c8,sk_c1) = identity ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c7
| multiply(sk_c1,sk_c8) = sk_c7 ),
prove_this_8 ).
cnf(c_0_46,negated_conjecture,
( identity = sk_c7
| multiply(sk_c8,sk_c1) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(inverse(sk_c2),sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_28,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
( inverse(sk_c2) = sk_c8
| multiply(sk_c1,sk_c8) = sk_c7 ),
prove_this_9 ).
cnf(c_0_49,negated_conjecture,
( identity = sk_c7
| multiply(sk_c8,multiply(sk_c1,X1)) = X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_46]),c_0_24]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c8
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
( identity = sk_c7
| multiply(sk_c8,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_52,negated_conjecture,
identity = sk_c7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_51]),c_0_23])]) ).
cnf(c_0_53,negated_conjecture,
( inverse(X3) != sk_c8
| inverse(X2) != sk_c8
| inverse(X1) != sk_c6
| multiply(X3,sk_c8) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X1,sk_c6) != sk_c7
| multiply(sk_c7,sk_c6) != sk_c8
| multiply(sk_c8,multiply(sk_c2,sk_c8)) != sk_c6
| inverse(sk_c1) = sk_c8 ),
inference(spm,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_54,negated_conjecture,
( multiply(sk_c4,sk_c8) = sk_c5
| multiply(sk_c7,sk_c6) = sk_c8 ),
prove_this_6 ).
cnf(c_0_55,plain,
multiply(inverse(X1),X1) = sk_c7,
inference(rw,[status(thm)],[c_0_23,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
( inverse(X2) != sk_c8
| inverse(X1) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| multiply(X1,sk_c8) != sk_c7
| multiply(sk_c7,sk_c6) != sk_c8
| multiply(sk_c8,multiply(sk_c2,sk_c8)) != sk_c6
| inverse(sk_c1) = sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_26]),c_0_27]) ).
cnf(c_0_57,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c8
| multiply(inverse(sk_c4),sk_c5) = sk_c8 ),
inference(spm,[status(thm)],[c_0_28,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( inverse(sk_c4) = sk_c8
| multiply(sk_c7,sk_c6) = sk_c8 ),
prove_this_7 ).
cnf(c_0_59,plain,
multiply(inverse(inverse(X1)),sk_c7) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_55]) ).
cnf(c_0_60,plain,
multiply(sk_c7,X1) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_52]) ).
cnf(c_0_61,negated_conjecture,
( inverse(X1) != sk_c8
| multiply(X1,sk_c8) != sk_c7
| multiply(sk_c7,sk_c6) != sk_c8
| multiply(sk_c8,multiply(sk_c2,sk_c8)) != sk_c6
| inverse(sk_c1) = sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_31]),c_0_32]) ).
cnf(c_0_62,negated_conjecture,
( multiply(sk_c8,sk_c5) = sk_c8
| multiply(sk_c7,sk_c6) = sk_c8 ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,negated_conjecture,
( multiply(sk_c8,sk_c5) = sk_c6
| multiply(sk_c7,sk_c6) = sk_c8 ),
prove_this_5 ).
cnf(c_0_64,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_59]),c_0_60]) ).
cnf(c_0_65,negated_conjecture,
( multiply(sk_c7,sk_c6) != sk_c8
| multiply(sk_c8,multiply(sk_c2,sk_c8)) != sk_c6
| inverse(sk_c1) = sk_c8 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_31]),c_0_32]) ).
cnf(c_0_66,negated_conjecture,
( sk_c6 = sk_c8
| multiply(sk_c8,sk_c5) = sk_c8 ),
inference(rw,[status(thm)],[c_0_62,c_0_60]) ).
cnf(c_0_67,negated_conjecture,
( sk_c6 = sk_c8
| multiply(sk_c8,sk_c5) = sk_c6 ),
inference(rw,[status(thm)],[c_0_63,c_0_60]) ).
cnf(c_0_68,plain,
multiply(X1,sk_c7) = X1,
inference(rw,[status(thm)],[c_0_59,c_0_64]) ).
cnf(c_0_69,negated_conjecture,
( sk_c6 != sk_c8
| multiply(sk_c8,multiply(sk_c2,sk_c8)) != sk_c6
| inverse(sk_c1) = sk_c8 ),
inference(rw,[status(thm)],[c_0_65,c_0_60]) ).
cnf(c_0_70,negated_conjecture,
sk_c6 = sk_c8,
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_68]),c_0_68]) ).
cnf(c_0_72,negated_conjecture,
( multiply(sk_c8,multiply(sk_c2,sk_c8)) != sk_c8
| inverse(sk_c1) = sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70]),c_0_70])]) ).
cnf(c_0_73,plain,
multiply(X1,inverse(X1)) = sk_c7,
inference(spm,[status(thm)],[c_0_55,c_0_71]) ).
cnf(c_0_74,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c1,sk_c8) = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_45]),c_0_68])]) ).
cnf(c_0_75,negated_conjecture,
( inverse(X4) != sk_c8
| inverse(X3) != sk_c8
| inverse(X2) != sk_c8
| inverse(X1) != sk_c8
| multiply(X4,sk_c8) != sk_c7
| multiply(X3,sk_c8) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(sk_c8,multiply(X1,sk_c8)) != sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_60]),c_0_70]),c_0_70]),c_0_70]),c_0_70])]) ).
cnf(c_0_76,negated_conjecture,
multiply(sk_c1,sk_c8) = sk_c7,
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
( inverse(X3) != sk_c8
| inverse(X2) != sk_c8
| inverse(X1) != sk_c8
| multiply(X3,sk_c8) != sk_c7
| multiply(X2,sk_c8) != sk_c7
| multiply(X1,sk_c8) != sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_71])]),c_0_23]),c_0_52]),c_0_68])]) ).
cnf(c_0_78,negated_conjecture,
inverse(sk_c1) = sk_c8,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_76]),c_0_68]) ).
cnf(c_0_79,negated_conjecture,
( inverse(X2) != sk_c8
| inverse(X1) != sk_c8
| multiply(X2,sk_c8) != sk_c7
| multiply(X1,sk_c8) != sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_76])]) ).
cnf(c_0_80,negated_conjecture,
( inverse(X1) != sk_c8
| multiply(X1,sk_c8) != sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_78]),c_0_76])]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_78]),c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP355-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n001.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 20:15:58 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.46 % Version: 3.5.1
% 0.15/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1303955 completed with status 0
% 0.15/0.46 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46 % No SInE strategy applied
% 0.15/0.46 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.15/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.46 % new_bool_1 with pid 1303966 completed with status 0
% 0.15/0.46 % Result found by new_bool_1
% 0.15/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46 % No SInE strategy applied
% 0.15/0.46 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.15/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.46 % Preprocessing time : 0.001 s
% 0.15/0.46 % Presaturation interreduction done
% 0.15/0.46
% 0.15/0.46 % Proof found!
% 0.15/0.46 % SZS status Unsatisfiable
% 0.15/0.46 % SZS output start CNFRefutation
% See solution above
% 0.15/0.46 % Parsed axioms : 25
% 0.15/0.46 % Removed by relevancy pruning/SinE : 0
% 0.15/0.46 % Initial clauses : 25
% 0.15/0.46 % Removed in clause preprocessing : 0
% 0.15/0.46 % Initial clauses in saturation : 25
% 0.15/0.46 % Processed clauses : 351
% 0.15/0.46 % ...of these trivial : 32
% 0.15/0.46 % ...subsumed : 107
% 0.15/0.46 % ...remaining for further processing : 212
% 0.15/0.46 % Other redundant clauses eliminated : 4
% 0.15/0.46 % Clauses deleted for lack of memory : 0
% 0.15/0.46 % Backward-subsumed : 54
% 0.15/0.46 % Backward-rewritten : 114
% 0.15/0.46 % Generated clauses : 964
% 0.15/0.46 % ...of the previous two non-redundant : 935
% 0.15/0.46 % ...aggressively subsumed : 0
% 0.15/0.46 % Contextual simplify-reflections : 11
% 0.15/0.46 % Paramodulations : 957
% 0.15/0.46 % Factorizations : 3
% 0.15/0.46 % NegExts : 0
% 0.15/0.46 % Equation resolutions : 4
% 0.15/0.46 % Disequality decompositions : 0
% 0.15/0.46 % Total rewrite steps : 327
% 0.15/0.46 % ...of those cached : 270
% 0.15/0.46 % Propositional unsat checks : 0
% 0.15/0.46 % Propositional check models : 0
% 0.15/0.46 % Propositional check unsatisfiable : 0
% 0.15/0.46 % Propositional clauses : 0
% 0.15/0.46 % Propositional clauses after purity: 0
% 0.15/0.46 % Propositional unsat core size : 0
% 0.15/0.46 % Propositional preprocessing time : 0.000
% 0.15/0.46 % Propositional encoding time : 0.000
% 0.15/0.46 % Propositional solver time : 0.000
% 0.15/0.46 % Success case prop preproc time : 0.000
% 0.15/0.46 % Success case prop encoding time : 0.000
% 0.15/0.46 % Success case prop solver time : 0.000
% 0.15/0.46 % Current number of processed clauses : 18
% 0.15/0.46 % Positive orientable unit clauses : 17
% 0.15/0.46 % Positive unorientable unit clauses: 0
% 0.15/0.46 % Negative unit clauses : 0
% 0.15/0.46 % Non-unit-clauses : 1
% 0.15/0.46 % Current number of unprocessed clauses: 245
% 0.15/0.46 % ...number of literals in the above : 851
% 0.15/0.46 % Current number of archived formulas : 0
% 0.15/0.46 % Current number of archived clauses : 193
% 0.15/0.46 % Clause-clause subsumption calls (NU) : 921
% 0.15/0.46 % Rec. Clause-clause subsumption calls : 804
% 0.15/0.46 % Non-unit clause-clause subsumptions : 133
% 0.15/0.46 % Unit Clause-clause subsumption calls : 229
% 0.15/0.46 % Rewrite failures with RHS unbound : 0
% 0.15/0.46 % BW rewrite match attempts : 25
% 0.15/0.46 % BW rewrite match successes : 17
% 0.15/0.46 % Condensation attempts : 0
% 0.15/0.46 % Condensation successes : 0
% 0.15/0.46 % Termbank termtop insertions : 12856
% 0.15/0.46 % Search garbage collected termcells : 28
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.020 s
% 0.15/0.46 % System time : 0.005 s
% 0.15/0.46 % Total time : 0.025 s
% 0.15/0.46 % Maximum resident set size: 3644 pages
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.099 s
% 0.15/0.46 % System time : 0.018 s
% 0.15/0.46 % Total time : 0.116 s
% 0.15/0.46 % Maximum resident set size: 4608 pages
% 0.15/0.46 % E exiting
%------------------------------------------------------------------------------