%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC057+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 : n015.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:48 PM UTC 2026
% Result : Theorem 0.27s 0.65s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 11 unt; 0 def)
% Number of atoms : 254 ( 80 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 326 ( 128 ~; 131 |; 40 &)
% ( 5 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 40 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( ~ frontsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| ( ( ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ? [X4] :
( app(app(X3,X2),X4) = X1
& ssList(X4) )
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
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(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax57,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( ~ frontsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| ( ( ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ( ( ~ frontsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| ( ( ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| X1 != X3
| X2 != X4
| ~ ssList(X4) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,negated_conjecture,
! [X255] :
( ( nil = esk50_0
| frontsegP(esk51_0,esk50_0) )
& ( nil = esk50_0
| neq(esk50_0,nil) )
& ( nil = esk51_0
| frontsegP(esk51_0,esk50_0) )
& ( nil = esk51_0
| neq(esk50_0,nil) )
& ( nil != esk48_0
| ~ segmentP(esk48_0,X255)
| ~ segmentP(esk49_0,X255)
| ~ neq(X255,nil)
| ~ ssList(X255) )
& ( nil != esk48_0
| neq(esk49_0,nil) )
& ( nil = esk49_0
| ~ segmentP(esk48_0,X255)
| ~ segmentP(esk49_0,X255)
| ~ neq(X255,nil)
| ~ ssList(X255) )
& ( nil = esk49_0
| neq(esk49_0,nil) )
& 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_10])])])])])]) ).
fof(c_0_12,plain,
! [X28,X29,X32,X33] :
( ( ~ ssList(X28)
| ~ ssList(X29)
| segmentP(X28,X29)
| app(app(X32,X29),X33) != X28
| ~ ssList(X33)
| ~ ssList(X32) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| app(app(esk8_2(X28,X29),X29),esk9_2(X28,X29)) = X28 )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| ssList(esk9_2(X28,X29)) )
& ( ~ ssList(X28)
| ~ ssList(X29)
| ~ segmentP(X28,X29)
| ssList(esk8_2(X28,X29)) ) ),
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)],[ax7])])])])])]) ).
fof(c_0_13,plain,
! [X135] :
( app(nil,X135) = X135
| ~ ssList(X135) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_14,plain,
! [X20,X21,X23] :
( ( ~ ssList(X20)
| ~ ssList(X21)
| frontsegP(X20,X21)
| app(X21,X23) != X20
| ~ ssList(X23) )
& ( ~ ssList(X20)
| ~ ssList(X21)
| ~ frontsegP(X20,X21)
| app(X21,esk6_2(X20,X21)) = X20 )
& ( ~ ssList(X20)
| ~ ssList(X21)
| ~ frontsegP(X20,X21)
| ssList(esk6_2(X20,X21)) ) ),
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])])])])])]) ).
cnf(c_0_15,negated_conjecture,
( nil = esk50_0
| frontsegP(esk51_0,esk50_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
( ~ segmentP(esk48_0,X1)
| ~ segmentP(esk49_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = esk49_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( nil = esk51_0
| neq(esk50_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( ~ ssList(X4)
| ~ ssList(X3)
| app(app(X1,X3),X2) != X4
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk6_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_25,negated_conjecture,
( frontsegP(esk49_0,esk50_0)
| esk50_0 = nil ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_26,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk49_0,X1)
| ~ segmentP(esk50_0,X1)
| esk49_0 = nil ),
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_30,negated_conjecture,
( neq(esk50_0,nil)
| esk49_0 = nil ),
inference(rw,[status(thm)],[c_0_20,c_0_16]) ).
fof(c_0_31,plain,
! [X189] :
( segmentP(X189,X189)
| ~ ssList(X189) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_32,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X2,X3) != X1
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_33,negated_conjecture,
( esk50_0 = nil
| app(esk50_0,esk6_2(esk49_0,esk50_0)) = esk49_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_34,negated_conjecture,
( ssList(esk6_2(esk49_0,esk50_0))
| esk50_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_27]),c_0_26])]) ).
fof(c_0_35,plain,
! [X225,X226] :
( ( ~ ssList(X225)
| ~ ssList(X226)
| nil = app(X225,X226)
| nil != X225
| nil != X226 )
& ( ~ ssList(X225)
| ~ ssList(X226)
| nil != app(X225,X226)
| nil = X225 )
& ( ~ ssList(X225)
| ~ ssList(X226)
| nil != app(X225,X226)
| nil = X226 ) ),
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_36,negated_conjecture,
( ~ segmentP(esk49_0,esk50_0)
| ~ segmentP(esk50_0,esk50_0)
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_27])]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(X1)
| esk49_0 != X1
| segmentP(X1,esk50_0)
| esk50_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_27])]),c_0_34]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != app(X1,X2)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( ~ segmentP(esk49_0,esk50_0)
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_27])]) ).
cnf(c_0_41,negated_conjecture,
( segmentP(esk49_0,esk50_0)
| esk50_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_26])]) ).
cnf(c_0_42,negated_conjecture,
( esk49_0 != nil
| esk50_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_27])]),c_0_34]) ).
fof(c_0_43,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_44,negated_conjecture,
esk50_0 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
fof(c_0_45,plain,
! [X194] :
( segmentP(X194,nil)
| ~ ssList(X194) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax57])])]) ).
fof(c_0_46,plain,
! [X109,X110] :
( ( ~ ssList(X109)
| ~ ssList(X110)
| neq(X109,X110)
| X109 = X110 )
& ( ~ ssList(X109)
| ~ ssList(X110)
| X109 != X110
| ~ neq(X109,X110) ) ),
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_43])])])])]) ).
cnf(c_0_47,negated_conjecture,
( nil != esk48_0
| neq(esk49_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_48,negated_conjecture,
( ~ segmentP(esk49_0,nil)
| esk49_0 = nil ),
inference(rw,[status(thm)],[c_0_40,c_0_44]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,negated_conjecture,
( esk50_0 != nil
| neq(esk49_0,nil) ),
inference(rw,[status(thm)],[c_0_47,c_0_18]) ).
cnf(c_0_52,negated_conjecture,
esk49_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_26])]) ).
cnf(c_0_53,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_54,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_44])]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC057+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.44 % Computer : n015.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 07:55:21 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.51 Running first-order theorem proving
% 0.25/0.51 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.27/0.65 % Version: 3.5.1
% 0.27/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.65 % Starting sh5l with 300s (1) cores
% 0.27/0.65 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 973687 completed with status 0
% 0.27/0.65 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.27/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.65 % No SInE strategy applied
% 0.27/0.65 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.27/0.65 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.27/0.65 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.27/0.65 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.27/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.27/0.65 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 973696 completed with status 0
% 0.27/0.65 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 0.27/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.65 % No SInE strategy applied
% 0.27/0.65 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.27/0.65 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.27/0.65 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.27/0.65 % Preprocessing time : 0.003 s
% 0.27/0.65
% 0.27/0.65 % Proof found!
% 0.27/0.65 % SZS status Theorem
% 0.27/0.65 % SZS output start CNFRefutation
% See solution above
% 0.27/0.65 % Parsed axioms : 96
% 0.27/0.65 % Removed by relevancy pruning/SinE : 0
% 0.27/0.65 % Initial clauses : 204
% 0.27/0.65 % Removed in clause preprocessing : 2
% 0.27/0.65 % Initial clauses in saturation : 202
% 0.27/0.65 % Processed clauses : 1095
% 0.27/0.65 % ...of these trivial : 7
% 0.27/0.65 % ...subsumed : 582
% 0.27/0.65 % ...remaining for further processing : 506
% 0.27/0.65 % Other redundant clauses eliminated : 104
% 0.27/0.65 % Clauses deleted for lack of memory : 0
% 0.27/0.65 % Backward-subsumed : 18
% 0.27/0.65 % Backward-rewritten : 213
% 0.27/0.65 % Generated clauses : 2623
% 0.27/0.65 % ...of the previous two non-redundant : 2283
% 0.27/0.65 % ...aggressively subsumed : 0
% 0.27/0.65 % Contextual simplify-reflections : 198
% 0.27/0.65 % Paramodulations : 2466
% 0.27/0.65 % Factorizations : 0
% 0.27/0.65 % NegExts : 0
% 0.27/0.65 % Equation resolutions : 157
% 0.27/0.65 % Disequality decompositions : 0
% 0.27/0.65 % Total rewrite steps : 1934
% 0.27/0.65 % ...of those cached : 1917
% 0.27/0.65 % Propositional unsat checks : 0
% 0.27/0.65 % Propositional check models : 0
% 0.27/0.65 % Propositional check unsatisfiable : 0
% 0.27/0.65 % Propositional clauses : 0
% 0.27/0.65 % Propositional clauses after purity: 0
% 0.27/0.65 % Propositional unsat core size : 0
% 0.27/0.65 % Propositional preprocessing time : 0.000
% 0.27/0.65 % Propositional encoding time : 0.000
% 0.27/0.65 % Propositional solver time : 0.000
% 0.27/0.65 % Success case prop preproc time : 0.000
% 0.27/0.65 % Success case prop encoding time : 0.000
% 0.27/0.65 % Success case prop solver time : 0.000
% 0.27/0.65 % Current number of processed clauses : 269
% 0.27/0.65 % Positive orientable unit clauses : 23
% 0.27/0.65 % Positive unorientable unit clauses: 0
% 0.27/0.65 % Negative unit clauses : 2
% 0.27/0.65 % Non-unit-clauses : 244
% 0.27/0.65 % Current number of unprocessed clauses: 1373
% 0.27/0.65 % ...number of literals in the above : 8553
% 0.27/0.65 % Current number of archived formulas : 0
% 0.27/0.65 % Current number of archived clauses : 231
% 0.27/0.65 % Clause-clause subsumption calls (NU) : 35133
% 0.27/0.65 % Rec. Clause-clause subsumption calls : 11641
% 0.27/0.65 % Non-unit clause-clause subsumptions : 797
% 0.27/0.65 % Unit Clause-clause subsumption calls : 212
% 0.27/0.65 % Rewrite failures with RHS unbound : 0
% 0.27/0.65 % BW rewrite match attempts : 4
% 0.27/0.65 % BW rewrite match successes : 4
% 0.27/0.65 % Condensation attempts : 0
% 0.27/0.65 % Condensation successes : 0
% 0.27/0.65 % Termbank termtop insertions : 63044
% 0.27/0.65 % Search garbage collected termcells : 4286
% 0.27/0.65
% 0.27/0.65 % -------------------------------------------------
% 0.27/0.65 % User time : 0.102 s
% 0.27/0.65 % System time : 0.009 s
% 0.27/0.65 % Total time : 0.111 s
% 0.27/0.65 % Maximum resident set size: 4220 pages
% 0.27/0.65
% 0.27/0.65 % -------------------------------------------------
% 0.27/0.65 % User time : 0.450 s
% 0.27/0.65 % System time : 0.035 s
% 0.27/0.65 % Total time : 0.485 s
% 0.27/0.65 % Maximum resident set size: 4864 pages
% 0.27/0.65 % E exiting
%------------------------------------------------------------------------------