%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC112+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 : n016.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:03 PM UTC 2026
% Result : Theorem 0.16s 0.48s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 13 unt; 0 def)
% Number of atoms : 248 ( 84 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 310 ( 107 ~; 103 |; 65 &)
% ( 3 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn 50 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ( segmentP(X2,X1)
& neq(X1,nil) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( lt(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(app(X5,X3),X6) != X4 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
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(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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox/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)
& neq(X1,nil) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( lt(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(app(X5,X3),X6) != X4 ) ) )
| 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)
& neq(X1,nil) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( lt(X13,X11)
& app(X14,cons(X13,nil)) = X3
& ssList(X14) )
& ssItem(X13) )
& app(cons(X11,nil),X12) = X6
& ssList(X12) )
& ssItem(X11) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( ? [X10] :
( lt(X7,X9)
& app(cons(X9,nil),X10) = X3
& ssList(X10) )
& ssItem(X9) )
& app(X8,cons(X7,nil)) = X5
& ssList(X8) )
& ssItem(X7) )
| ~ strictorderedP(X3)
| app(app(X5,X3),X6) != X4 ) ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,negated_conjecture,
! [X21,X22,X23,X24,X25,X26,X27,X28] :
( ( nil != esk1_0
| ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk1_0,nil) )
& ( nil != esk1_0
| neq(esk2_0,nil) )
& ( nil = esk2_0
| ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk1_0,nil) )
& ( nil = esk2_0
| neq(esk2_0,nil) )
& ( nil != esk3_0
| nil = esk4_0 )
& ( ~ lt(X27,X25)
| app(X28,cons(X27,nil)) != esk3_0
| ~ ssList(X28)
| ~ ssItem(X27)
| app(cons(X25,nil),X26) != esk6_0
| ~ ssList(X26)
| ~ ssItem(X25) )
& ( ~ lt(X21,X23)
| app(cons(X23,nil),X24) != esk3_0
| ~ ssList(X24)
| ~ ssItem(X23)
| app(X22,cons(X21,nil)) != esk5_0
| ~ ssList(X22)
| ~ ssItem(X21) )
& strictorderedP(esk3_0)
& app(app(esk5_0,esk3_0),esk6_0) = esk4_0
& ssList(esk6_0)
& ssList(esk5_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_8])])])])])]) ).
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,plain,
! [X86,X87] :
( ( ~ ssList(X86)
| ~ ssList(X87)
| nil = app(X86,X87)
| nil != X86
| nil != X87 )
& ( ~ ssList(X86)
| ~ ssList(X87)
| nil != app(X86,X87)
| nil = X86 )
& ( ~ ssList(X86)
| ~ ssList(X87)
| nil != app(X86,X87)
| nil = X87 ) ),
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_12,negated_conjecture,
app(app(esk5_0,esk3_0),esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X49,X50] :
( ( ~ ssList(X49)
| ~ ssList(X50)
| neq(X49,X50)
| X49 = X50 )
& ( ~ ssList(X49)
| ~ ssList(X50)
| X49 != X50
| ~ neq(X49,X50) ) ),
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_16,negated_conjecture,
( nil != esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
app(app(esk5_0,esk1_0),esk6_0) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_20,plain,
! [X69,X70] :
( ssList(app(X69,X70))
| ~ ssList(X70)
| ~ ssList(X69) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( nil != esk1_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( esk1_0 != nil
| esk2_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_14]),c_0_13]) ).
fof(c_0_24,plain,
! [X41,X42,X43,X44] :
( segmentP(app(app(X43,X41),X44),X42)
| ~ segmentP(X41,X42)
| ~ ssList(X44)
| ~ ssList(X43)
| ~ ssList(X42)
| ~ ssList(X41) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(app(esk5_0,esk1_0))
| esk2_0 != nil
| app(esk5_0,esk1_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( esk1_0 != nil
| neq(nil,nil) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_32,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| ~ neq(esk1_0,nil)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_34,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_24]) ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_36,negated_conjecture,
( esk2_0 != nil
| app(esk5_0,esk1_0) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_37,negated_conjecture,
esk1_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_38,negated_conjecture,
( ~ segmentP(esk2_0,esk1_0)
| esk2_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_31]),c_0_27])]),c_0_23]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk1_0,X1)
| segmentP(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_18]),c_0_19]),c_0_28]),c_0_27])]) ).
cnf(c_0_40,negated_conjecture,
esk2_0 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_28]),c_0_27])]),c_0_37]) ).
fof(c_0_41,plain,
! [X40] :
( segmentP(X40,X40)
| ~ ssList(X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_42,negated_conjecture,
~ segmentP(esk1_0,esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_27])]),c_0_40]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC112+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.10/0.38 % Computer : n016.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 08:01:09 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.43 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.16/0.48 % Version: 3.5.1
% 0.16/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.48 % Starting sh5l with 300s (1) cores
% 0.16/0.48 % new_bool_3 with pid 1961766 completed with status 0
% 0.16/0.48 % Result found by new_bool_3
% 0.16/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.48 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.48 % SubtermCWHack with pid 1961771 completed with status 0
% 0.16/0.48 % Result found by SubtermCWHack
% 0.16/0.48 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.48 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.48 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.48 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.48 % Preprocessing time : 0.002 s
% 0.16/0.48
% 0.16/0.48 % Proof found!
% 0.16/0.48 % SZS status Theorem
% 0.16/0.48 % SZS output start CNFRefutation
% See solution above
% 0.16/0.48 % Parsed axioms : 96
% 0.16/0.48 % Removed by relevancy pruning/SinE : 47
% 0.16/0.48 % Initial clauses : 93
% 0.16/0.48 % Removed in clause preprocessing : 1
% 0.16/0.48 % Initial clauses in saturation : 92
% 0.16/0.48 % Processed clauses : 189
% 0.16/0.48 % ...of these trivial : 1
% 0.16/0.48 % ...subsumed : 42
% 0.16/0.48 % ...remaining for further processing : 146
% 0.16/0.48 % Other redundant clauses eliminated : 30
% 0.16/0.48 % Clauses deleted for lack of memory : 0
% 0.16/0.48 % Backward-subsumed : 18
% 0.16/0.48 % Backward-rewritten : 3
% 0.16/0.48 % Generated clauses : 411
% 0.16/0.48 % ...of the previous two non-redundant : 316
% 0.16/0.48 % ...aggressively subsumed : 0
% 0.16/0.48 % Contextual simplify-reflections : 11
% 0.16/0.48 % Paramodulations : 376
% 0.16/0.48 % Factorizations : 0
% 0.16/0.48 % NegExts : 0
% 0.16/0.48 % Equation resolutions : 35
% 0.16/0.48 % Disequality decompositions : 0
% 0.16/0.48 % Total rewrite steps : 294
% 0.16/0.48 % ...of those cached : 285
% 0.16/0.48 % Propositional unsat checks : 0
% 0.16/0.48 % Propositional check models : 0
% 0.16/0.48 % Propositional check unsatisfiable : 0
% 0.16/0.48 % Propositional clauses : 0
% 0.16/0.48 % Propositional clauses after purity: 0
% 0.16/0.48 % Propositional unsat core size : 0
% 0.16/0.48 % Propositional preprocessing time : 0.000
% 0.16/0.48 % Propositional encoding time : 0.000
% 0.16/0.48 % Propositional solver time : 0.000
% 0.16/0.48 % Success case prop preproc time : 0.000
% 0.16/0.48 % Success case prop encoding time : 0.000
% 0.16/0.48 % Success case prop solver time : 0.000
% 0.16/0.48 % Current number of processed clauses : 117
% 0.16/0.48 % Positive orientable unit clauses : 17
% 0.16/0.48 % Positive unorientable unit clauses: 0
% 0.16/0.48 % Negative unit clauses : 6
% 0.16/0.48 % Non-unit-clauses : 94
% 0.16/0.48 % Current number of unprocessed clauses: 195
% 0.16/0.48 % ...number of literals in the above : 1069
% 0.16/0.48 % Current number of archived formulas : 0
% 0.16/0.48 % Current number of archived clauses : 22
% 0.16/0.48 % Clause-clause subsumption calls (NU) : 1535
% 0.16/0.48 % Rec. Clause-clause subsumption calls : 670
% 0.16/0.48 % Non-unit clause-clause subsumptions : 58
% 0.16/0.48 % Unit Clause-clause subsumption calls : 180
% 0.16/0.48 % Rewrite failures with RHS unbound : 0
% 0.16/0.48 % BW rewrite match attempts : 3
% 0.16/0.48 % BW rewrite match successes : 3
% 0.16/0.48 % Condensation attempts : 0
% 0.16/0.48 % Condensation successes : 0
% 0.16/0.48 % Termbank termtop insertions : 15246
% 0.16/0.48 % Search garbage collected termcells : 2418
% 0.16/0.48
% 0.16/0.48 % -------------------------------------------------
% 0.16/0.48 % User time : 0.019 s
% 0.16/0.48 % System time : 0.003 s
% 0.16/0.48 % Total time : 0.023 s
% 0.16/0.48 % Maximum resident set size: 4024 pages
% 0.16/0.48
% 0.16/0.48 % -------------------------------------------------
% 0.16/0.48 % User time : 0.025 s
% 0.16/0.48 % System time : 0.007 s
% 0.16/0.48 % Total time : 0.032 s
% 0.16/0.48 % Maximum resident set size: 4864 pages
% 0.16/0.48 % E exiting
%------------------------------------------------------------------------------