%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP230-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 : n008.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:39:02 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 14
% Syntax : Number of clauses : 76 ( 23 unt; 50 nHn; 59 RR)
% Number of literals : 153 ( 152 equ; 31 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 5 ( 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 : 41 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
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_20,negated_conjecture,
( inverse(sk_c3) = sk_c4
| inverse(sk_c2) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_14,negated_conjecture,
( inverse(sk_c3) = sk_c4
| multiply(sk_c2,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_19,negated_conjecture,
( multiply(sk_c3,sk_c4) = sk_c8
| inverse(sk_c2) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_13,negated_conjecture,
( multiply(sk_c3,sk_c4) = sk_c8
| multiply(sk_c2,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_13) ).
cnf(prove_this_6,negated_conjecture,
( inverse(sk_c5) = sk_c8
| inverse(sk_c1) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c6
| inverse(sk_c1) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c8,sk_c6) = sk_c7
| inverse(sk_c1) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c1,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c6
| multiply(sk_c1,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c8,sk_c6) = sk_c7
| multiply(sk_c1,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_10) ).
cnf(prove_this_25,negated_conjecture,
( inverse(X6) != sk_c8
| multiply(X6,sk_c8) != X5
| multiply(sk_c8,X5) != sk_c7
| multiply(X4,sk_c7) != sk_c8
| inverse(X3) != X4
| multiply(X3,X4) != sk_c8
| inverse(X2) != sk_c7
| multiply(X2,sk_c7) != sk_c8
| multiply(X1,sk_c7) != sk_c8
| inverse(X1) != sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_25) ).
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_c3) = sk_c4
| inverse(sk_c2) = sk_c7 ),
prove_this_20 ).
cnf(c_0_22,negated_conjecture,
( inverse(sk_c3) = sk_c4
| multiply(sk_c2,sk_c7) = sk_c8 ),
prove_this_14 ).
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_c2) = sk_c7
| multiply(sk_c4,sk_c3) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c4,sk_c3) = identity
| multiply(sk_c2,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c2,sk_c7) = identity
| multiply(sk_c4,sk_c3) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( identity = sk_c8
| multiply(sk_c4,sk_c3) = 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,
( identity = sk_c8
| inverse(sk_c4) = sk_c3 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_27]),c_0_28]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c3,sk_c4) = sk_c8
| inverse(sk_c2) = sk_c7 ),
prove_this_19 ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c3,sk_c4) = sk_c8
| multiply(sk_c2,sk_c7) = sk_c8 ),
prove_this_13 ).
cnf(c_0_32,negated_conjecture,
( identity = sk_c8
| multiply(sk_c3,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c2,sk_c7) = identity
| multiply(sk_c3,sk_c4) = sk_c8 ),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( inverse(sk_c5) = sk_c8
| inverse(sk_c1) = sk_c8 ),
prove_this_6 ).
cnf(c_0_35,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_36,negated_conjecture,
( identity = sk_c8
| multiply(sk_c2,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( identity = sk_c8
| multiply(sk_c2,sk_c7) = identity ),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( inverse(sk_c8) = sk_c5
| inverse(sk_c1) = sk_c8 ),
inference(spm,[status(thm)],[c_0_20,c_0_34]) ).
cnf(c_0_39,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c6
| inverse(sk_c1) = sk_c8 ),
prove_this_5 ).
cnf(c_0_41,negated_conjecture,
identity = sk_c8,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( multiply(sk_c8,sk_c6) = sk_c7
| inverse(sk_c1) = sk_c8 ),
prove_this_4 ).
cnf(c_0_43,negated_conjecture,
( inverse(sk_c8) = sk_c1
| inverse(sk_c8) = sk_c5 ),
inference(spm,[status(thm)],[c_0_20,c_0_38]) ).
cnf(c_0_44,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( inverse(sk_c8) = sk_c1
| multiply(sk_c5,sk_c8) = sk_c6 ),
inference(spm,[status(thm)],[c_0_20,c_0_40]) ).
cnf(c_0_46,plain,
multiply(X1,sk_c8) = X1,
inference(rw,[status(thm)],[c_0_28,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( inverse(sk_c8) = sk_c1
| multiply(sk_c8,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_20,c_0_42]) ).
cnf(c_0_48,plain,
multiply(sk_c8,X1) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_41]) ).
cnf(c_0_49,negated_conjecture,
( inverse(sk_c5) = sk_c8
| inverse(sk_c8) = sk_c1 ),
inference(spm,[status(thm)],[c_0_20,c_0_43]) ).
cnf(c_0_50,plain,
inverse(sk_c8) = sk_c8,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_41]),c_0_41]) ).
cnf(c_0_51,plain,
multiply(X1,inverse(X1)) = sk_c8,
inference(rw,[status(thm)],[c_0_23,c_0_41]) ).
cnf(c_0_52,negated_conjecture,
( sk_c6 = sk_c5
| inverse(sk_c8) = sk_c1 ),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( sk_c6 = sk_c7
| inverse(sk_c8) = sk_c1 ),
inference(rw,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
( sk_c1 = sk_c8
| inverse(sk_c5) = sk_c8 ),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
( sk_c1 = sk_c8
| sk_c6 = sk_c5 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_48]) ).
cnf(c_0_56,negated_conjecture,
( sk_c1 = sk_c8
| sk_c6 = sk_c7 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_53]),c_0_48]) ).
cnf(c_0_57,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c1,sk_c7) = sk_c8 ),
prove_this_12 ).
cnf(c_0_58,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c6
| multiply(sk_c1,sk_c7) = sk_c8 ),
prove_this_11 ).
cnf(c_0_59,negated_conjecture,
( sk_c5 = sk_c8
| sk_c1 = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_54]),c_0_50]) ).
cnf(c_0_60,negated_conjecture,
( sk_c5 = sk_c7
| sk_c1 = sk_c8 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( multiply(sk_c8,sk_c6) = sk_c7
| multiply(sk_c1,sk_c7) = sk_c8 ),
prove_this_10 ).
cnf(c_0_62,negated_conjecture,
( inverse(sk_c8) = sk_c5
| multiply(sk_c1,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_20,c_0_57]) ).
cnf(c_0_63,negated_conjecture,
( sk_c6 = sk_c5
| multiply(sk_c1,sk_c7) = sk_c8 ),
inference(rw,[status(thm)],[c_0_58,c_0_46]) ).
cnf(c_0_64,negated_conjecture,
( sk_c1 = sk_c8
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,negated_conjecture,
( sk_c6 = sk_c7
| multiply(sk_c1,sk_c7) = sk_c8 ),
inference(rw,[status(thm)],[c_0_61,c_0_48]) ).
cnf(c_0_66,negated_conjecture,
( sk_c5 = sk_c8
| multiply(sk_c1,sk_c7) = sk_c8 ),
inference(spm,[status(thm)],[c_0_62,c_0_50]) ).
cnf(c_0_67,negated_conjecture,
( sk_c7 = sk_c8
| sk_c6 = sk_c5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_48])]) ).
cnf(c_0_68,negated_conjecture,
( sk_c7 = sk_c8
| sk_c6 = sk_c7 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_64]),c_0_48])]) ).
cnf(c_0_69,negated_conjecture,
( inverse(X6) != sk_c8
| multiply(X6,sk_c8) != X5
| multiply(sk_c8,X5) != sk_c7
| multiply(X4,sk_c7) != sk_c8
| inverse(X3) != X4
| multiply(X3,X4) != sk_c8
| inverse(X2) != sk_c7
| multiply(X2,sk_c7) != sk_c8
| multiply(X1,sk_c7) != sk_c8
| inverse(X1) != sk_c8 ),
inference(fof_simplification,[status(thm)],[prove_this_25]) ).
cnf(c_0_70,negated_conjecture,
( sk_c7 = sk_c8
| sk_c5 = sk_c8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_64]),c_0_48])]) ).
cnf(c_0_71,negated_conjecture,
( sk_c5 = sk_c7
| sk_c7 = sk_c8 ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
( inverse(X6) != sk_c8
| multiply(X6,sk_c8) != X5
| multiply(sk_c8,X5) != sk_c7
| multiply(X4,sk_c7) != sk_c8
| inverse(X3) != X4
| multiply(X3,X4) != sk_c8
| inverse(X2) != sk_c7
| multiply(X2,sk_c7) != sk_c8
| multiply(X1,sk_c7) != sk_c8
| inverse(X1) != sk_c8 ),
c_0_69 ).
cnf(c_0_73,negated_conjecture,
sk_c7 = sk_c8,
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_74,negated_conjecture,
inverse(X1) != sk_c8,
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(er,[status(thm)],[inference(er,[status(thm)],[c_0_72])]),c_0_23]),c_0_73]),c_0_46]),c_0_73]),c_0_46]),c_0_73]),c_0_46]),c_0_46]),c_0_48]),c_0_73]),c_0_41]),c_0_73])])])])]),c_0_50])]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_34,c_0_74]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP230-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 : n008.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:08:09 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/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.16/0.46 % Version: 3.5.1
% 0.16/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.46 % Starting sh5l with 300s (1) cores
% 0.16/0.46 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3495959 completed with status 0
% 0.16/0.46 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.16/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.46 % No SInE strategy applied
% 0.16/0.46 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.16/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.16/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.16/0.46 % SubtermCWHack with pid 3495964 completed with status 0
% 0.16/0.46 % Result found by SubtermCWHack
% 0.16/0.46 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.46 % No SInE strategy applied
% 0.16/0.46 % Search class: FGHPS-FFMM21-SFFFFFNN
% 0.16/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.46 % Preprocessing time : 0.001 s
% 0.16/0.46
% 0.16/0.46 % Proof found!
% 0.16/0.46 % SZS status Unsatisfiable
% 0.16/0.46 % SZS output start CNFRefutation
% See solution above
% 0.16/0.46 % Parsed axioms : 28
% 0.16/0.46 % Removed by relevancy pruning/SinE : 0
% 0.16/0.46 % Initial clauses : 28
% 0.16/0.46 % Removed in clause preprocessing : 0
% 0.16/0.46 % Initial clauses in saturation : 28
% 0.16/0.46 % Processed clauses : 474
% 0.16/0.46 % ...of these trivial : 6
% 0.16/0.46 % ...subsumed : 235
% 0.16/0.46 % ...remaining for further processing : 233
% 0.16/0.46 % Other redundant clauses eliminated : 5
% 0.16/0.46 % Clauses deleted for lack of memory : 0
% 0.16/0.46 % Backward-subsumed : 0
% 0.16/0.46 % Backward-rewritten : 172
% 0.16/0.46 % Generated clauses : 1864
% 0.16/0.46 % ...of the previous two non-redundant : 1761
% 0.16/0.46 % ...aggressively subsumed : 0
% 0.16/0.46 % Contextual simplify-reflections : 0
% 0.16/0.46 % Paramodulations : 1845
% 0.16/0.46 % Factorizations : 1
% 0.16/0.46 % NegExts : 0
% 0.16/0.46 % Equation resolutions : 5
% 0.16/0.46 % Disequality decompositions : 0
% 0.16/0.46 % Total rewrite steps : 1222
% 0.16/0.46 % ...of those cached : 1062
% 0.16/0.46 % Propositional unsat checks : 0
% 0.16/0.46 % Propositional check models : 0
% 0.16/0.46 % Propositional check unsatisfiable : 0
% 0.16/0.46 % Propositional clauses : 0
% 0.16/0.46 % Propositional clauses after purity: 0
% 0.16/0.46 % Propositional unsat core size : 0
% 0.16/0.46 % Propositional preprocessing time : 0.000
% 0.16/0.46 % Propositional encoding time : 0.000
% 0.16/0.46 % Propositional solver time : 0.000
% 0.16/0.46 % Success case prop preproc time : 0.000
% 0.16/0.46 % Success case prop encoding time : 0.000
% 0.16/0.46 % Success case prop solver time : 0.000
% 0.16/0.46 % Current number of processed clauses : 43
% 0.16/0.46 % Positive orientable unit clauses : 14
% 0.16/0.46 % Positive unorientable unit clauses: 0
% 0.16/0.46 % Negative unit clauses : 1
% 0.16/0.46 % Non-unit-clauses : 28
% 0.16/0.46 % Current number of unprocessed clauses: 1195
% 0.16/0.46 % ...number of literals in the above : 2612
% 0.16/0.46 % Current number of archived formulas : 0
% 0.16/0.46 % Current number of archived clauses : 188
% 0.16/0.46 % Clause-clause subsumption calls (NU) : 1085
% 0.16/0.46 % Rec. Clause-clause subsumption calls : 1085
% 0.16/0.46 % Non-unit clause-clause subsumptions : 235
% 0.16/0.46 % Unit Clause-clause subsumption calls : 116
% 0.16/0.46 % Rewrite failures with RHS unbound : 0
% 0.16/0.46 % BW rewrite match attempts : 21
% 0.16/0.46 % BW rewrite match successes : 12
% 0.16/0.46 % Condensation attempts : 0
% 0.16/0.46 % Condensation successes : 0
% 0.16/0.46 % Termbank termtop insertions : 15255
% 0.16/0.46 % Search garbage collected termcells : 29
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.019 s
% 0.16/0.46 % System time : 0.006 s
% 0.16/0.46 % Total time : 0.025 s
% 0.16/0.46 % Maximum resident set size: 3648 pages
% 0.16/0.46
% 0.16/0.46 % -------------------------------------------------
% 0.16/0.46 % User time : 0.120 s
% 0.16/0.46 % System time : 0.019 s
% 0.16/0.46 % Total time : 0.139 s
% 0.16/0.46 % Maximum resident set size: 4864 pages
% 0.16/0.46 % E exiting
%------------------------------------------------------------------------------