%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC043+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 : n002.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:44:40 PM UTC 2026
% Result : Theorem 0.22s 15.79s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 13 unt; 0 def)
% Number of atoms : 121 ( 61 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 144 ( 46 ~; 43 |; 36 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 25 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X3)
| app(X3,X5) != X4 ) )
| nil = X1
| X1 != X3
| X2 != X4
| nil != X2 ) ) ) ) ),
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(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X3)
| app(X3,X5) != X4 ) )
| nil = X1
| X1 != X3
| X2 != X4
| nil != X2 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X3
& nil != X4 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( lt(X8,X6)
& app(X9,cons(X8,nil)) = X3
& ssList(X9) )
& ssItem(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ strictorderedP(X3)
| app(X3,X5) != X4 ) )
| nil = X1
| X1 != X3
| X2 != X4
| nil != X2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_5,negated_conjecture,
! [X259,X260,X261,X262] :
( ( nil != esk50_0
| nil = esk51_0 )
& ( ~ lt(X261,X259)
| app(X262,cons(X261,nil)) != esk50_0
| ~ ssList(X262)
| ~ ssItem(X261)
| app(cons(X259,nil),X260) != esk52_0
| ~ ssList(X260)
| ~ ssItem(X259) )
& strictorderedP(esk50_0)
& app(esk50_0,esk52_0) = esk51_0
& ssList(esk52_0)
& nil != esk48_0
& esk48_0 = esk50_0
& esk49_0 = esk51_0
& nil = esk49_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_4])])])])]) ).
cnf(c_0_6,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,negated_conjecture,
nil = esk49_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X228,X229] :
( ( ~ ssList(X228)
| ~ ssList(X229)
| nil = app(X228,X229)
| nil != X228
| nil != X229 )
& ( ~ ssList(X228)
| ~ ssList(X229)
| nil != app(X228,X229)
| nil = X228 )
& ( ~ ssList(X228)
| ~ ssList(X229)
| nil != app(X228,X229)
| nil = X229 ) ),
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_9,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
esk51_0 = nil,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != app(X2,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
app(esk50_0,esk52_0) = nil,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_15,plain,
! [X230] :
( app(X230,nil) = X230
| ~ ssList(X230) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_16,negated_conjecture,
esk52_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
nil != esk48_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
app(esk50_0,nil) = nil,
inference(rw,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
esk50_0 != nil,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_13])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC043+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.17/15.66 % Computer : n002.cluster.edu
% 0.17/15.66 % Model : x86_64 x86_64
% 0.17/15.66 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/15.66 % Memory : 8046.5625MB
% 0.17/15.66 % OS : Linux 6.8.0-71-generic
% 0.17/15.66 % CPULimit : 300
% 0.17/15.66 % WCLimit : 300
% 0.17/15.66 % DateTime : Mon Sep 21 07:54:34 UTC 2026
% 0.17/15.67 % CPUTime :
% 0.17/15.67 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/15.72 Running first-order theorem proving
% 0.22/15.72 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.22/15.79 % Version: 3.5.1
% 0.22/15.79 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/15.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/15.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/15.79 % Starting new_bool_3 with 300s (1) cores
% 0.22/15.79 % Starting new_bool_1 with 300s (1) cores
% 0.22/15.79 % Starting sh5l with 300s (1) cores
% 0.22/15.79 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2807785 completed with status 0
% 0.22/15.79 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/15.79 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/15.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/15.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/15.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/15.79 % No SInE strategy applied
% 0.22/15.79 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.22/15.79 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/15.79 % Starting SubtermCWHack with 136s (1) cores
% 0.22/15.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/15.79 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.22/15.79 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.22/15.79 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.22/15.79 % SubtermCWHack with pid 2807789 completed with status 0
% 0.22/15.79 % Result found by SubtermCWHack
% 0.22/15.79 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/15.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/15.79 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/15.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/15.79 % No SInE strategy applied
% 0.22/15.79 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.22/15.79 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/15.79 % Starting SubtermCWHack with 136s (1) cores
% 0.22/15.79 % Preprocessing time : 0.003 s
% 0.22/15.79
% 0.22/15.79 % Proof found!
% 0.22/15.79 % SZS status Theorem
% 0.22/15.79 % SZS output start CNFRefutation
% See solution above
% 0.22/15.79 % Parsed axioms : 96
% 0.22/15.79 % Removed by relevancy pruning/SinE : 0
% 0.22/15.79 % Initial clauses : 203
% 0.22/15.79 % Removed in clause preprocessing : 2
% 0.22/15.79 % Initial clauses in saturation : 201
% 0.22/15.79 % Processed clauses : 156
% 0.22/15.79 % ...of these trivial : 1
% 0.22/15.79 % ...subsumed : 13
% 0.22/15.79 % ...remaining for further processing : 142
% 0.22/15.79 % Other redundant clauses eliminated : 11
% 0.22/15.79 % Clauses deleted for lack of memory : 0
% 0.22/15.79 % Backward-subsumed : 0
% 0.22/15.79 % Backward-rewritten : 5
% 0.22/15.79 % Generated clauses : 58
% 0.22/15.79 % ...of the previous two non-redundant : 40
% 0.22/15.79 % ...aggressively subsumed : 0
% 0.22/15.79 % Contextual simplify-reflections : 7
% 0.22/15.79 % Paramodulations : 48
% 0.22/15.79 % Factorizations : 0
% 0.22/15.79 % NegExts : 0
% 0.22/15.79 % Equation resolutions : 11
% 0.22/15.79 % Disequality decompositions : 0
% 0.22/15.79 % Total rewrite steps : 38
% 0.22/15.79 % ...of those cached : 31
% 0.22/15.79 % Propositional unsat checks : 0
% 0.22/15.79 % Propositional check models : 0
% 0.22/15.79 % Propositional check unsatisfiable : 0
% 0.22/15.79 % Propositional clauses : 0
% 0.22/15.79 % Propositional clauses after purity: 0
% 0.22/15.79 % Propositional unsat core size : 0
% 0.22/15.79 % Propositional preprocessing time : 0.000
% 0.22/15.79 % Propositional encoding time : 0.000
% 0.22/15.79 % Propositional solver time : 0.000
% 0.22/15.79 % Success case prop preproc time : 0.000
% 0.22/15.79 % Success case prop encoding time : 0.000
% 0.22/15.79 % Success case prop solver time : 0.000
% 0.22/15.79 % Current number of processed clauses : 129
% 0.22/15.79 % Positive orientable unit clauses : 21
% 0.22/15.79 % Positive unorientable unit clauses: 0
% 0.22/15.79 % Negative unit clauses : 3
% 0.22/15.79 % Non-unit-clauses : 105
% 0.22/15.79 % Current number of unprocessed clauses: 85
% 0.22/15.79 % ...number of literals in the above : 441
% 0.22/15.79 % Current number of archived formulas : 0
% 0.22/15.79 % Current number of archived clauses : 5
% 0.22/15.79 % Clause-clause subsumption calls (NU) : 1806
% 0.22/15.79 % Rec. Clause-clause subsumption calls : 1468
% 0.22/15.79 % Non-unit clause-clause subsumptions : 18
% 0.22/15.79 % Unit Clause-clause subsumption calls : 1
% 0.22/15.79 % Rewrite failures with RHS unbound : 0
% 0.22/15.79 % BW rewrite match attempts : 4
% 0.22/15.79 % BW rewrite match successes : 4
% 0.22/15.79 % Condensation attempts : 0
% 0.22/15.79 % Condensation successes : 0
% 0.22/15.79 % Termbank termtop insertions : 18155
% 0.22/15.79 % Search garbage collected termcells : 4354
% 0.22/15.79
% 0.22/15.79 % -------------------------------------------------
% 0.22/15.79 % User time : 0.017 s
% 0.22/15.79 % System time : 0.006 s
% 0.22/15.79 % Total time : 0.024 s
% 0.22/15.79 % Maximum resident set size: 4272 pages
% 0.22/15.79
% 0.22/15.79 % -------------------------------------------------
% 0.22/15.79 % User time : 0.092 s
% 0.22/15.79 % System time : 0.024 s
% 0.22/15.79 % Total time : 0.117 s
% 0.22/15.79 % Maximum resident set size: 4864 pages
% 0.22/15.79 % E exiting
%------------------------------------------------------------------------------