%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC018+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 : n001.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:42:38 PM UTC 2026
% Result : Theorem 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 12 unt; 0 def)
% Number of atoms : 250 ( 86 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 317 ( 119 ~; 115 |; 48 &)
% ( 4 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 81 ( 0 sgn 48 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X9] :
( frontsegP(X1,X9)
& frontsegP(X2,X9)
& neq(X9,nil)
& ssList(X9) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X3
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X3)
| app(X3,X5) != X4 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax83,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( nil = app(X1,X2)
<=> ( nil = X1
& nil = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax5,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X1,X2)
<=> ? [X3] :
( app(X2,X3) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
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(ax43,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( frontsegP(X1,X2)
=> frontsegP(app(X1,X3),X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax43) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax42,axiom,
! [X1] :
( ssList(X1)
=> frontsegP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ? [X9] :
( frontsegP(X1,X9)
& frontsegP(X2,X9)
& neq(X9,nil)
& ssList(X9) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X3
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X3)
| app(X3,X5) != X4 ) )
| 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)
=> ( ( ( ? [X9] :
( frontsegP(X1,X9)
& frontsegP(X2,X9)
& neq(X9,nil)
& ssList(X9) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X3
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X3)
| app(X3,X5) != X4 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,negated_conjecture,
! [X15,X16,X17,X18] :
( ( nil != esk1_0
| ~ frontsegP(esk1_0,X18)
| ~ frontsegP(esk2_0,X18)
| ~ neq(X18,nil)
| ~ ssList(X18) )
& ( nil != esk1_0
| neq(esk2_0,nil) )
& ( nil = esk2_0
| ~ frontsegP(esk1_0,X18)
| ~ frontsegP(esk2_0,X18)
| ~ neq(X18,nil)
| ~ ssList(X18) )
& ( nil = esk2_0
| neq(esk2_0,nil) )
& ( nil != esk3_0
| nil = esk4_0 )
& ( app(X17,cons(X15,nil)) != esk3_0
| ~ ssList(X17)
| app(cons(X15,nil),X16) != esk5_0
| ~ ssList(X16)
| ~ ssItem(X15) )
& equalelemsP(esk3_0)
& app(esk3_0,esk5_0) = esk4_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_10])])])])])]) ).
fof(c_0_12,plain,
! [X64,X65] :
( ( ~ ssList(X64)
| ~ ssList(X65)
| nil = app(X64,X65)
| nil != X64
| nil != X65 )
& ( ~ ssList(X64)
| ~ ssList(X65)
| nil != app(X64,X65)
| nil = X64 )
& ( ~ ssList(X64)
| ~ ssList(X65)
| nil != app(X64,X65)
| nil = X65 ) ),
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_13,negated_conjecture,
app(esk3_0,esk5_0) = esk4_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,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
app(esk1_0,esk5_0) = esk2_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_20,plain,
! [X66] :
( app(X66,nil) = X66
| ~ ssList(X66) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_21,negated_conjecture,
( esk2_0 != nil
| esk5_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[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_22,plain,
! [X19,X20,X22] :
( ( ~ ssList(X19)
| ~ ssList(X20)
| frontsegP(X19,X20)
| app(X20,X22) != X19
| ~ ssList(X22) )
& ( ~ ssList(X19)
| ~ ssList(X20)
| ~ frontsegP(X19,X20)
| app(X20,esk6_2(X19,X20)) = X19 )
& ( ~ ssList(X19)
| ~ ssList(X20)
| ~ frontsegP(X19,X20)
| ssList(esk6_2(X19,X20)) ) ),
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)],[ax5])])])])])]) ).
fof(c_0_23,plain,
! [X47,X48] :
( ssList(app(X47,X48))
| ~ ssList(X48)
| ~ ssList(X47) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( esk2_0 != nil
| app(esk1_0,nil) = esk2_0 ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_26,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| app(X2,X1) != X3
| ~ ssList(X1)
| frontsegP(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( esk2_0 != nil
| esk1_0 = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_18])]) ).
fof(c_0_29,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_30,negated_conjecture,
( nil != esk1_0
| ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,negated_conjecture,
( nil != esk1_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_26]),c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( esk2_0 != nil
| app(esk2_0,esk5_0) = esk2_0 ),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
fof(c_0_35,plain,
! [X29,X30,X31] :
( frontsegP(app(X29,X31),X30)
| ~ frontsegP(X29,X30)
| ~ ssList(X31)
| ~ ssList(X30)
| ~ ssList(X29) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax43])])])]) ).
fof(c_0_36,plain,
! [X40,X41] :
( ( ~ ssList(X40)
| ~ ssList(X41)
| neq(X40,X41)
| X40 = X41 )
& ( ~ ssList(X40)
| ~ ssList(X41)
| X40 != X41
| ~ neq(X40,X41) ) ),
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_29])])])])]) ).
cnf(c_0_37,negated_conjecture,
( ~ frontsegP(esk2_0,esk2_0)
| ~ frontsegP(esk1_0,esk2_0)
| esk1_0 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_38,negated_conjecture,
( esk2_0 != nil
| frontsegP(esk2_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_32]),c_0_19])]) ).
cnf(c_0_39,plain,
( ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| frontsegP(app(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( ~ frontsegP(esk1_0,X1)
| ~ frontsegP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_43,negated_conjecture,
esk2_0 != nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_28]),c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(esk1_0,X1)
| frontsegP(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_17]),c_0_19]),c_0_18])]) ).
fof(c_0_45,plain,
! [X28] :
( frontsegP(X28,X28)
| ~ ssList(X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax42])])]) ).
cnf(c_0_46,negated_conjecture,
( nil != esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_47,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(esk1_0,X1)
| X1 = nil ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]),c_0_43]),c_0_44]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| frontsegP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( esk1_0 != nil
| esk2_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_15]),c_0_14]) ).
cnf(c_0_50,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_18])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC018+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.08/0.36 % Computer : n001.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 07:55:00 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % new_bool_1 with pid 2606388 completed with status 0
% 0.14/0.45 % Result found by new_bool_1
% 0.14/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % SubtermCWHack with pid 2606390 completed with status 0
% 0.14/0.45 % Result found by SubtermCWHack
% 0.14/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.45 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.14/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.45 % Preprocessing time : 0.002 s
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Theorem
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 96
% 0.14/0.45 % Removed by relevancy pruning/SinE : 66
% 0.14/0.45 % Initial clauses : 64
% 0.14/0.45 % Removed in clause preprocessing : 0
% 0.14/0.45 % Initial clauses in saturation : 64
% 0.14/0.45 % Processed clauses : 261
% 0.14/0.45 % ...of these trivial : 11
% 0.14/0.45 % ...subsumed : 90
% 0.14/0.45 % ...remaining for further processing : 160
% 0.14/0.45 % Other redundant clauses eliminated : 30
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 25
% 0.14/0.45 % Backward-rewritten : 33
% 0.14/0.45 % Generated clauses : 661
% 0.14/0.45 % ...of the previous two non-redundant : 510
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 5
% 0.14/0.45 % Paramodulations : 627
% 0.14/0.45 % Factorizations : 0
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 34
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 703
% 0.14/0.45 % ...of those cached : 682
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 94
% 0.14/0.45 % Positive orientable unit clauses : 18
% 0.14/0.45 % Positive unorientable unit clauses: 0
% 0.14/0.45 % Negative unit clauses : 4
% 0.14/0.45 % Non-unit-clauses : 72
% 0.14/0.45 % Current number of unprocessed clauses: 256
% 0.14/0.45 % ...number of literals in the above : 1304
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 59
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 1244
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 674
% 0.14/0.45 % Non-unit clause-clause subsumptions : 90
% 0.14/0.45 % Unit Clause-clause subsumption calls : 51
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 9
% 0.14/0.45 % BW rewrite match successes : 9
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 15832
% 0.14/0.45 % Search garbage collected termcells : 1858
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.020 s
% 0.14/0.45 % System time : 0.004 s
% 0.14/0.45 % Total time : 0.024 s
% 0.14/0.45 % Maximum resident set size: 3764 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.023 s
% 0.14/0.45 % System time : 0.009 s
% 0.14/0.45 % Total time : 0.032 s
% 0.14/0.45 % Maximum resident set size: 4608 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------