%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC305+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:51 PM UTC 2026
% Result : Theorem 0.23s 0.68s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 48 ( 20 unt; 0 def)
% Number of atoms : 220 ( 33 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 262 ( 90 ~; 88 |; 34 &)
% ( 1 <=>; 49 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn 64 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ~ lt(X7,X6)
| app(app(app(app(X8,cons(X6,nil)),X9),cons(X7,nil)),X10) != X1 ) ) ) ) ) )
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X3)
& frontsegP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ strictorderedP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax33) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax12) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ~ lt(X7,X6)
| app(app(app(app(X8,cons(X6,nil)),X9),cons(X7,nil)),X10) != X1 ) ) ) ) ) )
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X3)
& frontsegP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ strictorderedP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ~ lt(X7,X6)
| app(app(app(app(X8,cons(X6,nil)),X9),cons(X7,nil)),X10) != X1 ) ) ) ) ) )
| ? [X5] :
( strictorderedP(X5)
& segmentP(X5,X3)
& frontsegP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ strictorderedP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,negated_conjecture,
! [X259] :
( lt(esk53_0,esk52_0)
& app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0
& ssList(esk56_0)
& ssList(esk55_0)
& ssList(esk54_0)
& ssItem(esk53_0)
& ssItem(esk52_0)
& ( ~ strictorderedP(X259)
| ~ segmentP(X259,esk50_0)
| ~ frontsegP(esk51_0,X259)
| ~ neq(esk50_0,X259)
| ~ ssList(X259) )
& strictorderedP(esk50_0)
& frontsegP(esk51_0,esk50_0)
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& ssList(esk51_0)
& ssList(esk50_0)
& ssList(esk49_0)
& ssList(esk48_0) ),
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_11,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X226,X227,X228] :
( app(app(X226,X227),X228) = app(X226,app(X227,X228))
| ~ ssList(X228)
| ~ ssList(X227)
| ~ ssList(X226) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_14,negated_conjecture,
app(app(app(app(esk54_0,cons(esk52_0,nil)),esk55_0),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X1,X2),X3) = app(X1,app(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,plain,
! [X115,X116] :
( ssList(cons(X116,X115))
| ~ ssItem(X116)
| ~ ssList(X115) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ssList(cons(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_23,plain,
! [X224,X225] :
( cons(X225,X224) = app(cons(X225,nil),X224)
| ~ ssItem(X225)
| ~ ssList(X224) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_24,negated_conjecture,
app(app(app(esk54_0,app(cons(esk52_0,nil),esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_25,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| cons(X2,X1) = app(cons(X2,nil),X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,nil)),esk56_0) = esk50_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_16]),c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk56_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssList(cons(esk53_0,nil))
| ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_26]),c_0_27])]) ).
cnf(c_0_29,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_30,plain,
! [X134,X135] :
( ssList(app(X134,X135))
| ~ ssList(X135)
| ~ ssList(X134) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ ssList(app(esk54_0,cons(esk52_0,esk55_0)))
| app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_21]),c_0_29])]) ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_33,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
fof(c_0_34,plain,
! [X82,X83,X84,X85,X86,X87] :
( ( ~ ssList(X82)
| strictorderedP(X82)
| ~ lt(esk30_1(X82),esk31_1(X82)) )
& ( ~ ssList(X82)
| strictorderedP(X82)
| app(app(esk32_1(X82),cons(esk30_1(X82),esk33_1(X82))),cons(esk31_1(X82),esk34_1(X82))) = X82 )
& ( ~ ssList(X82)
| strictorderedP(X82)
| ssList(esk34_1(X82)) )
& ( ~ ssList(X82)
| strictorderedP(X82)
| ssList(esk33_1(X82)) )
& ( ~ ssList(X82)
| strictorderedP(X82)
| ssList(esk32_1(X82)) )
& ( ~ ssList(X82)
| strictorderedP(X82)
| ssItem(esk31_1(X82)) )
& ( ~ ssList(X82)
| strictorderedP(X82)
| ssItem(esk30_1(X82)) )
& ( ~ ssList(X82)
| lt(X83,X84)
| app(app(X85,cons(X83,X86)),cons(X84,X87)) != X82
| ~ ssList(X87)
| ~ ssList(X86)
| ~ ssList(X85)
| ~ ssItem(X84)
| ~ ssItem(X83)
| ~ strictorderedP(X82) ) ),
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)],[ax12])])])])])]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(cons(esk52_0,esk55_0))
| app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_17])]) ).
fof(c_0_36,plain,
! [X148,X149] :
( ~ lt(X149,X148)
| ~ lt(X148,X149)
| ~ ssItem(X149)
| ~ ssItem(X148) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ strictorderedP(X1)
| lt(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),app(cons(esk53_0,nil),esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_20]),c_0_16]),c_0_22])]) ).
cnf(c_0_39,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_40,plain,
( ~ lt(X2,X1)
| ~ lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,negated_conjecture,
lt(esk53_0,esk52_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_42,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| lt(X1,X2) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
app(app(esk54_0,cons(esk52_0,esk55_0)),cons(esk53_0,esk56_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_25]),c_0_27]),c_0_29])]) ).
cnf(c_0_44,negated_conjecture,
strictorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_39,c_0_12]) ).
cnf(c_0_46,negated_conjecture,
~ lt(esk52_0,esk53_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_29]),c_0_22])]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_27]),c_0_16]),c_0_17]),c_0_29]),c_0_22])]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC305+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.45 % Computer : n007.cluster.edu
% 0.16/0.45 % Model : x86_64 x86_64
% 0.16/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.45 % Memory : 8046.5625MB
% 0.16/0.45 % OS : Linux 6.8.0-71-generic
% 0.16/0.45 % CPULimit : 300
% 0.16/0.45 % WCLimit : 300
% 0.16/0.45 % DateTime : Mon Sep 21 08:11:52 UTC 2026
% 0.16/0.45 % CPUTime :
% 0.16/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.50 Running first-order theorem proving
% 0.16/0.50 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.23/0.68 % Version: 3.5.1
% 0.23/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.68 % Starting sh5l with 300s (1) cores
% 0.23/0.68 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 617117 completed with status 0
% 0.23/0.68 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.68 % No SInE strategy applied
% 0.23/0.68 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.23/0.68 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.68 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.23/0.68 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.23/0.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.23/0.68 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 617125 completed with status 0
% 0.23/0.68 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.23/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.68 % No SInE strategy applied
% 0.23/0.68 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.23/0.68 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.23/0.68 % Preprocessing time : 0.006 s
% 0.23/0.68 % Presaturation interreduction done
% 0.23/0.68
% 0.23/0.68 % Proof found!
% 0.23/0.68 % SZS status Theorem
% 0.23/0.68 % SZS output start CNFRefutation
% See solution above
% 0.23/0.69 % Parsed axioms : 96
% 0.23/0.69 % Removed by relevancy pruning/SinE : 0
% 0.23/0.69 % Initial clauses : 206
% 0.23/0.69 % Removed in clause preprocessing : 2
% 0.23/0.69 % Initial clauses in saturation : 204
% 0.23/0.69 % Processed clauses : 730
% 0.23/0.69 % ...of these trivial : 4
% 0.23/0.69 % ...subsumed : 120
% 0.23/0.69 % ...remaining for further processing : 606
% 0.23/0.69 % Other redundant clauses eliminated : 74
% 0.23/0.69 % Clauses deleted for lack of memory : 0
% 0.23/0.69 % Backward-subsumed : 16
% 0.23/0.69 % Backward-rewritten : 31
% 0.23/0.69 % Generated clauses : 1506
% 0.23/0.69 % ...of the previous two non-redundant : 1325
% 0.23/0.69 % ...aggressively subsumed : 0
% 0.23/0.69 % Contextual simplify-reflections : 50
% 0.23/0.69 % Paramodulations : 1429
% 0.23/0.69 % Factorizations : 0
% 0.23/0.69 % NegExts : 0
% 0.23/0.69 % Equation resolutions : 79
% 0.23/0.69 % Disequality decompositions : 0
% 0.23/0.69 % Total rewrite steps : 1199
% 0.23/0.69 % ...of those cached : 1148
% 0.23/0.69 % Propositional unsat checks : 0
% 0.23/0.69 % Propositional check models : 0
% 0.23/0.69 % Propositional check unsatisfiable : 0
% 0.23/0.69 % Propositional clauses : 0
% 0.23/0.69 % Propositional clauses after purity: 0
% 0.23/0.69 % Propositional unsat core size : 0
% 0.23/0.69 % Propositional preprocessing time : 0.000
% 0.23/0.69 % Propositional encoding time : 0.000
% 0.23/0.69 % Propositional solver time : 0.000
% 0.23/0.69 % Success case prop preproc time : 0.000
% 0.23/0.69 % Success case prop encoding time : 0.000
% 0.23/0.69 % Success case prop solver time : 0.000
% 0.23/0.69 % Current number of processed clauses : 338
% 0.23/0.69 % Positive orientable unit clauses : 67
% 0.23/0.69 % Positive unorientable unit clauses: 0
% 0.23/0.69 % Negative unit clauses : 5
% 0.23/0.69 % Non-unit-clauses : 266
% 0.23/0.69 % Current number of unprocessed clauses: 959
% 0.23/0.69 % ...number of literals in the above : 5311
% 0.23/0.69 % Current number of archived formulas : 0
% 0.23/0.69 % Current number of archived clauses : 245
% 0.23/0.69 % Clause-clause subsumption calls (NU) : 23491
% 0.23/0.69 % Rec. Clause-clause subsumption calls : 6232
% 0.23/0.69 % Non-unit clause-clause subsumptions : 143
% 0.23/0.69 % Unit Clause-clause subsumption calls : 147
% 0.23/0.69 % Rewrite failures with RHS unbound : 0
% 0.23/0.69 % BW rewrite match attempts : 37
% 0.23/0.69 % BW rewrite match successes : 18
% 0.23/0.69 % Condensation attempts : 0
% 0.23/0.69 % Condensation successes : 0
% 0.23/0.69 % Termbank termtop insertions : 51522
% 0.23/0.69 % Search garbage collected termcells : 4371
% 0.23/0.69
% 0.23/0.69 % -------------------------------------------------
% 0.23/0.69 % User time : 0.133 s
% 0.23/0.69 % System time : 0.010 s
% 0.23/0.69 % Total time : 0.142 s
% 0.23/0.69 % Maximum resident set size: 4020 pages
% 0.23/0.69
% 0.23/0.69 % -------------------------------------------------
% 0.23/0.69 % User time : 0.589 s
% 0.23/0.69 % System time : 0.052 s
% 0.23/0.69 % Total time : 0.642 s
% 0.23/0.69 % Maximum resident set size: 4608 pages
% 0.23/0.69 % E exiting
%------------------------------------------------------------------------------