%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC211+1 : TPTP v9.3.1. Released v2.4.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 02:43:28 PM UTC 2026
% Result : Theorem 0.15s 10.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 63 ( 15 unt; 0 def)
% Number of atoms : 236 ( 93 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 281 ( 108 ~; 112 |; 29 &)
% ( 3 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 92 ( 0 sgn 46 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X4
& nil != X3 )
| neq(X1,nil)
| ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& app(X6,cons(X5,nil)) != X3
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ? [X3] :
( cons(X3,X2) = X1
& ssItem(X3) )
& ssList(X2) )
| nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X4
& nil != X3 )
| neq(X1,nil)
| ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& app(X6,cons(X5,nil)) != X3
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X4
& nil != X3 )
| neq(X1,nil)
| ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& app(X6,cons(X5,nil)) != X3
& ssList(X6) )
& ssItem(X5) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_12,negated_conjecture,
! [X11,X12] :
( ( nil != esk4_0
| nil = esk3_0 )
& ~ neq(esk1_0,nil)
& ( app(cons(X11,nil),X12) != esk4_0
| app(X12,cons(X11,nil)) = esk3_0
| ~ ssList(X12)
| ~ ssItem(X11) )
& neq(esk2_0,nil)
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
fof(c_0_13,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_14,negated_conjecture,
~ neq(esk1_0,nil),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X20,X21] :
( ( ~ ssList(X20)
| ~ ssList(X21)
| neq(X20,X21)
| X20 = X21 )
& ( ~ ssList(X20)
| ~ ssList(X21)
| X20 != X21
| ~ neq(X20,X21) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).
fof(c_0_17,plain,
! [X39,X40] :
( ( ~ ssList(X39)
| ~ ssList(X40)
| nil = app(X39,X40)
| nil != X39
| nil != X40 )
& ( ~ ssList(X39)
| ~ ssList(X40)
| nil != app(X39,X40)
| nil = X39 )
& ( ~ ssList(X39)
| ~ ssList(X40)
| nil != app(X39,X40)
| nil = X40 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])]) ).
cnf(c_0_18,negated_conjecture,
~ neq(esk3_0,nil),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_22,plain,
! [X42,X43] :
( ssList(cons(X43,X42))
| ~ ssItem(X43)
| ~ ssList(X42) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
fof(c_0_23,plain,
! [X24,X25,X26] :
( cons(X26,app(X25,X24)) = app(cons(X26,X25),X24)
| ~ ssItem(X26)
| ~ ssList(X25)
| ~ ssList(X24) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_24,plain,
! [X22,X23] :
( ssList(app(X22,X23))
| ~ ssList(X23)
| ~ ssList(X22) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_25,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( app(cons(X1,nil),X2) != esk4_0
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
fof(c_0_28,plain,
! [X34,X35] :
( cons(X35,X34) = app(cons(X35,nil),X34)
| ~ ssItem(X35)
| ~ ssList(X34) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_29,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_25])]),c_0_20])]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| app(cons(X2,nil),X1) != esk4_0
| app(X1,cons(X2,nil)) = nil ),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ssList(app(cons(X1,X2),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_36,plain,
( ~ ssItem(X1)
| app(cons(X1,nil),nil) = cons(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_32]),c_0_20])]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) != esk4_0
| app(X1,cons(X2,nil)) = nil ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20])]) ).
fof(c_0_40,plain,
! [X13] :
( ( ~ ssList(X13)
| nil = X13
| cons(esk6_1(X13),esk5_1(X13)) = X13 )
& ( ~ ssList(X13)
| nil = X13
| ssItem(esk6_1(X13)) )
& ( ~ ssList(X13)
| nil = X13
| ssList(esk5_1(X13)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
fof(c_0_41,plain,
! [X41] :
( app(X41,nil) = X41
| ~ ssList(X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_42,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) != esk4_0
| nil = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk6_1(X1),esk5_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssItem(esk6_1(esk4_0))
| ~ ssList(esk5_1(esk4_0))
| esk4_0 = nil
| esk5_1(esk4_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43])]),c_0_44])]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,plain,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,X2),nil) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_45]),c_0_20])]) ).
cnf(c_0_49,negated_conjecture,
( ~ ssList(esk5_1(esk4_0))
| esk4_0 = nil
| esk5_1(esk4_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_44])]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_52,negated_conjecture,
( ~ ssItem(X1)
| cons(X1,nil) != esk4_0
| app(nil,cons(X1,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_48]),c_0_20])]) ).
cnf(c_0_53,negated_conjecture,
( esk4_0 = nil
| esk5_1(esk4_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_44])]) ).
cnf(c_0_54,negated_conjecture,
( ~ ssItem(X1)
| cons(X1,nil) != esk4_0
| cons(X1,nil) = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_20])]),c_0_39]) ).
cnf(c_0_55,negated_conjecture,
( esk4_0 = nil
| cons(esk6_1(esk4_0),nil) = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_53]),c_0_44])]) ).
cnf(c_0_56,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_57,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssItem(esk6_1(esk4_0))
| esk4_0 = nil ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_47]),c_0_44])]) ).
cnf(c_0_61,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC211+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/10.39 % Computer : n015.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Mon Sep 21 08:08:02 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.11/10.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/10.43 Running first-order theorem proving
% 0.15/10.43 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.15/10.46 % Version: 3.5.1
% 0.15/10.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/10.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.46 % Starting sh5l with 300s (1) cores
% 0.15/10.46 % new_bool_3 with pid 998297 completed with status 0
% 0.15/10.46 % Result found by new_bool_3
% 0.15/10.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/10.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.46 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/10.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.46 % Starting SubtermCWHack with 28s (1) cores
% 0.15/10.46 % SubtermCWHack with pid 998300 completed with status 0
% 0.15/10.46 % Result found by SubtermCWHack
% 0.15/10.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/10.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/10.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.46 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/10.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.46 % Starting SubtermCWHack with 28s (1) cores
% 0.15/10.46 % Preprocessing time : 0.002 s
% 0.15/10.46
% 0.15/10.46 % Proof found!
% 0.15/10.46 % SZS status Theorem
% 0.15/10.46 % SZS output start CNFRefutation
% See solution above
% 0.15/10.46 % Parsed axioms : 96
% 0.15/10.46 % Removed by relevancy pruning/SinE : 77
% 0.15/10.46 % Initial clauses : 37
% 0.15/10.46 % Removed in clause preprocessing : 0
% 0.15/10.46 % Initial clauses in saturation : 37
% 0.15/10.46 % Processed clauses : 125
% 0.15/10.46 % ...of these trivial : 0
% 0.15/10.46 % ...subsumed : 49
% 0.15/10.46 % ...remaining for further processing : 76
% 0.15/10.46 % Other redundant clauses eliminated : 14
% 0.15/10.46 % Clauses deleted for lack of memory : 0
% 0.15/10.46 % Backward-subsumed : 4
% 0.15/10.46 % Backward-rewritten : 17
% 0.15/10.46 % Generated clauses : 313
% 0.15/10.46 % ...of the previous two non-redundant : 233
% 0.15/10.46 % ...aggressively subsumed : 0
% 0.15/10.46 % Contextual simplify-reflections : 10
% 0.15/10.46 % Paramodulations : 294
% 0.15/10.46 % Factorizations : 0
% 0.15/10.46 % NegExts : 0
% 0.15/10.46 % Equation resolutions : 20
% 0.15/10.46 % Disequality decompositions : 0
% 0.15/10.46 % Total rewrite steps : 209
% 0.15/10.46 % ...of those cached : 201
% 0.15/10.46 % Propositional unsat checks : 0
% 0.15/10.46 % Propositional check models : 0
% 0.15/10.46 % Propositional check unsatisfiable : 0
% 0.15/10.46 % Propositional clauses : 0
% 0.15/10.46 % Propositional clauses after purity: 0
% 0.15/10.46 % Propositional unsat core size : 0
% 0.15/10.46 % Propositional preprocessing time : 0.000
% 0.15/10.46 % Propositional encoding time : 0.000
% 0.15/10.46 % Propositional solver time : 0.000
% 0.15/10.46 % Success case prop preproc time : 0.000
% 0.15/10.46 % Success case prop encoding time : 0.000
% 0.15/10.46 % Success case prop solver time : 0.000
% 0.15/10.46 % Current number of processed clauses : 52
% 0.15/10.46 % Positive orientable unit clauses : 7
% 0.15/10.46 % Positive unorientable unit clauses: 0
% 0.15/10.46 % Negative unit clauses : 2
% 0.15/10.46 % Non-unit-clauses : 43
% 0.15/10.46 % Current number of unprocessed clauses: 141
% 0.15/10.46 % ...number of literals in the above : 802
% 0.15/10.46 % Current number of archived formulas : 0
% 0.15/10.46 % Current number of archived clauses : 21
% 0.15/10.46 % Clause-clause subsumption calls (NU) : 795
% 0.15/10.46 % Rec. Clause-clause subsumption calls : 311
% 0.15/10.46 % Non-unit clause-clause subsumptions : 61
% 0.15/10.46 % Unit Clause-clause subsumption calls : 26
% 0.15/10.46 % Rewrite failures with RHS unbound : 0
% 0.15/10.46 % BW rewrite match attempts : 4
% 0.15/10.46 % BW rewrite match successes : 4
% 0.15/10.46 % Condensation attempts : 0
% 0.15/10.46 % Condensation successes : 0
% 0.15/10.46 % Termbank termtop insertions : 8628
% 0.15/10.46 % Search garbage collected termcells : 1322
% 0.15/10.46
% 0.15/10.46 % -------------------------------------------------
% 0.15/10.46 % User time : 0.013 s
% 0.15/10.46 % System time : 0.001 s
% 0.15/10.46 % Total time : 0.014 s
% 0.15/10.46 % Maximum resident set size: 3760 pages
% 0.15/10.46
% 0.15/10.46 % -------------------------------------------------
% 0.15/10.46 % User time : 0.016 s
% 0.15/10.46 % System time : 0.006 s
% 0.15/10.46 % Total time : 0.022 s
% 0.15/10.46 % Maximum resident set size: 4864 pages
% 0.15/10.46 % E exiting
%------------------------------------------------------------------------------