%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC204+1 : TPTP v9.3.1. Released v2.4.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 02:43:26 PM UTC 2026
% Result : Theorem 0.32s 0.46s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 61 ( 14 unt; 0 def)
% Number of atoms : 241 ( 83 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 291 ( 111 ~; 104 |; 33 &)
% ( 3 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 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 : 80 ( 0 sgn 51 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( neq(X1,nil)
| ? [X5] :
( ? [X6] :
( neq(nil,X4)
& app(X3,X6) = X5
& tl(X4) = X6
& ssList(X6) )
& X4 != X5
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( neq(X1,nil)
| ? [X5] :
( ? [X6] :
( neq(nil,X4)
& app(X3,X6) = X5
& tl(X4) = X6
& ssList(X6) )
& X4 != X5
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( neq(X4,nil)
| ~ neq(X2,nil) )
& ( neq(X1,nil)
| ? [X5] :
( ? [X6] :
( neq(nil,X4)
& app(X3,X6) = X5
& tl(X4) = X6
& ssList(X6) )
& X4 != X5
& ssList(X5) )
| ~ neq(X2,nil) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_13,negated_conjecture,
! [X11,X12] :
( ( ~ neq(esk1_0,nil)
| ~ neq(esk4_0,nil) )
& ( ~ neq(esk1_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(nil,esk4_0)
| app(esk3_0,X12) != X11
| tl(esk4_0) != X12
| ~ ssList(X12)
| esk4_0 = X11
| ~ ssList(X11)
| ~ neq(esk4_0,nil) )
& ( ~ neq(nil,esk4_0)
| app(esk3_0,X12) != X11
| tl(esk4_0) != X12
| ~ ssList(X12)
| esk4_0 = X11
| ~ ssList(X11)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| 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(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)],[c_0_12])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_15,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_16,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_19,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])])])]) ).
fof(c_0_20,plain,
! [X36,X37,X38] :
( app(app(X36,X37),X38) = app(X36,app(X37,X38))
| ~ ssList(X38)
| ~ ssList(X37)
| ~ ssList(X36) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_21,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| nil != X1
| nil = app(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(esk1_0,nil)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_25,plain,
! [X15,X16] :
( ( ~ ssList(X15)
| ~ ssList(X16)
| neq(X15,X16)
| X15 = X16 )
& ( ~ ssList(X15)
| ~ ssList(X16)
| X15 != X16
| ~ neq(X15,X16) ) ),
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_18])])])])]) ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_21])]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
~ neq(esk1_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_26]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| app(nil,app(nil,X1)) = app(nil,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22])]) ).
fof(c_0_34,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
inference(fof_simplification,[status(thm)],[ax18]) ).
fof(c_0_35,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
fof(c_0_36,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
fof(c_0_37,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
fof(c_0_38,plain,
! [X27] :
( app(nil,X27) = X27
| ~ ssList(X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_39,negated_conjecture,
( ~ neq(nil,esk4_0)
| app(esk3_0,X2) != X1
| tl(esk4_0) != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(esk4_0,nil)
| esk4_0 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_40,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22]),c_0_31])]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ssList(app(nil,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_22])]) ).
fof(c_0_43,plain,
! [X56,X57] :
( cons(X57,X56) != X56
| ~ ssItem(X57)
| ~ ssList(X56) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])]) ).
fof(c_0_44,plain,
! [X49] :
( cons(hd(X49),tl(X49)) = X49
| nil = X49
| ~ ssList(X49) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])]) ).
fof(c_0_45,plain,
! [X62] :
( ssItem(hd(X62))
| nil = X62
| ~ ssList(X62) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])]) ).
fof(c_0_46,plain,
! [X42] :
( ssList(tl(X42))
| nil = X42
| ~ ssList(X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( ~ neq(nil,esk4_0)
| ~ ssList(tl(esk4_0))
| app(nil,tl(esk4_0)) = esk4_0 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_24])])])]),c_0_42]) ).
cnf(c_0_49,plain,
( cons(X2,X1) != X1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| cons(hd(X1),tl(X1)) = X1
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ssItem(hd(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_52,plain,
( ~ ssList(X1)
| ssList(tl(X1))
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( ~ neq(nil,esk4_0)
| ~ ssList(tl(esk4_0))
| tl(esk4_0) = esk4_0 ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_55,plain,
( ~ ssList(X1)
| tl(X1) != X1
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52]) ).
cnf(c_0_56,negated_conjecture,
( ~ neq(nil,esk4_0)
| esk4_0 = nil
| tl(esk4_0) = esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_52]),c_0_54])]) ).
cnf(c_0_57,negated_conjecture,
( ~ neq(nil,esk4_0)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_54])]) ).
cnf(c_0_58,negated_conjecture,
esk4_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_30]),c_0_54]),c_0_22])]) ).
cnf(c_0_59,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_29,c_0_41]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC204+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n008.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 08:05:53 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 0.32/0.46 % Version: 3.5.1
% 0.32/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.32/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.32/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.32/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.32/0.46 % Starting sh5l with 300s (1) cores
% 0.32/0.46 % new_bool_3 with pid 543435 completed with status 0
% 0.32/0.46 % Result found by new_bool_3
% 0.32/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.32/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.32/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.32/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.32/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/0.46 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.32/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.32/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.32/0.46 % SubtermCWHack with pid 543438 completed with status 0
% 0.32/0.46 % Result found by SubtermCWHack
% 0.32/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.32/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.32/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.32/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.32/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.32/0.46 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.32/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.32/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.32/0.46 % Preprocessing time : 0.002 s
% 0.32/0.46
% 0.32/0.46 % Proof found!
% 0.32/0.46 % SZS status Theorem
% 0.32/0.46 % SZS output start CNFRefutation
% See solution above
% 0.32/0.46 % Parsed axioms : 96
% 0.32/0.46 % Removed by relevancy pruning/SinE : 67
% 0.32/0.46 % Initial clauses : 51
% 0.32/0.46 % Removed in clause preprocessing : 0
% 0.32/0.46 % Initial clauses in saturation : 51
% 0.32/0.46 % Processed clauses : 173
% 0.32/0.46 % ...of these trivial : 3
% 0.32/0.46 % ...subsumed : 79
% 0.32/0.46 % ...remaining for further processing : 91
% 0.32/0.46 % Other redundant clauses eliminated : 30
% 0.32/0.46 % Clauses deleted for lack of memory : 0
% 0.32/0.46 % Backward-subsumed : 2
% 0.32/0.46 % Backward-rewritten : 12
% 0.32/0.46 % Generated clauses : 468
% 0.32/0.46 % ...of the previous two non-redundant : 377
% 0.32/0.46 % ...aggressively subsumed : 0
% 0.32/0.46 % Contextual simplify-reflections : 22
% 0.32/0.46 % Paramodulations : 435
% 0.32/0.46 % Factorizations : 0
% 0.32/0.46 % NegExts : 0
% 0.32/0.46 % Equation resolutions : 35
% 0.32/0.46 % Disequality decompositions : 0
% 0.32/0.46 % Total rewrite steps : 210
% 0.32/0.46 % ...of those cached : 201
% 0.32/0.46 % Propositional unsat checks : 0
% 0.32/0.46 % Propositional check models : 0
% 0.32/0.46 % Propositional check unsatisfiable : 0
% 0.32/0.46 % Propositional clauses : 0
% 0.32/0.46 % Propositional clauses after purity: 0
% 0.32/0.46 % Propositional unsat core size : 0
% 0.32/0.46 % Propositional preprocessing time : 0.000
% 0.32/0.46 % Propositional encoding time : 0.000
% 0.32/0.46 % Propositional solver time : 0.000
% 0.32/0.46 % Success case prop preproc time : 0.000
% 0.32/0.46 % Success case prop encoding time : 0.000
% 0.32/0.46 % Success case prop solver time : 0.000
% 0.32/0.46 % Current number of processed clauses : 73
% 0.32/0.46 % Positive orientable unit clauses : 7
% 0.32/0.46 % Positive unorientable unit clauses: 0
% 0.32/0.46 % Negative unit clauses : 2
% 0.32/0.46 % Non-unit-clauses : 64
% 0.32/0.46 % Current number of unprocessed clauses: 252
% 0.32/0.46 % ...number of literals in the above : 1387
% 0.32/0.46 % Current number of archived formulas : 0
% 0.32/0.46 % Current number of archived clauses : 14
% 0.32/0.46 % Clause-clause subsumption calls (NU) : 1107
% 0.32/0.46 % Rec. Clause-clause subsumption calls : 455
% 0.32/0.46 % Non-unit clause-clause subsumptions : 103
% 0.32/0.46 % Unit Clause-clause subsumption calls : 51
% 0.32/0.46 % Rewrite failures with RHS unbound : 0
% 0.32/0.46 % BW rewrite match attempts : 4
% 0.32/0.46 % BW rewrite match successes : 4
% 0.32/0.46 % Condensation attempts : 0
% 0.32/0.46 % Condensation successes : 0
% 0.32/0.46 % Termbank termtop insertions : 12074
% 0.32/0.46 % Search garbage collected termcells : 1518
% 0.32/0.46
% 0.32/0.46 % -------------------------------------------------
% 0.32/0.46 % User time : 0.018 s
% 0.32/0.46 % System time : 0.003 s
% 0.32/0.46 % Total time : 0.021 s
% 0.32/0.46 % Maximum resident set size: 3760 pages
% 0.32/0.46
% 0.32/0.46 % -------------------------------------------------
% 0.32/0.46 % User time : 0.021 s
% 0.32/0.46 % System time : 0.009 s
% 0.32/0.46 % Total time : 0.030 s
% 0.32/0.46 % Maximum resident set size: 4608 pages
% 0.32/0.46 % E exiting
%------------------------------------------------------------------------------