%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL517+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:12:57 PM UTC 2026
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 14
% Syntax : Number of formulae : 75 ( 43 unt; 0 def)
% Number of atoms : 130 ( 10 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 98 ( 43 ~; 39 |; 8 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 111 ( 9 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(rosser_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_op_implies_and) ).
fof(kn3,axiom,
( kn3
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X4,X5),implies(not(and(X5,X6)),not(and(X6,X4))))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',kn3) ).
fof(rosser_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_op_or) ).
fof(rosser_kn3,axiom,
kn3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_kn3) ).
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(implies(X1,X2))
& is_a_theorem(X1) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(kn1,axiom,
( kn1
<=> ! [X4] : is_a_theorem(implies(X4,and(X4,X4))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',kn1) ).
fof(rosser_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_modus_ponens) ).
fof(rosser_kn1,axiom,
kn1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_kn1) ).
fof(kn2,axiom,
( kn2
<=> ! [X4,X5] : is_a_theorem(implies(and(X4,X5),X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',kn2) ).
fof(rosser_kn2,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).
fof(luka_cn3,conjecture,
cn3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn3) ).
fof(cn3,axiom,
( cn3
<=> ! [X4] : is_a_theorem(implies(implies(not(X4),X4),X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',cn3) ).
fof(c_0_14,plain,
! [X121,X122] :
( implies(X121,X122) = not(and(X121,not(X122)))
| ~ op_implies_and ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])])]) ).
fof(c_0_15,plain,
! [X117,X118] :
( or(X117,X118) = not(and(not(X117),not(X118)))
| ~ op_or ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])])]) ).
cnf(c_0_16,plain,
( ~ op_implies_and
| implies(X1,X2) = not(and(X1,not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[rosser_op_implies_and]) ).
fof(c_0_18,plain,
! [X77,X78,X79] :
( ( kn3
| ~ is_a_theorem(implies(implies(esk36_0,esk37_0),implies(not(and(esk37_0,esk38_0)),not(and(esk38_0,esk36_0))))) )
& ( is_a_theorem(implies(implies(X77,X78),implies(not(and(X78,X79)),not(and(X79,X77)))))
| ~ kn3 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn3])])])])]) ).
cnf(c_0_19,plain,
( ~ op_or
| or(X1,X2) = not(and(not(X1),not(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,plain,
op_or,
inference(split_conjunct,[status(thm)],[rosser_op_or]) ).
cnf(c_0_22,plain,
( ~ kn3
| is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1))))) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,plain,
kn3,
inference(split_conjunct,[status(thm)],[rosser_kn3]) ).
fof(c_0_25,plain,
! [X7,X8] :
( ( modus_ponens
| ~ is_a_theorem(esk2_0) )
& ( modus_ponens
| is_a_theorem(implies(esk1_0,esk2_0)) )
& ( modus_ponens
| is_a_theorem(esk1_0) )
& ( is_a_theorem(X8)
| ~ is_a_theorem(implies(X7,X8))
| ~ is_a_theorem(X7)
| ~ modus_ponens ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])])]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
fof(c_0_27,plain,
! [X71] :
( ( kn1
| ~ is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0))) )
& ( is_a_theorem(implies(X71,and(X71,X71)))
| ~ kn1 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn1])])])])]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1)
| ~ modus_ponens
| is_a_theorem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[rosser_modus_ponens]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(or(X1,X2),or(and(X2,X3),implies(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_23]) ).
cnf(c_0_31,plain,
or(and(X1,not(X2)),X3) = implies(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_32,plain,
( ~ kn1
| is_a_theorem(implies(X1,and(X1,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
kn1,
inference(split_conjunct,[status(thm)],[rosser_kn1]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),or(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_23]),c_0_31]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(or(X3,X1))
| is_a_theorem(implies(implies(X1,X2),or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
is_a_theorem(or(X1,and(not(X1),not(X1)))),
inference(spm,[status(thm)],[c_0_36,c_0_23]) ).
fof(c_0_39,plain,
! [X73,X74] :
( ( kn2
| ~ is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0)) )
& ( is_a_theorem(implies(and(X73,X74),X73))
| ~ kn2 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn2])])])])]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(implies(and(not(X1),not(X1)),X2),or(X2,X1))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( ~ kn2
| is_a_theorem(implies(and(X1,X2),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_42,plain,
kn2,
inference(split_conjunct,[status(thm)],[rosser_kn2]) ).
cnf(c_0_43,plain,
( ~ is_a_theorem(implies(and(not(X2),not(X2)),X1))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_40]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_45,plain,
is_a_theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(implies(X1,X2),or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_37,c_0_45]) ).
cnf(c_0_47,plain,
( ~ is_a_theorem(not(X2))
| ~ is_a_theorem(or(X2,X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_23]) ).
cnf(c_0_48,plain,
not(and(X1,implies(X2,X3))) = implies(X1,and(X2,not(X3))),
inference(spm,[status(thm)],[c_0_20,c_0_20]) ).
cnf(c_0_49,plain,
( ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(or(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_34,c_0_46]) ).
cnf(c_0_50,plain,
( ~ is_a_theorem(implies(X2,and(X3,not(X4))))
| ~ is_a_theorem(or(and(X2,implies(X3,X4)),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
( ~ is_a_theorem(or(X3,X1))
| is_a_theorem(or(and(X1,X2),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
cnf(c_0_52,plain,
is_a_theorem(or(X1,not(and(X1,X2)))),
inference(spm,[status(thm)],[c_0_49,c_0_44]) ).
cnf(c_0_53,plain,
( ~ is_a_theorem(or(and(not(X2),or(X2,X2)),X1))
| is_a_theorem(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_36]),c_0_23]) ).
cnf(c_0_54,plain,
is_a_theorem(or(and(X1,X2),implies(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_51,c_0_45]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(or(and(X1,X2),X3),or(X3,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_52]),c_0_23]) ).
cnf(c_0_56,plain,
is_a_theorem(or(X1,implies(X1,X2))),
inference(spm,[status(thm)],[c_0_52,c_0_20]) ).
fof(c_0_57,negated_conjecture,
~ cn3,
inference(assume_negation,[status(cth)],[luka_cn3]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(or(X1,X1),not(not(X1)))),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,plain,
( ~ is_a_theorem(or(and(X2,X3),X1))
| is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_55]) ).
cnf(c_0_60,plain,
is_a_theorem(or(and(implies(X1,X2),X3),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_51,c_0_56]) ).
fof(c_0_61,negated_conjecture,
~ cn3,
inference(fof_simplification,[status(thm)],[c_0_57]) ).
cnf(c_0_62,plain,
( ~ is_a_theorem(or(X1,X1))
| is_a_theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_34,c_0_58]) ).
cnf(c_0_63,plain,
is_a_theorem(or(implies(X1,X2),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
fof(c_0_64,plain,
! [X93] :
( ( cn3
| ~ is_a_theorem(implies(implies(not(esk44_0),esk44_0),esk44_0)) )
& ( is_a_theorem(implies(implies(not(X93),X93),X93))
| ~ cn3 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cn3])])])])]) ).
fof(c_0_65,negated_conjecture,
~ cn3,
inference(fof_nnf,[status(thm)],[c_0_61]) ).
cnf(c_0_66,plain,
is_a_theorem(not(not(implies(X1,X1)))),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
( ~ is_a_theorem(implies(implies(not(esk44_0),esk44_0),esk44_0))
| cn3 ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_68,negated_conjecture,
~ cn3,
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_69,plain,
( ~ is_a_theorem(or(not(implies(X2,X2)),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_66]) ).
cnf(c_0_70,plain,
~ is_a_theorem(implies(implies(not(esk44_0),esk44_0),esk44_0)),
inference(sr,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_69,c_0_45]) ).
cnf(c_0_72,plain,
~ is_a_theorem(implies(or(esk44_0,esk44_0),esk44_0)),
inference(spm,[status(thm)],[c_0_70,c_0_23]) ).
cnf(c_0_73,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_71]),c_0_31]),c_0_23]) ).
cnf(c_0_74,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL517+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n001.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 00:42:28 UTC 2026
% 0.15/0.38 % CPUTime :
% 0.15/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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.21/0.54 % Version: 3.5.1
% 0.21/0.54 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.21/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.21/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 % Starting sh5l with 300s (1) cores
% 0.21/0.54 % new_bool_1 with pid 1832078 completed with status 9
% 0.21/0.54 % new_bool_3 with pid 1832077 completed with status 9
% 0.21/0.54 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 1832076 completed with status 0
% 0.21/0.54 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.21/0.54 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.21/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.21/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.54 % No SInE strategy applied
% 0.21/0.54 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.21/0.54 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 % Starting SubtermCWHack with 151s (1) cores
% 0.21/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.21/0.54 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.21/0.54 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.21/0.54 % Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.54 % H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 1832092 completed with status 0
% 0.21/0.54 % Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.21/0.54 % Preprocessing class: FSMSSLSSSSSNFFN.
% 0.21/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 0.21/0.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.54 % No SInE strategy applied
% 0.21/0.54 % Search class: FGUSF-FFMM21-MFFFFFNN
% 0.21/0.54 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54 % Starting SubtermCWHack with 151s (1) cores
% 0.21/0.54 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 0.21/0.54 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 0.21/0.54 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 0.21/0.54 % Preprocessing time : 0.001 s
% 0.21/0.54 % Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 % Proof found!
% 0.21/0.54 % SZS status Theorem
% 0.21/0.54 % SZS output start CNFRefutation
% See solution above
% 0.21/0.54 % Parsed axioms : 43
% 0.21/0.54 % Removed by relevancy pruning/SinE : 0
% 0.21/0.54 % Initial clauses : 72
% 0.21/0.54 % Removed in clause preprocessing : 0
% 0.21/0.54 % Initial clauses in saturation : 72
% 0.21/0.54 % Processed clauses : 419
% 0.21/0.54 % ...of these trivial : 62
% 0.21/0.54 % ...subsumed : 42
% 0.21/0.54 % ...remaining for further processing : 315
% 0.21/0.54 % Other redundant clauses eliminated : 0
% 0.21/0.54 % Clauses deleted for lack of memory : 0
% 0.21/0.54 % Backward-subsumed : 1
% 0.21/0.54 % Backward-rewritten : 8
% 0.21/0.54 % Generated clauses : 3499
% 0.21/0.54 % ...of the previous two non-redundant : 2848
% 0.21/0.54 % ...aggressively subsumed : 0
% 0.21/0.54 % Contextual simplify-reflections : 0
% 0.21/0.54 % Paramodulations : 3499
% 0.21/0.54 % Factorizations : 0
% 0.21/0.54 % NegExts : 0
% 0.21/0.54 % Equation resolutions : 0
% 0.21/0.54 % Disequality decompositions : 0
% 0.21/0.54 % Total rewrite steps : 2467
% 0.21/0.54 % ...of those cached : 1540
% 0.21/0.54 % Propositional unsat checks : 0
% 0.21/0.54 % Propositional check models : 0
% 0.21/0.54 % Propositional check unsatisfiable : 0
% 0.21/0.54 % Propositional clauses : 0
% 0.21/0.54 % Propositional clauses after purity: 0
% 0.21/0.54 % Propositional unsat core size : 0
% 0.21/0.54 % Propositional preprocessing time : 0.000
% 0.21/0.54 % Propositional encoding time : 0.000
% 0.21/0.54 % Propositional solver time : 0.000
% 0.21/0.54 % Success case prop preproc time : 0.000
% 0.21/0.54 % Success case prop encoding time : 0.000
% 0.21/0.54 % Success case prop solver time : 0.000
% 0.21/0.54 % Current number of processed clauses : 246
% 0.21/0.54 % Positive orientable unit clauses : 141
% 0.21/0.54 % Positive unorientable unit clauses: 0
% 0.21/0.54 % Negative unit clauses : 2
% 0.21/0.54 % Non-unit-clauses : 103
% 0.21/0.54 % Current number of unprocessed clauses: 2561
% 0.21/0.54 % ...number of literals in the above : 3293
% 0.21/0.54 % Current number of archived formulas : 0
% 0.21/0.54 % Current number of archived clauses : 69
% 0.21/0.54 % Clause-clause subsumption calls (NU) : 642
% 0.21/0.54 % Rec. Clause-clause subsumption calls : 639
% 0.21/0.54 % Non-unit clause-clause subsumptions : 41
% 0.21/0.54 % Unit Clause-clause subsumption calls : 278
% 0.21/0.54 % Rewrite failures with RHS unbound : 0
% 0.21/0.54 % BW rewrite match attempts : 591
% 0.21/0.54 % BW rewrite match successes : 9
% 0.21/0.54 % Condensation attempts : 0
% 0.21/0.54 % Condensation successes : 0
% 0.21/0.54 % Termbank termtop insertions : 58572
% 0.21/0.54 % Search garbage collected termcells : 1092
% 0.21/0.54
% 0.21/0.54 % -------------------------------------------------
% 0.21/0.54 % User time : 0.037 s
% 0.21/0.54 % System time : 0.009 s
% 0.21/0.54 % Total time : 0.046 s
% 0.21/0.54 % Maximum resident set size: 3380 pages
% 0.21/0.54
% 0.21/0.54 % -------------------------------------------------
% 0.21/0.54 % User time : 0.209 s
% 0.21/0.54 % System time : 0.065 s
% 0.21/0.54 % Total time : 0.274 s
% 0.21/0.54 % Maximum resident set size: 4864 pages
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------