%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC236+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 : n007.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:35 PM UTC 2026
% Result : Theorem 1.06s 0.73s
% Output : CNFRefutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 6 unt; 0 def)
% Number of atoms : 251 ( 72 equ)
% Maximal formula atoms : 52 ( 6 avg)
% Number of connectives : 330 ( 115 ~; 113 |; 73 &)
% ( 0 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 107 ( 0 sgn 47 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ? [X15] :
( ? [X16] :
( ? [X17] :
( ? [X18] :
( leq(X17,X15)
& app(X18,cons(X17,nil)) = X3
& ssList(X18) )
& ssItem(X17) )
& app(cons(X15,nil),X16) = X10
& ssList(X16) )
& ssItem(X15) )
| ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( leq(X11,X13)
& app(cons(X13,nil),X14) = X3
& ssList(X14) )
& ssItem(X13) )
& app(X12,cons(X11,nil)) = X9
& ssList(X12) )
& ssItem(X11) )
| ~ totalorderedP(X3)
| app(app(X9,X3),X10) != X4 ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( lt(X5,X8)
| ~ leq(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(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(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
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(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ? [X15] :
( ? [X16] :
( ? [X17] :
( ? [X18] :
( leq(X17,X15)
& app(X18,cons(X17,nil)) = X3
& ssList(X18) )
& ssItem(X17) )
& app(cons(X15,nil),X16) = X10
& ssList(X16) )
& ssItem(X15) )
| ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( leq(X11,X13)
& app(cons(X13,nil),X14) = X3
& ssList(X14) )
& ssItem(X13) )
& app(X12,cons(X11,nil)) = X9
& ssList(X12) )
& ssItem(X11) )
| ~ totalorderedP(X3)
| app(app(X9,X3),X10) != X4 ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( lt(X5,X8)
| ~ leq(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_8,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ? [X15] :
( ? [X16] :
( ? [X17] :
( ? [X18] :
( leq(X17,X15)
& app(X18,cons(X17,nil)) = X3
& ssList(X18) )
& ssItem(X17) )
& app(cons(X15,nil),X16) = X10
& ssList(X16) )
& ssItem(X15) )
| ? [X11] :
( ? [X12] :
( ? [X13] :
( ? [X14] :
( leq(X11,X13)
& app(cons(X13,nil),X14) = X3
& ssList(X14) )
& ssItem(X13) )
& app(X12,cons(X11,nil)) = X9
& ssList(X12) )
& ssItem(X11) )
| ~ totalorderedP(X3)
| app(app(X9,X3),X10) != X4 ) ) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( ! [X8] :
( ssItem(X8)
=> ( lt(X5,X8)
| ~ leq(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_7]) ).
fof(c_0_10,plain,
! [X169] :
( ~ memberP(nil,X169)
| ~ ssItem(X169) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,negated_conjecture,
! [X267,X268,X269,X273,X274,X275,X276,X277,X278,X279,X280] :
( ( nil != esk50_0
| nil = esk51_0 )
& ( ~ leq(X279,X277)
| app(X280,cons(X279,nil)) != esk50_0
| ~ ssList(X280)
| ~ ssItem(X279)
| app(cons(X277,nil),X278) != esk54_0
| ~ ssList(X278)
| ~ ssItem(X277) )
& ( ~ leq(X273,X275)
| app(cons(X275,nil),X276) != esk50_0
| ~ ssList(X276)
| ~ ssItem(X275)
| app(X274,cons(X273,nil)) != esk53_0
| ~ ssList(X274)
| ~ ssItem(X273) )
& totalorderedP(esk50_0)
& app(app(esk53_0,esk50_0),esk54_0) = esk51_0
& ssList(esk54_0)
& ssList(esk53_0)
& ( ~ ssItem(X267)
| ~ ssList(X268)
| app(app(X268,cons(X267,nil)),X269) != esk48_0
| ~ ssList(X269)
| ~ lt(X267,esk52_3(X267,X268,X269)) )
& ( ~ ssItem(X267)
| ~ ssList(X268)
| app(app(X268,cons(X267,nil)),X269) != esk48_0
| ~ ssList(X269)
| leq(X267,esk52_3(X267,X268,X269)) )
& ( ~ ssItem(X267)
| ~ ssList(X268)
| app(app(X268,cons(X267,nil)),X269) != esk48_0
| ~ ssList(X269)
| memberP(X269,esk52_3(X267,X268,X269)) )
& ( ~ ssItem(X267)
| ~ ssList(X268)
| app(app(X268,cons(X267,nil)),X269) != esk48_0
| ~ ssList(X269)
| memberP(X268,esk52_3(X267,X268,X269)) )
& ( ~ ssItem(X267)
| ~ ssList(X268)
| app(app(X268,cons(X267,nil)),X269) != esk48_0
| ~ ssList(X269)
| ssItem(esk52_3(X267,X268,X269)) )
& nil != esk48_0
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_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_9])])])])])]) ).
cnf(c_0_12,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ ssItem(X2)
| ~ ssList(X1)
| app(app(X1,cons(X2,nil)),X3) != esk48_0
| ~ ssList(X3)
| memberP(X1,esk52_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_15,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(esk52_3(X1,nil,X2))
| ~ ssList(X2)
| app(app(nil,cons(X1,nil)),X2) != esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_16,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk48_0
| ~ ssList(X3)
| ssItem(esk52_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X147] :
( app(nil,X147) = X147
| ~ ssList(X147) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(app(nil,cons(X1,nil)),X2) != esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14])]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X232,X233] :
( cons(X233,X232) = app(cons(X233,nil),X232)
| ~ ssItem(X233)
| ~ ssList(X232) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| app(cons(X1,nil),X2) != esk48_0 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X123,X124] :
( ssList(cons(X124,X123))
| ~ ssItem(X124)
| ~ ssList(X123) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| cons(X1,X2) != esk48_0 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_26,plain,
! [X131] :
( ( ~ ssList(X131)
| nil = X131
| cons(esk45_1(X131),esk44_1(X131)) = X131 )
& ( ~ ssList(X131)
| nil = X131
| ssItem(esk45_1(X131)) )
& ( ~ ssList(X131)
| nil = X131
| ssList(esk44_1(X131)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| cons(X1,X2) != esk48_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14])]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| nil = X1
| cons(esk45_1(X1),esk44_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_30,negated_conjecture,
nil != esk48_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssItem(esk45_1(esk48_0))
| ~ ssList(esk44_1(esk48_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28])]),c_0_29])]),c_0_30]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(esk45_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
~ ssList(esk44_1(esk48_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_29])]),c_0_30]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| nil = X1
| ssList(esk44_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29])]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC236+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n007.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 08:04:50 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.28/0.53 Running first-order theorem proving
% 0.28/0.53 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
% 1.06/0.73 % Version: 3.5.1
% 1.06/0.73 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.06/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.06/0.73 % Starting new_bool_3 with 300s (1) cores
% 1.06/0.73 % Starting new_bool_1 with 300s (1) cores
% 1.06/0.73 % Starting sh5l with 300s (1) cores
% 1.06/0.73 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 604813 completed with status 0
% 1.06/0.73 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.06/0.73 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.06/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.06/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.06/0.73 % No SInE strategy applied
% 1.06/0.73 % Search class: FGHSF-FSLM31-MFFFFFNN
% 1.06/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.06/0.73 % Starting SubtermCWHack with 136s (1) cores
% 1.06/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.06/0.73 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.06/0.73 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 1.06/0.73 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 1.06/0.73 % SAT001_MinMin_p005000_rr_RG with pid 604823 completed with status 0
% 1.06/0.73 % Result found by SAT001_MinMin_p005000_rr_RG
% 1.06/0.73 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.06/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.06/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.06/0.73 % No SInE strategy applied
% 1.06/0.73 % Search class: FGHSF-FSLM31-MFFFFFNN
% 1.06/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.06/0.73 % Starting SubtermCWHack with 136s (1) cores
% 1.06/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.06/0.73 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 1.06/0.73 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 1.06/0.73 % Preprocessing time : 0.006 s
% 1.06/0.73 % Presaturation interreduction done
% 1.06/0.73
% 1.06/0.73 % Proof found!
% 1.06/0.73 % SZS status Theorem
% 1.06/0.73 % SZS output start CNFRefutation
% See solution above
% 1.06/0.73 % Parsed axioms : 96
% 1.06/0.73 % Removed by relevancy pruning/SinE : 0
% 1.06/0.73 % Initial clauses : 209
% 1.06/0.73 % Removed in clause preprocessing : 2
% 1.06/0.73 % Initial clauses in saturation : 207
% 1.06/0.73 % Processed clauses : 683
% 1.06/0.73 % ...of these trivial : 2
% 1.06/0.73 % ...subsumed : 102
% 1.06/0.73 % ...remaining for further processing : 579
% 1.06/0.73 % Other redundant clauses eliminated : 96
% 1.06/0.73 % Clauses deleted for lack of memory : 0
% 1.06/0.73 % Backward-subsumed : 37
% 1.06/0.73 % Backward-rewritten : 2
% 1.06/0.73 % Generated clauses : 1110
% 1.06/0.73 % ...of the previous two non-redundant : 936
% 1.06/0.73 % ...aggressively subsumed : 0
% 1.06/0.73 % Contextual simplify-reflections : 38
% 1.06/0.73 % Paramodulations : 1011
% 1.06/0.73 % Factorizations : 0
% 1.06/0.73 % NegExts : 0
% 1.06/0.73 % Equation resolutions : 101
% 1.06/0.73 % Disequality decompositions : 0
% 1.06/0.73 % Total rewrite steps : 588
% 1.06/0.73 % ...of those cached : 571
% 1.06/0.73 % Propositional unsat checks : 0
% 1.06/0.73 % Propositional check models : 0
% 1.06/0.73 % Propositional check unsatisfiable : 0
% 1.06/0.73 % Propositional clauses : 0
% 1.06/0.73 % Propositional clauses after purity: 0
% 1.06/0.73 % Propositional unsat core size : 0
% 1.06/0.73 % Propositional preprocessing time : 0.000
% 1.06/0.73 % Propositional encoding time : 0.000
% 1.06/0.73 % Propositional solver time : 0.000
% 1.06/0.73 % Success case prop preproc time : 0.000
% 1.06/0.73 % Success case prop encoding time : 0.000
% 1.06/0.73 % Success case prop solver time : 0.000
% 1.06/0.73 % Current number of processed clauses : 317
% 1.06/0.73 % Positive orientable unit clauses : 26
% 1.06/0.73 % Positive unorientable unit clauses: 0
% 1.06/0.73 % Negative unit clauses : 8
% 1.06/0.73 % Non-unit-clauses : 283
% 1.06/0.73 % Current number of unprocessed clauses: 628
% 1.06/0.73 % ...number of literals in the above : 4168
% 1.06/0.73 % Current number of archived formulas : 0
% 1.06/0.73 % Current number of archived clauses : 239
% 1.06/0.73 % Clause-clause subsumption calls (NU) : 31224
% 1.06/0.73 % Rec. Clause-clause subsumption calls : 6605
% 1.06/0.73 % Non-unit clause-clause subsumptions : 142
% 1.06/0.73 % Unit Clause-clause subsumption calls : 558
% 1.06/0.73 % Rewrite failures with RHS unbound : 0
% 1.06/0.73 % BW rewrite match attempts : 2
% 1.06/0.73 % BW rewrite match successes : 2
% 1.06/0.73 % Condensation attempts : 0
% 1.06/0.73 % Condensation successes : 0
% 1.06/0.73 % Termbank termtop insertions : 40732
% 1.06/0.73 % Search garbage collected termcells : 4633
% 1.06/0.73
% 1.06/0.73 % -------------------------------------------------
% 1.06/0.73 % User time : 0.129 s
% 1.06/0.73 % System time : 0.013 s
% 1.06/0.73 % Total time : 0.142 s
% 1.06/0.73 % Maximum resident set size: 4284 pages
% 1.06/0.73
% 1.06/0.73 % -------------------------------------------------
% 1.06/0.73 % User time : 0.545 s
% 1.06/0.73 % System time : 0.045 s
% 1.06/0.73 % Total time : 0.589 s
% 1.06/0.73 % Maximum resident set size: 4608 pages
% 1.06/0.73 % E exiting
%------------------------------------------------------------------------------