%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL896+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 01:17:41 PM UTC 2026
% Result : Theorem 39.10s 6.27s
% Output : CNFRefutation 39.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 75 ( 46 unt; 0 def)
% Number of atoms : 111 ( 41 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 68 ( 32 ~; 29 |; 2 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 157 ( 11 sgn 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_03,axiom,
! [X1] : '+'(X1,'0') = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_03) ).
fof(sos_02,axiom,
! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
fof(sos_09,axiom,
! [X12,X13,X14] :
( '>='(X12,X13)
=> '>='('+'(X12,X14),'+'(X13,X14)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_09) ).
fof(sos_08,axiom,
! [X1] : '>='(X1,'0'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).
fof(sos_06,axiom,
! [X7,X8] :
( ( '>='(X8,X7)
& '>='(X7,X8) )
=> X7 = X8 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_06) ).
fof(sos_07,axiom,
! [X9,X10,X11] :
( '>='('+'(X9,X10),X11)
<=> '>='(X10,'==>'(X9,X11)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
fof(sos_01,axiom,
! [X1,X2,X3] : '+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_01) ).
fof(sos_04,axiom,
! [X1] : '>='(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_04) ).
fof(sos_12,axiom,
! [X1,X2,X3] : '+'('+'(X1,'==>'(X1,X2)),'==>'('+'(X1,'==>'(X1,X2)),X3)) = '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_12) ).
fof(sos_11,axiom,
! [X18,X19,X20] :
( '>='(X18,X19)
=> '>='('==>'(X20,X18),'==>'(X20,X19)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_11) ).
fof(sos_10,axiom,
! [X15,X16,X17] :
( '>='(X15,X16)
=> '>='('==>'(X16,X17),'==>'(X15,X17)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_10) ).
fof(goals_13,conjecture,
! [X21,X22] : '+'(X21,'==>'(X21,X22)) = '+'(X22,'==>'(X22,X21)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_13) ).
fof(c_0_12,plain,
! [X28] : '+'(X28,'0') = X28,
inference(variable_rename,[status(thm)],[sos_03]) ).
fof(c_0_13,plain,
! [X26,X27] : '+'(X26,X27) = '+'(X27,X26),
inference(variable_rename,[status(thm)],[sos_02]) ).
fof(c_0_14,plain,
! [X39,X40,X41] :
( '>='('+'(X39,X41),'+'(X40,X41))
| ~ '>='(X39,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])])]) ).
cnf(c_0_15,plain,
'+'(X1,'0') = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
'+'(X1,X2) = '+'(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X38] : '>='(X38,'0'),
inference(variable_rename,[status(thm)],[sos_08]) ).
fof(c_0_18,plain,
! [X33,X34] :
( X33 = X34
| ~ '>='(X34,X33)
| ~ '>='(X33,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])])]) ).
fof(c_0_19,plain,
! [X35,X36,X37] :
( ( '>='('+'(X35,X36),X37)
| ~ '>='(X36,'==>'(X35,X37)) )
& ( '>='(X36,'==>'(X35,X37))
| ~ '>='('+'(X35,X36),X37) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])]) ).
cnf(c_0_20,plain,
( ~ '>='(X1,X2)
| '>='('+'(X1,X3),'+'(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
'+'('0',X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
'>='(X1,'0'),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,plain,
! [X23,X24,X25] : '+'('+'(X23,X24),X25) = '+'(X23,'+'(X24,X25)),
inference(variable_rename,[status(thm)],[sos_01]) ).
fof(c_0_24,plain,
! [X29] : '>='(X29,X29),
inference(variable_rename,[status(thm)],[sos_04]) ).
cnf(c_0_25,plain,
( ~ '>='(X2,X1)
| ~ '>='(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( ~ '>='('+'(X1,X2),X3)
| '>='(X2,'==>'(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
'>='('+'(X1,X2),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_28,plain,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( ~ '>='(X1,'==>'(X2,X3))
| '>='('+'(X2,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
'>='(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
( ~ '>='(X3,X1)
| ~ '>='('+'(X1,X2),'+'(X3,X2))
| '+'(X1,X2) = '+'(X3,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_32,plain,
( ~ '>='('+'(X1,X2),X3)
| '>='(X1,'==>'(X2,X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_16]) ).
cnf(c_0_33,plain,
'>='('+'(X1,'+'(X2,X3)),X3),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
'>='('+'(X1,'==>'(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( ~ '>='('0',X1)
| '+'(X1,X2) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_21]),c_0_27])]) ).
cnf(c_0_36,plain,
( ~ '>='(X1,X2)
| '>='('0','==>'(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_15]) ).
fof(c_0_37,plain,
! [X48,X49,X50] : '+'('+'(X48,'==>'(X48,X49)),'==>'('+'(X48,'==>'(X48,X49)),X50)) = '+'(X48,'==>'(X48,'+'(X49,'==>'(X49,X50)))),
inference(variable_rename,[status(thm)],[sos_12]) ).
cnf(c_0_38,plain,
( ~ '>='('0',X1)
| '0' = X1 ),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_39,plain,
'>='(X1,'==>'('+'(X2,X3),X3)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
( ~ '>='(X2,'+'(X1,'==>'(X1,X2)))
| '+'(X1,'==>'(X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_25,c_0_34]) ).
cnf(c_0_41,plain,
( ~ '>='(X1,X2)
| '+'('==>'(X1,X2),X3) = X3 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
'>='(X1,'==>'(X2,X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_43,plain,
'>='('==>'('0',X1),X1),
inference(spm,[status(thm)],[c_0_34,c_0_21]) ).
cnf(c_0_44,plain,
'>='(X1,'==>'(X2,'+'(X2,X1))),
inference(spm,[status(thm)],[c_0_26,c_0_30]) ).
fof(c_0_45,plain,
! [X45,X46,X47] :
( '>='('==>'(X47,X45),'==>'(X47,X46))
| ~ '>='(X45,X46) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_11])])]) ).
cnf(c_0_46,plain,
'+'('+'(X1,'==>'(X1,X2)),'==>'('+'(X1,'==>'(X1,X2)),X3)) = '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_47,plain,
'==>'('+'(X1,X2),X2) = '0',
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
fof(c_0_48,plain,
! [X42,X43,X44] :
( '>='('==>'(X43,X44),'==>'(X42,X44))
| ~ '>='(X42,X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])]) ).
cnf(c_0_49,plain,
'>='('+'(X1,X2),X1),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_50,plain,
'>='(X1,'==>'('==>'(X1,X2),X2)),
inference(spm,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_51,plain,
( ~ '>='(X1,X2)
| '==>'('==>'(X1,X2),X3) = X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_52,plain,
'==>'('0',X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_43]),c_0_42])]) ).
cnf(c_0_53,plain,
( ~ '>='('==>'(X1,'+'(X1,X2)),X2)
| '==>'(X1,'+'(X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_25,c_0_44]) ).
cnf(c_0_54,plain,
( ~ '>='(X1,X2)
| '>='('==>'(X3,X1),'==>'(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_55,plain,
'+'(X1,'+'('==>'(X1,X2),'==>'('+'(X1,'==>'(X1,X2)),X3))) = '+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X3)))),
inference(rw,[status(thm)],[c_0_46,c_0_28]) ).
cnf(c_0_56,plain,
'==>'('+'(X1,X2),X1) = '0',
inference(spm,[status(thm)],[c_0_47,c_0_16]) ).
cnf(c_0_57,plain,
( ~ '>='(X1,X2)
| '>='('==>'(X2,X3),'==>'(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_58,plain,
'>='(X1,'==>'(X2,X2)),
inference(spm,[status(thm)],[c_0_26,c_0_49]) ).
cnf(c_0_59,plain,
( ~ '>='('==>'('==>'(X1,X2),X2),X1)
| '==>'('==>'(X1,X2),X2) = X1 ),
inference(spm,[status(thm)],[c_0_25,c_0_50]) ).
cnf(c_0_60,plain,
( ~ '>='('0',X1)
| '==>'(X1,X2) = X2 ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_61,plain,
'==>'(X1,'+'(X1,'==>'(X1,X2))) = '==>'(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_34])]) ).
cnf(c_0_62,plain,
'+'(X1,'==>'(X1,'+'(X2,'==>'(X2,X1)))) = '+'(X1,'==>'(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_15]) ).
cnf(c_0_63,plain,
'>='('==>'(X1,X2),'==>'('+'(X3,'==>'(X3,X1)),X2)),
inference(spm,[status(thm)],[c_0_57,c_0_34]) ).
cnf(c_0_64,plain,
'==>'(X1,X1) = '0',
inference(spm,[status(thm)],[c_0_38,c_0_58]) ).
fof(c_0_65,negated_conjecture,
~ ! [X21,X22] : '+'(X21,'==>'(X21,X22)) = '+'(X22,'==>'(X22,X21)),
inference(assume_negation,[status(cth)],[goals_13]) ).
cnf(c_0_66,plain,
( ~ '>='(X1,X2)
| ~ '>='('0','==>'(X2,X1))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_67,plain,
'==>'(X1,'+'(X2,'==>'(X2,X1))) = '==>'(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_61]) ).
cnf(c_0_68,plain,
'>='('0','==>'('+'(X1,'==>'(X1,X2)),X2)),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
fof(c_0_69,negated_conjecture,
'+'(esk1_0,'==>'(esk1_0,esk2_0)) != '+'(esk2_0,'==>'(esk2_0,esk1_0)),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_65])])])]) ).
cnf(c_0_70,plain,
( ~ '>='('0','==>'(X2,X1))
| '+'(X1,'==>'(X1,X2)) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_34])]) ).
cnf(c_0_71,plain,
'==>'('+'(X1,'==>'(X1,X2)),X2) = '0',
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_68]),c_0_22])]) ).
cnf(c_0_72,negated_conjecture,
'+'(esk1_0,'==>'(esk1_0,esk2_0)) != '+'(esk2_0,'==>'(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_73,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X2,'==>'(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_67]),c_0_30])]) ).
cnf(c_0_74,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL896+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n008.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 01:10:53 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.51 Running first-order theorem proving
% 0.26/0.51 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
% 39.10/6.27 % Version: 3.5.1
% 39.10/6.27 % Preprocessing class: FSMSSMSSSSSNFFN.
% 39.10/6.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.10/6.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 39.10/6.27 % Starting new_bool_3 with 300s (1) cores
% 39.10/6.27 % Starting new_bool_1 with 300s (1) cores
% 39.10/6.27 % Starting sh5l with 300s (1) cores
% 39.10/6.27 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4024071 completed with status 0
% 39.10/6.27 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 39.10/6.27 % Preprocessing class: FSMSSMSSSSSNFFN.
% 39.10/6.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.10/6.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 39.10/6.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 39.10/6.27 % No SInE strategy applied
% 39.10/6.27 % Search class: FHUSM-FFSF22-MFFFFFNN
% 39.10/6.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 39.10/6.27 % Starting SubtermCWHack with 136s (1) cores
% 39.10/6.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 39.10/6.27 % Starting U----_212g_01_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 39.10/6.27 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 39.10/6.27 % Starting new_bool_3 with 136s (1) cores
% 39.10/6.27 % U----_212g_01_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 4024080 completed with status 0
% 39.10/6.27 % Result found by U----_212g_01_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 39.10/6.27 % Preprocessing class: FSMSSMSSSSSNFFN.
% 39.10/6.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 39.10/6.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 39.10/6.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 39.10/6.27 % No SInE strategy applied
% 39.10/6.27 % Search class: FHUSM-FFSF22-MFFFFFNN
% 39.10/6.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 39.10/6.27 % Starting SubtermCWHack with 136s (1) cores
% 39.10/6.27 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 39.10/6.27 % Starting U----_212g_01_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 39.10/6.27 % Preprocessing time : 0.002 s
% 39.10/6.27 % Presaturation interreduction done
% 39.10/6.27
% 39.10/6.27 % Proof found!
% 39.10/6.27 % SZS status Theorem
% 39.10/6.27 % SZS output start CNFRefutation
% See solution above
% 39.10/6.28 % Parsed axioms : 13
% 39.10/6.28 % Removed by relevancy pruning/SinE : 0
% 39.10/6.28 % Initial clauses : 14
% 39.10/6.28 % Removed in clause preprocessing : 0
% 39.10/6.28 % Initial clauses in saturation : 14
% 39.10/6.28 % Processed clauses : 13885
% 39.10/6.28 % ...of these trivial : 906
% 39.10/6.28 % ...subsumed : 11965
% 39.10/6.28 % ...remaining for further processing : 1014
% 39.10/6.28 % Other redundant clauses eliminated : 0
% 39.10/6.28 % Clauses deleted for lack of memory : 0
% 39.10/6.28 % Backward-subsumed : 29
% 39.10/6.28 % Backward-rewritten : 18
% 39.10/6.28 % Generated clauses : 251182
% 39.10/6.28 % ...of the previous two non-redundant : 184770
% 39.10/6.28 % ...aggressively subsumed : 0
% 39.10/6.28 % Contextual simplify-reflections : 4
% 39.10/6.28 % Paramodulations : 251182
% 39.10/6.28 % Factorizations : 0
% 39.10/6.28 % NegExts : 0
% 39.10/6.28 % Equation resolutions : 0
% 39.10/6.28 % Disequality decompositions : 0
% 39.10/6.28 % Total rewrite steps : 254826
% 39.10/6.28 % ...of those cached : 231067
% 39.10/6.28 % Propositional unsat checks : 0
% 39.10/6.28 % Propositional check models : 0
% 39.10/6.28 % Propositional check unsatisfiable : 0
% 39.10/6.28 % Propositional clauses : 0
% 39.10/6.28 % Propositional clauses after purity: 0
% 39.10/6.28 % Propositional unsat core size : 0
% 39.10/6.28 % Propositional preprocessing time : 0.000
% 39.10/6.28 % Propositional encoding time : 0.000
% 39.10/6.28 % Propositional solver time : 0.000
% 39.10/6.28 % Success case prop preproc time : 0.000
% 39.10/6.28 % Success case prop encoding time : 0.000
% 39.10/6.28 % Success case prop solver time : 0.000
% 39.10/6.28 % Current number of processed clauses : 953
% 39.10/6.28 % Positive orientable unit clauses : 306
% 39.10/6.28 % Positive unorientable unit clauses: 5
% 39.10/6.28 % Negative unit clauses : 4
% 39.10/6.28 % Non-unit-clauses : 638
% 39.10/6.28 % Current number of unprocessed clauses: 170738
% 39.10/6.28 % ...number of literals in the above : 386584
% 39.10/6.28 % Current number of archived formulas : 0
% 39.10/6.28 % Current number of archived clauses : 61
% 39.10/6.28 % Clause-clause subsumption calls (NU) : 130598
% 39.10/6.28 % Rec. Clause-clause subsumption calls : 125323
% 39.10/6.28 % Non-unit clause-clause subsumptions : 11528
% 39.10/6.28 % Unit Clause-clause subsumption calls : 1834
% 39.10/6.28 % Rewrite failures with RHS unbound : 0
% 39.10/6.28 % BW rewrite match attempts : 4281
% 39.10/6.28 % BW rewrite match successes : 165
% 39.10/6.28 % Condensation attempts : 0
% 39.10/6.28 % Condensation successes : 0
% 39.10/6.28 % Termbank termtop insertions : 3092175
% 39.10/6.28 % Search garbage collected termcells : 118
% 39.10/6.28
% 39.10/6.28 % -------------------------------------------------
% 39.10/6.28 % User time : 5.344 s
% 39.10/6.28 % System time : 0.209 s
% 39.10/6.28 % Total time : 5.553 s
% 39.10/6.28 % Maximum resident set size: 3648 pages
% 39.10/6.28
% 39.10/6.28 % -------------------------------------------------
% 39.10/6.28 % User time : 26.489 s
% 39.10/6.28 % System time : 1.036 s
% 39.10/6.28 % Total time : 27.525 s
% 39.10/6.28 % Maximum resident set size: 4864 pages
% 39.10/6.28 % E exiting
%------------------------------------------------------------------------------