%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC384+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 : n017.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:44:11 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 52 ( 17 unt; 0 def)
% Number of atoms : 232 ( 69 equ)
% Maximal formula atoms : 45 ( 4 avg)
% Number of connectives : 274 ( 94 ~; 98 |; 43 &)
% ( 3 <=>; 36 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 48 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( segmentP(X2,X1)
& singletonP(X1) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( ? [X9] :
( lt(X9,X5)
& memberP(X7,X9)
& ssItem(X9) )
| ? [X8] :
( lt(X5,X8)
& memberP(X6,X8)
& ssItem(X8) )
| app(app(X6,X3),X7) != X4
| cons(X5,nil) != X3 ) ) ) ) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax21,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( cons(X2,nil) = X1
& ssItem(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( segmentP(X2,X1)
& singletonP(X1) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( ? [X9] :
( lt(X9,X5)
& memberP(X7,X9)
& ssItem(X9) )
| ? [X8] :
( lt(X5,X8)
& memberP(X6,X8)
& ssItem(X8) )
| app(app(X6,X3),X7) != X4
| cons(X5,nil) != X3 ) ) ) ) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( segmentP(X2,X1)
& singletonP(X1) )
| ( ( nil != X3
| nil != X4 )
& ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( ? [X9] :
( lt(X9,X5)
& memberP(X7,X9)
& ssItem(X9) )
| ? [X8] :
( lt(X5,X8)
& memberP(X6,X8)
& ssItem(X8) )
| app(app(X6,X3),X7) != X4
| cons(X5,nil) != X3 ) ) ) ) )
| ~ neq(X2,nil)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> nil != cons(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[ax21]) ).
fof(c_0_10,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_11,negated_conjecture,
! [X17,X18] :
( ( ~ segmentP(esk2_0,esk1_0)
| ~ singletonP(esk1_0) )
& ( ~ lt(X18,esk5_0)
| ~ memberP(esk7_0,X18)
| ~ ssItem(X18)
| nil = esk3_0 )
& ( ~ lt(X18,esk5_0)
| ~ memberP(esk7_0,X18)
| ~ ssItem(X18)
| nil = esk4_0 )
& ( ~ lt(esk5_0,X17)
| ~ memberP(esk6_0,X17)
| ~ ssItem(X17)
| nil = esk3_0 )
& ( ~ lt(esk5_0,X17)
| ~ memberP(esk6_0,X17)
| ~ ssItem(X17)
| nil = esk4_0 )
& ( app(app(esk6_0,esk3_0),esk7_0) = esk4_0
| nil = esk3_0 )
& ( app(app(esk6_0,esk3_0),esk7_0) = esk4_0
| nil = esk4_0 )
& ( cons(esk5_0,nil) = esk3_0
| nil = esk3_0 )
& ( cons(esk5_0,nil) = esk3_0
| nil = esk4_0 )
& ( ssList(esk7_0)
| nil = esk3_0 )
& ( ssList(esk7_0)
| nil = esk4_0 )
& ( ssList(esk6_0)
| nil = esk3_0 )
& ( ssList(esk6_0)
| nil = esk4_0 )
& ( ssItem(esk5_0)
| nil = esk3_0 )
& ( ssItem(esk5_0)
| nil = esk4_0 )
& 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_8])])])])])]) ).
fof(c_0_12,plain,
! [X43,X44] :
( nil != cons(X44,X43)
| ~ ssItem(X44)
| ~ ssList(X43) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_13,plain,
! [X103,X104] :
( ( ~ ssList(X103)
| ~ ssList(X104)
| neq(X103,X104)
| X103 = X104 )
& ( ~ ssList(X103)
| ~ ssList(X104)
| X103 != X104
| ~ neq(X103,X104) ) ),
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_10])])])])]) ).
cnf(c_0_14,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( nil != cons(X2,X1)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_19,negated_conjecture,
( ssItem(esk5_0)
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( esk3_0 != nil
| esk4_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_19]) ).
fof(c_0_23,plain,
! [X37,X39] :
( ( ~ ssList(X37)
| singletonP(X37)
| cons(X39,nil) != X37
| ~ ssItem(X39) )
& ( ~ ssList(X37)
| ~ singletonP(X37)
| cons(esk10_1(X37),nil) = X37 )
& ( ~ ssList(X37)
| ~ singletonP(X37)
| ssItem(esk10_1(X37)) ) ),
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)],[ax4])])])])])]) ).
cnf(c_0_24,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( esk3_0 != nil
| neq(nil,nil) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| singletonP(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
esk3_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_18])]) ).
cnf(c_0_29,negated_conjecture,
( ssItem(esk5_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ singletonP(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,plain,
( ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(sr,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_35,negated_conjecture,
ssItem(esk5_0),
inference(sr,[status(thm)],[c_0_29,c_0_28]) ).
fof(c_0_36,plain,
! [X31,X32,X33,X34] :
( segmentP(app(app(X33,X31),X34),X32)
| ~ segmentP(X31,X32)
| ~ ssList(X34)
| ~ ssList(X33)
| ~ ssList(X32)
| ~ ssList(X31) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
cnf(c_0_37,negated_conjecture,
( app(app(esk6_0,esk3_0),esk7_0) = esk4_0
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_38,negated_conjecture,
( ssList(esk7_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_39,negated_conjecture,
( ssList(esk6_0)
| nil = esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_40,negated_conjecture,
( ~ singletonP(esk3_0)
| ~ segmentP(esk4_0,esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_15]),c_0_31]) ).
cnf(c_0_41,negated_conjecture,
singletonP(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_42,plain,
( ~ segmentP(X1,X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X3,X1),X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
app(app(esk6_0,esk3_0),esk7_0) = esk4_0,
inference(sr,[status(thm)],[c_0_37,c_0_28]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk7_0),
inference(sr,[status(thm)],[c_0_38,c_0_28]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk6_0),
inference(sr,[status(thm)],[c_0_39,c_0_28]) ).
cnf(c_0_46,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_47,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk3_0,X1)
| segmentP(esk4_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45]),c_0_34])]) ).
fof(c_0_48,plain,
! [X30] :
( segmentP(X30,X30)
| ~ ssList(X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_49,negated_conjecture,
~ segmentP(esk3_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_34])]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC384+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.12/0.38 % Computer : n017.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 08:15:44 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/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.16/0.47 % Version: 3.5.1
% 0.16/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 % Starting sh5l with 300s (1) cores
% 0.16/0.47 % new_bool_3 with pid 1875034 completed with status 0
% 0.16/0.47 % Result found by new_bool_3
% 0.16/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.47 % SubtermCWHack with pid 1875037 completed with status 0
% 0.16/0.47 % Result found by SubtermCWHack
% 0.16/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.47 % Preprocessing time : 0.002 s
% 0.16/0.47
% 0.16/0.47 % Proof found!
% 0.16/0.47 % SZS status Theorem
% 0.16/0.47 % SZS output start CNFRefutation
% See solution above
% 0.16/0.47 % Parsed axioms : 96
% 0.16/0.47 % Removed by relevancy pruning/SinE : 55
% 0.16/0.47 % Initial clauses : 86
% 0.16/0.47 % Removed in clause preprocessing : 0
% 0.16/0.47 % Initial clauses in saturation : 86
% 0.16/0.47 % Processed clauses : 255
% 0.16/0.47 % ...of these trivial : 4
% 0.16/0.47 % ...subsumed : 71
% 0.16/0.47 % ...remaining for further processing : 180
% 0.16/0.47 % Other redundant clauses eliminated : 27
% 0.16/0.47 % Clauses deleted for lack of memory : 0
% 0.16/0.47 % Backward-subsumed : 20
% 0.16/0.47 % Backward-rewritten : 9
% 0.16/0.47 % Generated clauses : 631
% 0.16/0.47 % ...of the previous two non-redundant : 449
% 0.16/0.47 % ...aggressively subsumed : 0
% 0.16/0.47 % Contextual simplify-reflections : 7
% 0.16/0.47 % Paramodulations : 596
% 0.16/0.47 % Factorizations : 0
% 0.16/0.47 % NegExts : 0
% 0.16/0.47 % Equation resolutions : 31
% 0.16/0.47 % Disequality decompositions : 0
% 0.16/0.47 % Total rewrite steps : 692
% 0.16/0.47 % ...of those cached : 670
% 0.16/0.47 % Propositional unsat checks : 0
% 0.16/0.47 % Propositional check models : 0
% 0.16/0.47 % Propositional check unsatisfiable : 0
% 0.16/0.47 % Propositional clauses : 0
% 0.16/0.47 % Propositional clauses after purity: 0
% 0.16/0.47 % Propositional unsat core size : 0
% 0.16/0.47 % Propositional preprocessing time : 0.000
% 0.16/0.47 % Propositional encoding time : 0.000
% 0.16/0.47 % Propositional solver time : 0.000
% 0.16/0.47 % Success case prop preproc time : 0.000
% 0.16/0.47 % Success case prop encoding time : 0.000
% 0.16/0.47 % Success case prop solver time : 0.000
% 0.16/0.47 % Current number of processed clauses : 137
% 0.16/0.47 % Positive orientable unit clauses : 28
% 0.16/0.47 % Positive unorientable unit clauses: 0
% 0.16/0.47 % Negative unit clauses : 10
% 0.16/0.47 % Non-unit-clauses : 99
% 0.16/0.47 % Current number of unprocessed clauses: 249
% 0.16/0.47 % ...number of literals in the above : 1222
% 0.16/0.47 % Current number of archived formulas : 0
% 0.16/0.47 % Current number of archived clauses : 34
% 0.16/0.47 % Clause-clause subsumption calls (NU) : 1993
% 0.16/0.47 % Rec. Clause-clause subsumption calls : 723
% 0.16/0.47 % Non-unit clause-clause subsumptions : 70
% 0.16/0.47 % Unit Clause-clause subsumption calls : 367
% 0.16/0.47 % Rewrite failures with RHS unbound : 0
% 0.16/0.47 % BW rewrite match attempts : 12
% 0.16/0.47 % BW rewrite match successes : 12
% 0.16/0.47 % Condensation attempts : 0
% 0.16/0.47 % Condensation successes : 0
% 0.16/0.47 % Termbank termtop insertions : 17345
% 0.16/0.47 % Search garbage collected termcells : 2167
% 0.16/0.47
% 0.16/0.47 % -------------------------------------------------
% 0.16/0.47 % User time : 0.019 s
% 0.16/0.47 % System time : 0.006 s
% 0.16/0.47 % Total time : 0.025 s
% 0.16/0.47 % Maximum resident set size: 3708 pages
% 0.16/0.47
% 0.16/0.47 % -------------------------------------------------
% 0.16/0.47 % User time : 0.023 s
% 0.16/0.47 % System time : 0.011 s
% 0.16/0.47 % Total time : 0.034 s
% 0.16/0.47 % Maximum resident set size: 4864 pages
% 0.16/0.47 % E exiting
%------------------------------------------------------------------------------