%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL901+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:24:07 PM UTC 2026
% Result : Theorem 1.91s 0.82s
% Output : CNFRefutation 1.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 12
% Syntax : Number of formulae : 82 ( 56 unt; 0 def)
% Number of atoms : 116 ( 34 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 65 ( 31 ~; 27 |; 3 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 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 : 170 ( 27 sgn 46 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_03,axiom,
! [X1] : '+'(X1,'0') = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
fof(sos_02,axiom,
! [X1,X2] : '+'(X1,X2) = '+'(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(sos_09,axiom,
! [X12,X13,X14] :
( '>='(X12,X13)
=> '>='('+'(X12,X14),'+'(X13,X14)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).
fof(sos_08,axiom,
! [X1] : '>='(X1,'0'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(sos_01,axiom,
! [X1,X2,X3] : '+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
fof(sos_05,axiom,
! [X4,X5,X6] :
( ( '>='(X5,X6)
& '>='(X4,X5) )
=> '>='(X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_05) ).
fof(sos_07,axiom,
! [X9,X10,X11] :
( '>='('+'(X9,X10),X11)
<=> '>='(X10,'==>'(X9,X11)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(sos_06,axiom,
! [X7,X8] :
( ( '>='(X8,X7)
& '>='(X7,X8) )
=> X7 = X8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_06) ).
fof(sos_04,axiom,
! [X1] : '>='(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(sos_13,axiom,
! [X1,X2] : '==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_13) ).
fof(sos_14,axiom,
! [X1] : '+'(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_14) ).
fof(goals_15,conjecture,
! [X21] : '==>'('==>'('==>'(X21,'1'),X21),X21) = '0',
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_15) ).
fof(c_0_12,plain,
! [X27] : '+'(X27,'0') = X27,
inference(variable_rename,[status(thm)],[sos_03]) ).
fof(c_0_13,plain,
! [X25,X26] : '+'(X25,X26) = '+'(X26,X25),
inference(variable_rename,[status(thm)],[sos_02]) ).
fof(c_0_14,plain,
! [X38,X39,X40] :
( '>='('+'(X38,X40),'+'(X39,X40))
| ~ '>='(X38,X39) ),
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,
! [X37] : '>='(X37,'0'),
inference(variable_rename,[status(thm)],[sos_08]) ).
cnf(c_0_18,plain,
( ~ '>='(X1,X2)
| '>='('+'(X1,X3),'+'(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
'+'('0',X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
'>='(X1,'0'),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X22,X23,X24] : '+'('+'(X22,X23),X24) = '+'(X22,'+'(X23,X24)),
inference(variable_rename,[status(thm)],[sos_01]) ).
fof(c_0_22,plain,
! [X29,X30,X31] :
( '>='(X29,X31)
| ~ '>='(X30,X31)
| ~ '>='(X29,X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])])]) ).
cnf(c_0_23,plain,
'>='('+'(X1,X2),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
fof(c_0_24,plain,
! [X34,X35,X36] :
( ( '>='('+'(X34,X35),X36)
| ~ '>='(X35,'==>'(X34,X36)) )
& ( '>='(X35,'==>'(X34,X36))
| ~ '>='('+'(X34,X35),X36) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])]) ).
cnf(c_0_25,plain,
'+'('+'(X1,X2),X3) = '+'(X1,'+'(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( ~ '>='(X2,X3)
| ~ '>='(X1,X2)
| '>='(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
'>='('+'(X1,X2),X1),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_28,plain,
( ~ '>='('+'(X1,X2),X3)
| '>='(X2,'==>'(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
'>='('+'(X1,'+'(X2,X3)),X3),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
fof(c_0_30,plain,
! [X32,X33] :
( X32 = X33
| ~ '>='(X33,X32)
| ~ '>='(X32,X33) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_06])])]) ).
cnf(c_0_31,plain,
( ~ '>='(X1,'+'(X2,X3))
| '>='(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( ~ '>='(X1,'==>'(X2,X3))
| '>='('+'(X2,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_33,plain,
! [X28] : '>='(X28,X28),
inference(variable_rename,[status(thm)],[sos_04]) ).
cnf(c_0_34,plain,
'>='('+'(X1,X2),'==>'(X3,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_35,plain,
! [X48,X49] : '==>'('==>'(X48,X49),X49) = '==>'('==>'(X49,X48),X48),
inference(variable_rename,[status(thm)],[sos_13]) ).
cnf(c_0_36,plain,
( ~ '>='(X2,X1)
| ~ '>='(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
( ~ '>='(X1,X3)
| '>='('+'(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_38,plain,
( ~ '>='(X1,'==>'('0',X2))
| '>='(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_19]) ).
cnf(c_0_39,plain,
'>='(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
'>='(X1,'==>'(X2,'==>'(X3,X1))),
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_41,plain,
'==>'('==>'(X1,X2),X2) = '==>'('==>'(X2,X1),X1),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
( ~ '>='('0',X1)
| '0' = X1 ),
inference(spm,[status(thm)],[c_0_36,c_0_20]) ).
cnf(c_0_43,plain,
( ~ '>='(X2,X3)
| '>='(X1,'==>'(X2,X3)) ),
inference(spm,[status(thm)],[c_0_28,c_0_37]) ).
cnf(c_0_44,plain,
'>='('==>'('0',X1),X1),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
'>='(X1,'==>'(X2,X1)),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
fof(c_0_46,plain,
! [X50] : '+'(X50,X50) = X50,
inference(variable_rename,[status(thm)],[sos_14]) ).
cnf(c_0_47,plain,
'>='(X1,'==>'('==>'('==>'(X2,X1),X3),X3)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
( ~ '>='(X1,X2)
| '==>'(X1,X2) = '0' ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
'==>'('0',X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_44]),c_0_45])]) ).
cnf(c_0_50,plain,
'+'(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,plain,
( ~ '>='('==>'(X3,X1),X2)
| '>='(X1,X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_52,plain,
'>='(X1,'==>'(X2,'+'(X2,X1))),
inference(spm,[status(thm)],[c_0_28,c_0_39]) ).
cnf(c_0_53,plain,
( ~ '>='(X1,'+'(X3,X2))
| '>='(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_54,plain,
( ~ '>='(X1,'==>'(X1,X2))
| '>='(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_50]) ).
cnf(c_0_55,plain,
'>='(X1,'==>'(X2,'+'(X2,'==>'(X3,X1)))),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( ~ '>='(X2,'==>'(X1,'+'(X4,X3)))
| '>='('+'(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_53,c_0_32]) ).
cnf(c_0_57,plain,
'>='(X1,'+'(X1,'==>'(X2,X1))),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
'>='('+'(X1,'==>'(X1,'+'(X2,X3))),X3),
inference(spm,[status(thm)],[c_0_56,c_0_39]) ).
cnf(c_0_59,plain,
'+'(X1,'==>'(X2,X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_57]),c_0_27])]) ).
cnf(c_0_60,plain,
( ~ '>='(X1,'==>'('+'(X1,X2),X3))
| '>='('+'(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_54,c_0_37]) ).
cnf(c_0_61,plain,
'>='('+'(X1,'==>'(X1,X2)),'==>'(X3,X2)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,plain,
( ~ '>='('+'(X2,'+'(X3,X1)),X4)
| '>='(X1,'==>'('+'(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_63,plain,
'>='('+'(X1,'+'('==>'(X1,X2),X3)),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_25]) ).
cnf(c_0_64,plain,
'>='(X1,'==>'('+'(X2,'==>'(X2,X3)),X3)),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_65,plain,
'+'(X1,'==>'('==>'(X1,X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_59,c_0_41]) ).
cnf(c_0_66,plain,
'==>'('+'(X1,'==>'(X1,X2)),X2) = '0',
inference(spm,[status(thm)],[c_0_42,c_0_64]) ).
fof(c_0_67,negated_conjecture,
~ ! [X21] : '==>'('==>'('==>'(X21,'1'),X21),X21) = '0',
inference(assume_negation,[status(cth)],[goals_15]) ).
cnf(c_0_68,plain,
( ~ '>='('==>'(X1,'+'(X1,X2)),X2)
| '==>'(X1,'+'(X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_36,c_0_52]) ).
cnf(c_0_69,plain,
'+'(X1,'==>'(X1,X2)) = '+'(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_49]),c_0_25]),c_0_16]),c_0_59]) ).
cnf(c_0_70,plain,
'>='('==>'(X1,'+'(X2,X3)),'==>'(X1,X3)),
inference(spm,[status(thm)],[c_0_28,c_0_58]) ).
fof(c_0_71,negated_conjecture,
'==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0) != '0',
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_67])])])]) ).
cnf(c_0_72,plain,
'>='(X1,'==>'('==>'(X1,X2),X2)),
inference(spm,[status(thm)],[c_0_45,c_0_41]) ).
cnf(c_0_73,plain,
'==>'(X1,'+'(X1,X2)) = '==>'(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).
cnf(c_0_74,plain,
'>='(X1,'==>'(X2,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_75,negated_conjecture,
'==>'('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0) != '0',
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_76,plain,
'>='('==>'(X1,X2),'==>'('==>'('==>'(X2,X1),X1),X2)),
inference(spm,[status(thm)],[c_0_72,c_0_41]) ).
cnf(c_0_77,plain,
'==>'(X1,'==>'(X1,X2)) = '==>'(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_69]),c_0_73]) ).
cnf(c_0_78,plain,
'==>'(X1,X1) = '0',
inference(spm,[status(thm)],[c_0_42,c_0_74]) ).
cnf(c_0_79,negated_conjecture,
~ '>='('==>'('==>'(esk1_0,'1'),esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_75,c_0_48]) ).
cnf(c_0_80,plain,
'>='('==>'('==>'(X1,X2),X1),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]),c_0_49]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL901+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 % Computer : n015.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.41 % DateTime : Mon Sep 21 01:14:06 UTC 2026
% 0.14/0.42 % CPUTime :
% 0.14/0.42 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.49 Running first-order theorem proving
% 0.14/0.49 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
% 1.91/0.82 % Version: 3.5.1
% 1.91/0.82 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.91/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.91/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.91/0.82 % Starting new_bool_3 with 300s (1) cores
% 1.91/0.82 % Starting new_bool_1 with 300s (1) cores
% 1.91/0.82 % Starting sh5l with 300s (1) cores
% 1.91/0.82 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 234667 completed with status 0
% 1.91/0.82 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.91/0.82 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.91/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.91/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.91/0.82 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.91/0.82 % No SInE strategy applied
% 1.91/0.82 % Search class: FHUSM-FFSF22-MFFFFFNN
% 1.91/0.82 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.91/0.82 % Starting SubtermCWHack with 136s (1) cores
% 1.91/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.91/0.82 % Starting U----_212g_01_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.91/0.82 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.91/0.82 % Starting new_bool_3 with 136s (1) cores
% 1.91/0.82 % SubtermCWHack with pid 234672 completed with status 0
% 1.91/0.82 % Result found by SubtermCWHack
% 1.91/0.82 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.91/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.91/0.82 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.91/0.82 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.91/0.82 % No SInE strategy applied
% 1.91/0.82 % Search class: FHUSM-FFSF22-MFFFFFNN
% 1.91/0.82 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.91/0.82 % Starting SubtermCWHack with 136s (1) cores
% 1.91/0.82 % Preprocessing time : 0.001 s
% 1.91/0.82
% 1.91/0.82 % Proof found!
% 1.91/0.82 % SZS status Theorem
% 1.91/0.82 % SZS output start CNFRefutation
% See solution above
% 1.91/0.82 % Parsed axioms : 15
% 1.91/0.82 % Removed by relevancy pruning/SinE : 0
% 1.91/0.82 % Initial clauses : 16
% 1.91/0.82 % Removed in clause preprocessing : 0
% 1.91/0.82 % Initial clauses in saturation : 16
% 1.91/0.82 % Processed clauses : 3368
% 1.91/0.82 % ...of these trivial : 320
% 1.91/0.82 % ...subsumed : 2628
% 1.91/0.82 % ...remaining for further processing : 420
% 1.91/0.82 % Other redundant clauses eliminated : 0
% 1.91/0.82 % Clauses deleted for lack of memory : 0
% 1.91/0.82 % Backward-subsumed : 13
% 1.91/0.82 % Backward-rewritten : 41
% 1.91/0.82 % Generated clauses : 33225
% 1.91/0.82 % ...of the previous two non-redundant : 22650
% 1.91/0.82 % ...aggressively subsumed : 0
% 1.91/0.82 % Contextual simplify-reflections : 0
% 1.91/0.82 % Paramodulations : 33225
% 1.91/0.82 % Factorizations : 0
% 1.91/0.82 % NegExts : 0
% 1.91/0.82 % Equation resolutions : 0
% 1.91/0.82 % Disequality decompositions : 0
% 1.91/0.82 % Total rewrite steps : 24773
% 1.91/0.82 % ...of those cached : 22771
% 1.91/0.82 % Propositional unsat checks : 0
% 1.91/0.82 % Propositional check models : 0
% 1.91/0.82 % Propositional check unsatisfiable : 0
% 1.91/0.82 % Propositional clauses : 0
% 1.91/0.82 % Propositional clauses after purity: 0
% 1.91/0.82 % Propositional unsat core size : 0
% 1.91/0.82 % Propositional preprocessing time : 0.000
% 1.91/0.82 % Propositional encoding time : 0.000
% 1.91/0.82 % Propositional solver time : 0.000
% 1.91/0.82 % Success case prop preproc time : 0.000
% 1.91/0.82 % Success case prop encoding time : 0.000
% 1.91/0.82 % Success case prop solver time : 0.000
% 1.91/0.82 % Current number of processed clauses : 366
% 1.91/0.82 % Positive orientable unit clauses : 128
% 1.91/0.82 % Positive unorientable unit clauses: 4
% 1.91/0.82 % Negative unit clauses : 6
% 1.91/0.82 % Non-unit-clauses : 228
% 1.91/0.82 % Current number of unprocessed clauses: 19168
% 1.91/0.82 % ...number of literals in the above : 46294
% 1.91/0.82 % Current number of archived formulas : 0
% 1.91/0.82 % Current number of archived clauses : 54
% 1.91/0.82 % Clause-clause subsumption calls (NU) : 13082
% 1.91/0.82 % Rec. Clause-clause subsumption calls : 12956
% 1.91/0.82 % Non-unit clause-clause subsumptions : 2211
% 1.91/0.82 % Unit Clause-clause subsumption calls : 224
% 1.91/0.82 % Rewrite failures with RHS unbound : 0
% 1.91/0.82 % BW rewrite match attempts : 719
% 1.91/0.82 % BW rewrite match successes : 54
% 1.91/0.82 % Condensation attempts : 0
% 1.91/0.82 % Condensation successes : 0
% 1.91/0.82 % Termbank termtop insertions : 275577
% 1.91/0.82 % Search garbage collected termcells : 113
% 1.91/0.82
% 1.91/0.82 % -------------------------------------------------
% 1.91/0.82 % User time : 0.266 s
% 1.91/0.82 % System time : 0.015 s
% 1.91/0.82 % Total time : 0.281 s
% 1.91/0.82 % Maximum resident set size: 3392 pages
% 1.91/0.82
% 1.91/0.82 % -------------------------------------------------
% 1.91/0.82 % User time : 1.264 s
% 1.91/0.82 % System time : 0.072 s
% 1.91/0.82 % Total time : 1.335 s
% 1.91/0.82 % Maximum resident set size: 4608 pages
% 1.91/0.82 % E exiting
%------------------------------------------------------------------------------