%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP209-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:42:54 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.70s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of clauses : 71 ( 22 unt; 45 nHn; 55 RR)
% Number of literals : 153 ( 152 equ; 42 neg)
% Maximal clause size : 13 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-2 aty)
% Number of variables : 48 ( 3 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_11,negated_conjecture,
( inverse(sk_c6) = sk_c9
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_4,negated_conjecture,
( inverse(sk_c6) = sk_c9
| multiply(sk_c1,sk_c2) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c10
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_36,negated_conjecture,
( inverse(sk_c5) = sk_c10
| inverse(sk_c3) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_36) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c10
| multiply(sk_c1,sk_c2) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_34,negated_conjecture,
( inverse(sk_c7) = sk_c8
| multiply(sk_c3,sk_c10) = sk_c4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_34) ).
cnf(prove_this_27,negated_conjecture,
( inverse(sk_c7) = sk_c8
| multiply(sk_c10,sk_c4) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_27) ).
cnf(prove_this_33,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| multiply(sk_c3,sk_c10) = sk_c4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_33) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| multiply(sk_c10,sk_c4) = sk_c9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_37,negated_conjecture,
( multiply(sk_c5,sk_c9) = sk_c10
| inverse(sk_c3) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_37) ).
cnf(prove_this_43,negated_conjecture,
( multiply(X8,sk_c10) != sk_c9
| inverse(X7) != X8
| multiply(X7,X8) != sk_c9
| inverse(X6) != sk_c9
| multiply(X6,sk_c9) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| inverse(X5) != sk_c10
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != X3
| multiply(sk_c10,X3) != sk_c9
| multiply(X2,sk_c9) != sk_c10
| inverse(X1) != X2
| multiply(X1,X2) != sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_43) ).
cnf(c_0_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_19,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( inverse(sk_c6) = sk_c9
| inverse(sk_c1) = sk_c2 ),
prove_this_11 ).
cnf(c_0_22,negated_conjecture,
( inverse(sk_c6) = sk_c9
| multiply(sk_c1,sk_c2) = sk_c10 ),
prove_this_4 ).
cnf(c_0_23,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c9,sk_c6) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c9,sk_c6) = identity
| multiply(sk_c1,sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c1,sk_c2) = identity
| multiply(sk_c9,sk_c6) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( identity = sk_c10
| multiply(sk_c9,sk_c6) = identity ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c10
| inverse(sk_c1) = sk_c2 ),
prove_this_10 ).
cnf(c_0_30,negated_conjecture,
( identity = sk_c10
| inverse(sk_c9) = sk_c6 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_27]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( inverse(sk_c5) = sk_c10
| inverse(sk_c3) = sk_c10 ),
prove_this_36 ).
cnf(c_0_32,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c6,sk_c9) = sk_c10
| multiply(sk_c1,sk_c2) = sk_c10 ),
prove_this_3 ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c6,sk_c9) = identity
| multiply(sk_c1,sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c1,sk_c2) = identity
| multiply(sk_c6,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( identity = sk_c10
| multiply(sk_c6,sk_c9) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( inverse(sk_c10) = sk_c5
| inverse(sk_c3) = sk_c10 ),
inference(spm,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_38,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( identity = sk_c10
| multiply(sk_c1,sk_c2) = sk_c10 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( identity = sk_c10
| multiply(sk_c1,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( inverse(sk_c7) = sk_c8
| multiply(sk_c3,sk_c10) = sk_c4 ),
prove_this_34 ).
cnf(c_0_42,negated_conjecture,
( inverse(sk_c7) = sk_c8
| multiply(sk_c10,sk_c4) = sk_c9 ),
prove_this_27 ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c10) = sk_c3
| inverse(sk_c10) = sk_c5 ),
inference(spm,[status(thm)],[c_0_20,c_0_37]) ).
cnf(c_0_44,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
identity = sk_c10,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| multiply(sk_c3,sk_c10) = sk_c4 ),
prove_this_33 ).
cnf(c_0_47,negated_conjecture,
( multiply(sk_c7,sk_c8) = identity
| multiply(sk_c3,sk_c10) = sk_c4 ),
inference(spm,[status(thm)],[c_0_23,c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| multiply(sk_c10,sk_c4) = sk_c9 ),
prove_this_26 ).
cnf(c_0_49,negated_conjecture,
( multiply(sk_c7,sk_c8) = identity
| multiply(sk_c10,sk_c4) = sk_c9 ),
inference(spm,[status(thm)],[c_0_23,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( multiply(sk_c5,sk_c9) = sk_c10
| inverse(sk_c3) = sk_c10 ),
prove_this_37 ).
cnf(c_0_51,negated_conjecture,
( inverse(sk_c5) = sk_c10
| inverse(sk_c10) = sk_c3 ),
inference(spm,[status(thm)],[c_0_20,c_0_43]) ).
cnf(c_0_52,plain,
inverse(sk_c10) = sk_c10,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_45]) ).
cnf(c_0_53,negated_conjecture,
( identity = sk_c9
| multiply(sk_c3,sk_c10) = sk_c4 ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,plain,
multiply(X1,sk_c10) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_45]) ).
cnf(c_0_55,negated_conjecture,
( identity = sk_c9
| multiply(sk_c10,sk_c4) = sk_c9 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,plain,
multiply(sk_c10,X1) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_45]) ).
cnf(c_0_57,negated_conjecture,
( inverse(sk_c10) = sk_c3
| multiply(sk_c5,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_20,c_0_50]) ).
cnf(c_0_58,negated_conjecture,
( sk_c3 = sk_c10
| inverse(sk_c5) = sk_c10 ),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_59,negated_conjecture,
( sk_c4 = sk_c3
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_45]),c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( sk_c4 = sk_c9
| sk_c9 = sk_c10 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_45]),c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( sk_c3 = sk_c10
| multiply(sk_c5,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_57,c_0_52]) ).
cnf(c_0_62,negated_conjecture,
( sk_c5 = sk_c10
| sk_c3 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_58]),c_0_52]) ).
cnf(c_0_63,negated_conjecture,
( multiply(X8,sk_c10) != sk_c9
| inverse(X7) != X8
| multiply(X7,X8) != sk_c9
| inverse(X6) != sk_c9
| multiply(X6,sk_c9) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| inverse(X5) != sk_c10
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != X3
| multiply(sk_c10,X3) != sk_c9
| multiply(X2,sk_c9) != sk_c10
| inverse(X1) != X2
| multiply(X1,X2) != sk_c10 ),
inference(fof_simplification,[status(thm)],[prove_this_43]) ).
cnf(c_0_64,negated_conjecture,
( sk_c9 = sk_c10
| sk_c3 = sk_c9 ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,negated_conjecture,
( sk_c9 = sk_c10
| sk_c3 = sk_c10 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_56]) ).
cnf(c_0_66,negated_conjecture,
( multiply(X8,sk_c10) != sk_c9
| inverse(X7) != X8
| multiply(X7,X8) != sk_c9
| inverse(X6) != sk_c9
| multiply(X6,sk_c9) != sk_c10
| multiply(X5,sk_c9) != sk_c10
| inverse(X5) != sk_c10
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != X3
| multiply(sk_c10,X3) != sk_c9
| multiply(X2,sk_c9) != sk_c10
| inverse(X1) != X2
| multiply(X1,X2) != sk_c10 ),
c_0_63 ).
cnf(c_0_67,negated_conjecture,
sk_c9 = sk_c10,
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
( inverse(X2) != sk_c10
| inverse(X1) != sk_c10 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[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)],[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(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_66])])]),c_0_23]),c_0_23]),c_0_54]),c_0_67]),c_0_67]),c_0_54]),c_0_67]),c_0_54]),c_0_67]),c_0_54]),c_0_54]),c_0_56]),c_0_67]),c_0_45]),c_0_67]),c_0_45]),c_0_67])])])])]),c_0_52])]) ).
cnf(c_0_69,negated_conjecture,
inverse(X1) != sk_c10,
inference(spm,[status(thm)],[c_0_68,c_0_52]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_31,c_0_69]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP209-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.57 % Computer : n013.cluster.edu
% 0.10/0.57 % Model : x86_64 x86_64
% 0.10/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57 % Memory : 8046.5625MB
% 0.10/0.57 % OS : Linux 6.8.0-71-generic
% 0.10/0.57 % CPULimit : 300
% 0.10/0.57 % WCLimit : 300
% 0.10/0.57 % DateTime : Sun Sep 20 20:05:37 UTC 2026
% 0.10/0.57 % CPUTime :
% 0.10/0.57 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.61 Running first-order theorem proving
% 0.10/0.61 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.14/0.70 % Version: 3.5.1
% 0.14/0.70 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.70 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.70 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.70 % Starting sh5l with 300s (1) cores
% 0.14/0.70 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3297986 completed with status 0
% 0.14/0.70 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.14/0.70 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.70 % No SInE strategy applied
% 0.14/0.70 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.14/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.70 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.14/0.70 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.70 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.70 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.70 % SubtermCWHack with pid 3297991 completed with status 0
% 0.14/0.70 % Result found by SubtermCWHack
% 0.14/0.70 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.70 % No SInE strategy applied
% 0.14/0.70 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.14/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.70 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.70 % Preprocessing time : 0.001 s
% 0.14/0.70
% 0.14/0.70 % Proof found!
% 0.14/0.70 % SZS status Unsatisfiable
% 0.14/0.70 % SZS output start CNFRefutation
% See solution above
% 0.14/0.70 % Parsed axioms : 46
% 0.14/0.70 % Removed by relevancy pruning/SinE : 0
% 0.14/0.70 % Initial clauses : 46
% 0.14/0.70 % Removed in clause preprocessing : 0
% 0.14/0.70 % Initial clauses in saturation : 46
% 0.14/0.70 % Processed clauses : 1288
% 0.14/0.70 % ...of these trivial : 15
% 0.14/0.70 % ...subsumed : 752
% 0.14/0.70 % ...remaining for further processing : 521
% 0.14/0.70 % Other redundant clauses eliminated : 7
% 0.14/0.70 % Clauses deleted for lack of memory : 0
% 0.14/0.70 % Backward-subsumed : 10
% 0.14/0.70 % Backward-rewritten : 359
% 0.14/0.70 % Generated clauses : 6245
% 0.14/0.70 % ...of the previous two non-redundant : 5908
% 0.14/0.70 % ...aggressively subsumed : 0
% 0.14/0.70 % Contextual simplify-reflections : 0
% 0.14/0.70 % Paramodulations : 6211
% 0.14/0.70 % Factorizations : 6
% 0.14/0.70 % NegExts : 0
% 0.14/0.70 % Equation resolutions : 7
% 0.14/0.70 % Disequality decompositions : 0
% 0.14/0.70 % Total rewrite steps : 3631
% 0.14/0.70 % ...of those cached : 3234
% 0.14/0.70 % Propositional unsat checks : 0
% 0.14/0.70 % Propositional check models : 0
% 0.14/0.70 % Propositional check unsatisfiable : 0
% 0.14/0.70 % Propositional clauses : 0
% 0.14/0.70 % Propositional clauses after purity: 0
% 0.14/0.70 % Propositional unsat core size : 0
% 0.14/0.70 % Propositional preprocessing time : 0.000
% 0.14/0.70 % Propositional encoding time : 0.000
% 0.14/0.70 % Propositional solver time : 0.000
% 0.14/0.70 % Success case prop preproc time : 0.000
% 0.14/0.70 % Success case prop encoding time : 0.000
% 0.14/0.70 % Success case prop solver time : 0.000
% 0.14/0.70 % Current number of processed clauses : 125
% 0.14/0.70 % Positive orientable unit clauses : 18
% 0.14/0.70 % Positive unorientable unit clauses: 0
% 0.14/0.70 % Negative unit clauses : 1
% 0.14/0.70 % Non-unit-clauses : 106
% 0.14/0.70 % Current number of unprocessed clauses: 2207
% 0.14/0.70 % ...number of literals in the above : 4908
% 0.14/0.70 % Current number of archived formulas : 0
% 0.14/0.70 % Current number of archived clauses : 394
% 0.14/0.70 % Clause-clause subsumption calls (NU) : 5822
% 0.14/0.70 % Rec. Clause-clause subsumption calls : 5820
% 0.14/0.70 % Non-unit clause-clause subsumptions : 757
% 0.14/0.70 % Unit Clause-clause subsumption calls : 399
% 0.14/0.70 % Rewrite failures with RHS unbound : 0
% 0.14/0.70 % BW rewrite match attempts : 30
% 0.14/0.70 % BW rewrite match successes : 17
% 0.14/0.70 % Condensation attempts : 0
% 0.14/0.70 % Condensation successes : 0
% 0.14/0.70 % Termbank termtop insertions : 50582
% 0.14/0.70 % Search garbage collected termcells : 38
% 0.14/0.70
% 0.14/0.70 % -------------------------------------------------
% 0.14/0.70 % User time : 0.059 s
% 0.14/0.70 % System time : 0.004 s
% 0.14/0.70 % Total time : 0.063 s
% 0.14/0.70 % Maximum resident set size: 3656 pages
% 0.14/0.70
% 0.14/0.70 % -------------------------------------------------
% 0.14/0.70 % User time : 0.245 s
% 0.14/0.70 % System time : 0.019 s
% 0.14/0.70 % Total time : 0.263 s
% 0.14/0.70 % Maximum resident set size: 4608 pages
% 0.14/0.70 % E exiting
%------------------------------------------------------------------------------