%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP780+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:41:14 PM UTC 2026
% Result : Theorem 1.20s 0.69s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 75 ( 71 unt; 0 def)
% Number of atoms : 81 ( 63 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 19 ( 13 ~; 4 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-3 aty)
% Number of variables : 100 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos05,axiom,
! [X3,X4,X1,X2] : product(product(X2,X1),product(X4,X3)) = product(product(X2,X4),product(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos05) ).
fof(sos06,axiom,
! [X2] : product(X2,X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos06) ).
fof(sos07,axiom,
! [X1,X2] : product(product(product(X2,X1),X1),product(X1,product(X1,X2))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos07) ).
fof(sos08,axiom,
! [X5,X6,X7] :
( d(X5,X6,X7)
<=> product(X5,X6) = product(X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos08) ).
fof(sos03,axiom,
! [X1,X2] : quotient(product(X2,X1),X1) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos03) ).
fof(sos01,axiom,
! [X1,X2] : difference(X2,product(X2,X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos01) ).
fof(sos11,axiom,
d(b1,b2,b3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos11) ).
fof(sos12,axiom,
d(c1,c2,c3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos12) ).
fof(sos04,axiom,
! [X1,X2] : product(quotient(X2,X1),X1) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos04) ).
fof(goals,conjecture,
d(bigC(a1,b3,c2),bigC(a2,b1,c3),bigC(a3,b2,c1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos09,axiom,
! [X4,X1,X2] : bigC(X2,X1,X4) = product(product(X2,X1),product(X4,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos09) ).
fof(sos10,axiom,
d(a1,a2,a3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos10) ).
fof(c_0_12,plain,
! [X16,X17,X18,X19] : product(product(X19,X18),product(X17,X16)) = product(product(X19,X17),product(X18,X16)),
inference(variable_rename,[status(thm)],[sos05]) ).
fof(c_0_13,plain,
! [X20] : product(X20,X20) = X20,
inference(variable_rename,[status(thm)],[sos06]) ).
cnf(c_0_14,plain,
product(product(X1,X2),product(X3,X4)) = product(product(X1,X3),product(X2,X4)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
product(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X21,X22] : product(product(product(X22,X21),X21),product(X21,product(X21,X22))) = X21,
inference(variable_rename,[status(thm)],[sos07]) ).
fof(c_0_17,plain,
! [X23,X24,X25] :
( ( d(X23,X24,X25)
| product(X23,X24) != product(X24,X25) )
& ( product(X23,X24) = product(X24,X25)
| ~ d(X23,X24,X25) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos08])])]) ).
fof(c_0_18,plain,
! [X12,X13] : quotient(product(X13,X12),X12) = X13,
inference(variable_rename,[status(thm)],[sos03]) ).
cnf(c_0_19,plain,
product(product(X1,X2),product(X3,X2)) = product(product(X1,X3),X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_20,plain,
! [X8,X9] : difference(X9,product(X9,X8)) = X8,
inference(variable_rename,[status(thm)],[sos01]) ).
cnf(c_0_21,plain,
product(product(product(X1,X2),X2),product(X2,product(X2,X1))) = X2,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
product(product(product(X1,X2),X3),product(product(X4,X5),X6)) = product(product(product(X1,X4),product(X2,X5)),product(X3,X6)),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_23,plain,
( ~ d(X1,X2,X3)
| product(X1,X2) = product(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
d(b1,b2,b3),
inference(split_conjunct,[status(thm)],[sos11]) ).
cnf(c_0_25,plain,
d(c1,c2,c3),
inference(split_conjunct,[status(thm)],[sos12]) ).
cnf(c_0_26,plain,
quotient(product(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
product(product(X1,X2),X1) = product(X1,product(X2,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
fof(c_0_28,plain,
! [X14,X15] : product(quotient(X15,X14),X14) = X15,
inference(variable_rename,[status(thm)],[sos04]) ).
cnf(c_0_29,plain,
difference(X1,product(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
product(product(product(product(X1,X2),X3),product(X3,X4)),product(product(product(X3,X4),X4),product(product(X3,X4),product(X1,X2)))) = product(X3,X4),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_14]),c_0_22]),c_0_14]) ).
cnf(c_0_31,plain,
product(product(X1,X2),product(X1,X3)) = product(X1,product(X2,X3)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_32,plain,
product(b2,b3) = product(b1,b2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,plain,
product(c2,c3) = product(c1,c2),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
fof(c_0_34,negated_conjecture,
~ d(bigC(a1,b3,c2),bigC(a2,b1,c3),bigC(a3,b2,c1)),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_35,plain,
quotient(product(X1,product(X2,X1)),X1) = product(X1,X2),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,plain,
product(quotient(X1,X2),X2) = X1,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,plain,
difference(product(product(X1,X2),X2),X2) = product(X2,product(X2,X1)),
inference(spm,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_38,plain,
product(product(product(product(X1,X2),X3),product(X3,X4)),product(product(X3,X4),product(X4,product(X1,X2)))) = product(X3,X4),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
product(product(product(b3,b2),b2),product(b2,product(b1,b2))) = b2,
inference(spm,[status(thm)],[c_0_21,c_0_32]) ).
cnf(c_0_40,plain,
product(product(product(c3,c2),c2),product(c2,product(c1,c2))) = c2,
inference(spm,[status(thm)],[c_0_21,c_0_33]) ).
fof(c_0_41,negated_conjecture,
~ d(bigC(a1,b3,c2),bigC(a2,b1,c3),bigC(a3,b2,c1)),
inference(fof_simplification,[status(thm)],[c_0_34]) ).
cnf(c_0_42,plain,
quotient(product(X1,X2),X1) = product(X1,quotient(X2,X1)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
product(X1,product(X1,quotient(X2,X1))) = difference(product(X2,X1),X1),
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_44,plain,
product(product(product(product(b1,b3),product(b3,b2)),b2),b2) = product(product(b3,b2),b2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_19]),c_0_19]) ).
cnf(c_0_45,plain,
product(product(product(product(c1,c3),product(c3,c2)),c2),c2) = product(product(c3,c2),c2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_40]),c_0_19]),c_0_19]) ).
fof(c_0_46,negated_conjecture,
~ d(bigC(a1,b3,c2),bigC(a2,b1,c3),bigC(a3,b2,c1)),
inference(fof_nnf,[status(thm)],[c_0_41]) ).
fof(c_0_47,plain,
! [X26,X27,X28] : bigC(X28,X27,X26) = product(product(X28,X27),product(X26,X28)),
inference(variable_rename,[status(thm)],[sos09]) ).
cnf(c_0_48,plain,
quotient(difference(product(X1,X2),X2),X2) = difference(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_42]),c_0_43]),c_0_36]) ).
cnf(c_0_49,plain,
product(product(product(b1,b3),product(b3,b2)),b2) = product(b3,b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_44]),c_0_26]) ).
cnf(c_0_50,plain,
product(product(product(c1,c3),product(c3,c2)),c2) = product(c3,c2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_45]),c_0_26]) ).
cnf(c_0_51,negated_conjecture,
~ d(bigC(a1,b3,c2),bigC(a2,b1,c3),bigC(a3,b2,c1)),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_52,plain,
bigC(X1,X2,X3) = product(product(X1,X2),product(X3,X1)),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_53,plain,
difference(product(X1,X2),X2) = product(difference(X1,X2),X2),
inference(spm,[status(thm)],[c_0_36,c_0_48]) ).
cnf(c_0_54,plain,
product(product(b1,b3),product(b3,b2)) = b3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_49]),c_0_26]) ).
cnf(c_0_55,plain,
product(product(c1,c3),product(c3,c2)) = c3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_50]),c_0_26]) ).
cnf(c_0_56,negated_conjecture,
~ d(product(product(a1,b3),product(c2,a1)),product(product(a2,b1),product(c3,a2)),product(product(a3,b2),product(c1,a3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_52]),c_0_52]) ).
cnf(c_0_57,plain,
( product(X1,X2) != product(X2,X3)
| d(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_58,plain,
d(a1,a2,a3),
inference(split_conjunct,[status(thm)],[sos10]) ).
cnf(c_0_59,plain,
product(product(difference(X1,X2),X2),X2) = product(X2,product(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_53]),c_0_53]) ).
cnf(c_0_60,plain,
product(difference(b1,b3),b3) = product(b3,b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_54]),c_0_53]) ).
cnf(c_0_61,plain,
product(difference(c1,c3),c3) = product(c3,c2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_55]),c_0_53]) ).
cnf(c_0_62,negated_conjecture,
product(product(product(a2,b1),product(c3,a2)),product(product(a3,b2),product(c1,a3))) != product(product(product(a1,b3),product(c2,a1)),product(product(a2,b1),product(c3,a2))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_63,plain,
product(a2,a3) = product(a1,a2),
inference(spm,[status(thm)],[c_0_23,c_0_58]) ).
cnf(c_0_64,plain,
product(b3,product(b3,b1)) = product(b3,product(b1,b2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_27]),c_0_32]) ).
cnf(c_0_65,plain,
product(c3,product(c3,c1)) = product(c3,product(c1,c2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_61]),c_0_27]),c_0_33]) ).
cnf(c_0_66,negated_conjecture,
product(product(product(a1,a2),product(b3,b1)),product(product(c2,a1),product(c3,a2))) != product(product(product(a1,a2),product(b1,b2)),product(product(c3,a2),product(c1,a3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_14]),c_0_14]),c_0_63]),c_0_14]),c_0_14]) ).
cnf(c_0_67,plain,
product(b3,b1) = product(b1,b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_64]),c_0_29]) ).
cnf(c_0_68,plain,
product(product(X1,a2),product(X2,a3)) = product(product(X1,X2),product(a1,a2)),
inference(spm,[status(thm)],[c_0_14,c_0_63]) ).
cnf(c_0_69,plain,
product(c3,c1) = product(c1,c2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_65]),c_0_29]) ).
cnf(c_0_70,negated_conjecture,
product(product(product(a1,a2),product(b1,b2)),product(product(c3,a2),product(c1,a3))) != product(product(product(a1,a2),product(b1,b2)),product(product(c2,a1),product(c3,a2))),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,plain,
product(product(c3,a2),product(c1,a3)) = product(product(c1,a1),product(c2,a2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_14]) ).
cnf(c_0_72,negated_conjecture,
product(product(product(a1,a2),product(b1,b2)),product(product(c2,a1),product(c3,a2))) != product(product(product(a1,a2),product(b1,b2)),product(product(c1,a1),product(c2,a2))),
inference(rw,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_73,plain,
product(product(c2,X1),product(c3,X2)) = product(product(c1,c2),product(X1,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_33]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP780+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n010.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Sun Sep 20 20:40:10 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 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
% 1.20/0.69 % Version: 3.5.1
% 1.20/0.69 % Preprocessing class: FSMSSMSMSSSNFFN.
% 1.20/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.20/0.69 % Starting new_bool_3 with 300s (1) cores
% 1.20/0.69 % Starting new_bool_1 with 300s (1) cores
% 1.20/0.69 % Starting sh5l with 300s (1) cores
% 1.20/0.69 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3481627 completed with status 0
% 1.20/0.69 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.20/0.69 % Preprocessing class: FSMSSMSMSSSNFFN.
% 1.20/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.20/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.20/0.69 % No SInE strategy applied
% 1.20/0.69 % Search class: FHUSM-FFSS22-MFFFFFNN
% 1.20/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.20/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.20/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.20/0.69 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.20/0.69 % Starting new_bool_3 with 136s (1) cores
% 1.20/0.69 % Starting new_bool_1 with 136s (1) cores
% 1.20/0.69 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 3481634 completed with status 0
% 1.20/0.69 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 1.20/0.69 % Preprocessing class: FSMSSMSMSSSNFFN.
% 1.20/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.20/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.20/0.69 % No SInE strategy applied
% 1.20/0.69 % Search class: FHUSM-FFSS22-MFFFFFNN
% 1.20/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.20/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.20/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.20/0.69 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.20/0.69 % Preprocessing time : 0.001 s
% 1.20/0.69 % Presaturation interreduction done
% 1.20/0.69
% 1.20/0.69 % Proof found!
% 1.20/0.69 % SZS status Theorem
% 1.20/0.69 % SZS output start CNFRefutation
% See solution above
% 1.20/0.69 % Parsed axioms : 13
% 1.20/0.69 % Removed by relevancy pruning/SinE : 0
% 1.20/0.69 % Initial clauses : 14
% 1.20/0.69 % Removed in clause preprocessing : 1
% 1.20/0.69 % Initial clauses in saturation : 13
% 1.20/0.69 % Processed clauses : 611
% 1.20/0.69 % ...of these trivial : 158
% 1.20/0.69 % ...subsumed : 7
% 1.20/0.69 % ...remaining for further processing : 446
% 1.20/0.69 % Other redundant clauses eliminated : 0
% 1.20/0.69 % Clauses deleted for lack of memory : 0
% 1.20/0.69 % Backward-subsumed : 0
% 1.20/0.69 % Backward-rewritten : 99
% 1.20/0.69 % Generated clauses : 18950
% 1.20/0.69 % ...of the previous two non-redundant : 17480
% 1.20/0.69 % ...aggressively subsumed : 0
% 1.20/0.69 % Contextual simplify-reflections : 0
% 1.20/0.69 % Paramodulations : 18950
% 1.20/0.69 % Factorizations : 0
% 1.20/0.69 % NegExts : 0
% 1.20/0.69 % Equation resolutions : 0
% 1.20/0.69 % Disequality decompositions : 0
% 1.20/0.69 % Total rewrite steps : 11959
% 1.20/0.69 % ...of those cached : 8937
% 1.20/0.69 % Propositional unsat checks : 0
% 1.20/0.69 % Propositional check models : 0
% 1.20/0.69 % Propositional check unsatisfiable : 0
% 1.20/0.69 % Propositional clauses : 0
% 1.20/0.69 % Propositional clauses after purity: 0
% 1.20/0.69 % Propositional unsat core size : 0
% 1.20/0.69 % Propositional preprocessing time : 0.000
% 1.20/0.69 % Propositional encoding time : 0.000
% 1.20/0.69 % Propositional solver time : 0.000
% 1.20/0.69 % Success case prop preproc time : 0.000
% 1.20/0.69 % Success case prop encoding time : 0.000
% 1.20/0.69 % Success case prop solver time : 0.000
% 1.20/0.69 % Current number of processed clauses : 334
% 1.20/0.69 % Positive orientable unit clauses : 325
% 1.20/0.69 % Positive unorientable unit clauses: 6
% 1.20/0.69 % Negative unit clauses : 1
% 1.20/0.69 % Non-unit-clauses : 2
% 1.20/0.69 % Current number of unprocessed clauses: 16806
% 1.20/0.69 % ...number of literals in the above : 16806
% 1.20/0.69 % Current number of archived formulas : 0
% 1.20/0.69 % Current number of archived clauses : 113
% 1.20/0.69 % Clause-clause subsumption calls (NU) : 0
% 1.20/0.69 % Rec. Clause-clause subsumption calls : 0
% 1.20/0.69 % Non-unit clause-clause subsumptions : 0
% 1.20/0.69 % Unit Clause-clause subsumption calls : 81
% 1.20/0.69 % Rewrite failures with RHS unbound : 0
% 1.20/0.69 % BW rewrite match attempts : 410
% 1.20/0.69 % BW rewrite match successes : 131
% 1.20/0.69 % Condensation attempts : 0
% 1.20/0.69 % Condensation successes : 0
% 1.20/0.69 % Termbank termtop insertions : 402473
% 1.20/0.69 % Search garbage collected termcells : 23
% 1.20/0.69
% 1.20/0.69 % -------------------------------------------------
% 1.20/0.69 % User time : 0.158 s
% 1.20/0.69 % System time : 0.013 s
% 1.20/0.69 % Total time : 0.171 s
% 1.20/0.69 % Maximum resident set size: 3640 pages
% 1.20/0.69
% 1.20/0.69 % -------------------------------------------------
% 1.20/0.69 % User time : 0.785 s
% 1.20/0.69 % System time : 0.070 s
% 1.20/0.69 % Total time : 0.855 s
% 1.20/0.69 % Maximum resident set size: 4864 pages
% 1.20/0.69 % E exiting
%------------------------------------------------------------------------------