%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC239+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 : n002.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:36 PM UTC 2026
% Result : Theorem 0.67s 0.55s
% Output : CNFRefutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 11 unt; 0 def)
% Number of atoms : 241 ( 77 equ)
% Maximal formula atoms : 54 ( 4 avg)
% Number of connectives : 310 ( 118 ~; 117 |; 43 &)
% ( 0 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 94 ( 0 sgn 49 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil != X3
| nil != X4 )
& ! [X9] :
( ssItem(X9)
=> ( ? [X10] :
( leq(X9,X10)
& memberP(X4,X10)
& X9 != X10
& ssItem(X10) )
| ~ memberP(X4,X9)
| cons(X9,nil) != X3 ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( leq(X5,X8)
| ~ lt(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
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(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
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(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil != X3
| nil != X4 )
& ! [X9] :
( ssItem(X9)
=> ( ? [X10] :
( leq(X9,X10)
& memberP(X4,X10)
& X9 != X10
& ssItem(X10) )
| ~ memberP(X4,X9)
| cons(X9,nil) != X3 ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( leq(X5,X8)
| ~ lt(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( nil != X3
| nil != X4 )
& ! [X9] :
( ssItem(X9)
=> ( ? [X10] :
( leq(X9,X10)
& memberP(X4,X10)
& X9 != X10
& ssItem(X10) )
| ~ memberP(X4,X9)
| cons(X9,nil) != X3 ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( leq(X5,X8)
| ~ lt(X5,X8)
| ~ memberP(X7,X8)
| ~ memberP(X6,X8) ) )
& app(app(X6,cons(X5,nil)),X7) = X1
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
| nil = X1
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,negated_conjecture,
! [X15,X16,X17,X20] :
( ( ~ leq(esk6_0,X20)
| ~ memberP(esk4_0,X20)
| esk6_0 = X20
| ~ ssItem(X20)
| nil = esk3_0 )
& ( ~ leq(esk6_0,X20)
| ~ memberP(esk4_0,X20)
| esk6_0 = X20
| ~ ssItem(X20)
| nil = esk4_0 )
& ( memberP(esk4_0,esk6_0)
| nil = esk3_0 )
& ( memberP(esk4_0,esk6_0)
| nil = esk4_0 )
& ( cons(esk6_0,nil) = esk3_0
| nil = esk3_0 )
& ( cons(esk6_0,nil) = esk3_0
| nil = esk4_0 )
& ( ssItem(esk6_0)
| nil = esk3_0 )
& ( ssItem(esk6_0)
| nil = esk4_0 )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X17)
| ~ leq(X15,esk5_3(X15,X16,X17)) )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X17)
| lt(X15,esk5_3(X15,X16,X17)) )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X17)
| memberP(X17,esk5_3(X15,X16,X17)) )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X17)
| memberP(X16,esk5_3(X15,X16,X17)) )
& ( ~ ssItem(X15)
| ~ ssList(X16)
| app(app(X16,cons(X15,nil)),X17) != esk1_0
| ~ ssList(X17)
| ssItem(esk5_3(X15,X16,X17)) )
& nil != esk1_0
& 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_10])])])])])]) ).
fof(c_0_12,plain,
! [X65,X66] :
( cons(X66,X65) = app(cons(X66,nil),X65)
| ~ ssItem(X66)
| ~ ssList(X65) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_13,negated_conjecture,
( cons(esk6_0,nil) = esk3_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( ssItem(esk6_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X82,X83,X84] :
( app(app(X82,X83),X84) = app(X82,app(X83,X84))
| ~ ssList(X84)
| ~ ssList(X83)
| ~ ssList(X82) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
fof(c_0_18,plain,
! [X75] :
( app(nil,X75) = X75
| ~ ssList(X75) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_19,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
cons(esk6_0,nil) = esk1_0,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]),c_0_15]) ).
cnf(c_0_21,negated_conjecture,
ssItem(esk6_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_14]),c_0_15]) ).
fof(c_0_22,plain,
! [X62,X63,X64] :
( cons(X64,app(X63,X62)) = app(cons(X64,X63),X62)
| ~ ssItem(X64)
| ~ ssList(X63)
| ~ ssList(X62) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
fof(c_0_23,plain,
! [X73,X74] :
( ssList(app(X73,X74))
| ~ ssList(X74)
| ~ ssList(X73) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_24,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
cnf(c_0_25,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssList(X1)
| cons(esk6_0,X1) = app(esk1_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_29,plain,
( ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_31,plain,
! [X51] :
( ~ memberP(nil,X51)
| ~ ssItem(X51) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(nil,app(X1,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(cons(esk6_0,X1),X2) = app(esk1_0,app(X1,X2)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21])]),c_0_30]) ).
cnf(c_0_34,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X3)
| app(app(X3,cons(X2,nil)),X1) != esk1_0
| ~ ssList(X1)
| memberP(X1,esk5_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(nil,app(X1,app(X2,X3))) = app(X1,app(X2,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(X1)
| app(esk1_0,app(nil,X1)) = cons(esk6_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_33]),c_0_21]),c_0_27])]) ).
cnf(c_0_38,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_39,plain,
! [X87] :
( app(X87,nil) = X87
| ~ ssList(X87) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_40,negated_conjecture,
( ~ ssItem(X2)
| ~ ssItem(esk5_3(X2,X1,nil))
| ~ ssList(X1)
| app(app(X1,cons(X2,nil)),nil) != esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_27])]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(X1)
| app(nil,cons(esk6_0,X1)) = cons(esk6_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_27]),c_0_38])]) ).
cnf(c_0_42,negated_conjecture,
app(esk1_0,nil) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_28]),c_0_27])]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3)
| ssItem(esk5_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_44,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,negated_conjecture,
~ ssItem(esk5_3(esk6_0,nil,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_20]),c_0_42]),c_0_27]),c_0_21])]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(app(X2,cons(X1,nil)))
| app(X2,cons(X1,nil)) != esk1_0
| ssItem(esk5_3(X1,X2,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_27])]) ).
cnf(c_0_47,negated_conjecture,
app(nil,esk1_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_42]),c_0_27]),c_0_38])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_20]),c_0_47]),c_0_20]),c_0_47]),c_0_38]),c_0_27]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC239+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.10/0.37 % Computer : n002.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 08:10:17 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.67/0.55 % Version: 3.5.1
% 0.67/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.67/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.67/0.55 % Starting sh5l with 300s (1) cores
% 0.67/0.55 % new_bool_3 with pid 2836093 completed with status 0
% 0.67/0.55 % Result found by new_bool_3
% 0.67/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.67/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.67/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.67/0.55 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.67/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.67/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.67/0.55 % SubtermCWHack with pid 2836099 completed with status 0
% 0.67/0.55 % Result found by SubtermCWHack
% 0.67/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.67/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.67/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.67/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.67/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.67/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.67/0.55 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.67/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.67/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.67/0.55 % Preprocessing time : 0.001 s
% 0.67/0.55
% 0.67/0.55 % Proof found!
% 0.67/0.55 % SZS status Theorem
% 0.67/0.55 % SZS output start CNFRefutation
% See solution above
% 0.67/0.55 % Parsed axioms : 96
% 0.67/0.55 % Removed by relevancy pruning/SinE : 66
% 0.67/0.55 % Initial clauses : 65
% 0.67/0.55 % Removed in clause preprocessing : 0
% 0.67/0.55 % Initial clauses in saturation : 65
% 0.67/0.55 % Processed clauses : 2619
% 0.67/0.55 % ...of these trivial : 11
% 0.67/0.55 % ...subsumed : 2094
% 0.67/0.55 % ...remaining for further processing : 514
% 0.67/0.55 % Other redundant clauses eliminated : 105
% 0.67/0.55 % Clauses deleted for lack of memory : 0
% 0.67/0.55 % Backward-subsumed : 22
% 0.67/0.55 % Backward-rewritten : 11
% 0.67/0.55 % Generated clauses : 11437
% 0.67/0.55 % ...of the previous two non-redundant : 9514
% 0.67/0.55 % ...aggressively subsumed : 0
% 0.67/0.55 % Contextual simplify-reflections : 152
% 0.67/0.55 % Paramodulations : 11311
% 0.67/0.55 % Factorizations : 0
% 0.67/0.55 % NegExts : 0
% 0.67/0.55 % Equation resolutions : 127
% 0.67/0.55 % Disequality decompositions : 0
% 0.67/0.55 % Total rewrite steps : 11943
% 0.67/0.55 % ...of those cached : 11908
% 0.67/0.55 % Propositional unsat checks : 0
% 0.67/0.55 % Propositional check models : 0
% 0.67/0.55 % Propositional check unsatisfiable : 0
% 0.67/0.55 % Propositional clauses : 0
% 0.67/0.55 % Propositional clauses after purity: 0
% 0.67/0.55 % Propositional unsat core size : 0
% 0.67/0.55 % Propositional preprocessing time : 0.000
% 0.67/0.55 % Propositional encoding time : 0.000
% 0.67/0.55 % Propositional solver time : 0.000
% 0.67/0.55 % Success case prop preproc time : 0.000
% 0.67/0.55 % Success case prop encoding time : 0.000
% 0.67/0.55 % Success case prop solver time : 0.000
% 0.67/0.55 % Current number of processed clauses : 477
% 0.67/0.55 % Positive orientable unit clauses : 39
% 0.67/0.55 % Positive unorientable unit clauses: 0
% 0.67/0.55 % Negative unit clauses : 16
% 0.67/0.55 % Non-unit-clauses : 422
% 0.67/0.55 % Current number of unprocessed clauses: 6940
% 0.67/0.55 % ...number of literals in the above : 35162
% 0.67/0.55 % Current number of archived formulas : 0
% 0.67/0.55 % Current number of archived clauses : 33
% 0.67/0.55 % Clause-clause subsumption calls (NU) : 41211
% 0.67/0.55 % Rec. Clause-clause subsumption calls : 21146
% 0.67/0.55 % Non-unit clause-clause subsumptions : 1711
% 0.67/0.55 % Unit Clause-clause subsumption calls : 94
% 0.67/0.55 % Rewrite failures with RHS unbound : 0
% 0.67/0.55 % BW rewrite match attempts : 23
% 0.67/0.55 % BW rewrite match successes : 7
% 0.67/0.55 % Condensation attempts : 0
% 0.67/0.55 % Condensation successes : 0
% 0.67/0.55 % Termbank termtop insertions : 205424
% 0.67/0.55 % Search garbage collected termcells : 1901
% 0.67/0.55
% 0.67/0.55 % -------------------------------------------------
% 0.67/0.55 % User time : 0.110 s
% 0.67/0.55 % System time : 0.005 s
% 0.67/0.55 % Total time : 0.115 s
% 0.67/0.55 % Maximum resident set size: 3712 pages
% 0.67/0.55
% 0.67/0.55 % -------------------------------------------------
% 0.67/0.55 % User time : 0.112 s
% 0.67/0.55 % System time : 0.010 s
% 0.67/0.55 % Total time : 0.123 s
% 0.67/0.55 % Maximum resident set size: 4608 pages
% 0.67/0.55 % E exiting
%------------------------------------------------------------------------------