%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC008+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:44:30 PM UTC 2026
% Result : Theorem 0.31s 0.73s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 131 ( 32 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 161 ( 57 ~; 52 |; 36 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 23 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ? [X8] :
( equalelemsP(X8)
& segmentP(X8,X3)
& frontsegP(X4,X8)
& neq(X3,X8)
& ssList(X8) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X5,X7) = X1
& app(app(X5,X6),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssList(X5) )
| ~ equalelemsP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
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(c_0_4,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ? [X8] :
( equalelemsP(X8)
& segmentP(X8,X3)
& frontsegP(X4,X8)
& neq(X3,X8)
& ssList(X8) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X5,X7) = X1
& app(app(X5,X6),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssList(X5) )
| ~ equalelemsP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ? [X8] :
( equalelemsP(X8)
& segmentP(X8,X3)
& frontsegP(X4,X8)
& neq(X3,X8)
& ssList(X8) )
| ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X5,X7) = X1
& app(app(X5,X6),X7) = X2
& ssList(X7) )
& ssList(X6) )
& ssList(X5) )
| ~ equalelemsP(X3)
| ~ frontsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
! [X257,X258,X259,X260] :
( ( ~ equalelemsP(X260)
| ~ segmentP(X260,esk50_0)
| ~ frontsegP(esk51_0,X260)
| ~ neq(esk50_0,X260)
| ~ ssList(X260) )
& ( app(X257,X259) != esk48_0
| app(app(X257,X258),X259) != esk49_0
| ~ ssList(X259)
| ~ ssList(X258)
| ~ ssList(X257) )
& equalelemsP(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_5])])])])]) ).
cnf(c_0_7,negated_conjecture,
( app(X1,X3) != esk48_0
| app(app(X1,X2),X3) != esk49_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X229] :
( app(X229,nil) = X229
| ~ ssList(X229) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_11,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X1,X3) != esk50_0
| app(app(X1,X2),X3) != esk51_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_13,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_11,c_0_8]) ).
fof(c_0_16,plain,
! [X22,X23,X25] :
( ( ~ ssList(X22)
| ~ ssList(X23)
| frontsegP(X22,X23)
| app(X23,X25) != X22
| ~ ssList(X25) )
& ( ~ ssList(X22)
| ~ ssList(X23)
| ~ frontsegP(X22,X23)
| app(X23,esk6_2(X22,X23)) = X22 )
& ( ~ ssList(X22)
| ~ ssList(X23)
| ~ frontsegP(X22,X23)
| ssList(esk6_2(X22,X23)) ) ),
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_17,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
( ~ ssList(X1)
| app(app(esk50_0,X1),nil) != esk51_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])])]),c_0_15])]) ).
cnf(c_0_19,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk6_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
frontsegP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(esk50_0,X1))
| app(esk50_0,X1) != esk51_0 ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_24,negated_conjecture,
app(esk50_0,esk6_2(esk51_0,esk50_0)) = esk51_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_15])]) ).
cnf(c_0_25,negated_conjecture,
ssList(esk6_2(esk51_0,esk50_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_15]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC008+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.19/0.46 % Computer : n007.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 07:46:52 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/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
% 0.31/0.73 % Version: 3.5.1
% 0.31/0.73 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.31/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.31/0.73 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.73 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.73 % Starting sh5l with 300s (1) cores
% 0.31/0.73 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 565048 completed with status 0
% 0.31/0.73 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.31/0.73 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.31/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.31/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.73 % No SInE strategy applied
% 0.31/0.73 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.31/0.73 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.73 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.31/0.73 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.31/0.73 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.31/0.73 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.31/0.73 % G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with pid 565057 completed with status 0
% 0.31/0.73 % Result found by G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S
% 0.31/0.73 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.31/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.31/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.73 % No SInE strategy applied
% 0.31/0.73 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.31/0.73 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.73 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.73 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.31/0.73 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.31/0.73 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.31/0.73 % Preprocessing time : 0.007 s
% 0.31/0.73 % Presaturation interreduction done
% 0.31/0.73
% 0.31/0.73 % Proof found!
% 0.31/0.73 % SZS status Theorem
% 0.31/0.73 % SZS output start CNFRefutation
% See solution above
% 0.31/0.73 % Parsed axioms : 96
% 0.31/0.73 % Removed by relevancy pruning/SinE : 0
% 0.31/0.73 % Initial clauses : 200
% 0.31/0.73 % Removed in clause preprocessing : 2
% 0.31/0.73 % Initial clauses in saturation : 198
% 0.31/0.73 % Processed clauses : 428
% 0.31/0.73 % ...of these trivial : 2
% 0.31/0.73 % ...subsumed : 8
% 0.31/0.73 % ...remaining for further processing : 418
% 0.31/0.73 % Other redundant clauses eliminated : 68
% 0.31/0.73 % Clauses deleted for lack of memory : 0
% 0.31/0.73 % Backward-subsumed : 0
% 0.31/0.73 % Backward-rewritten : 0
% 0.31/0.73 % Generated clauses : 651
% 0.31/0.73 % ...of the previous two non-redundant : 545
% 0.31/0.73 % ...aggressively subsumed : 0
% 0.31/0.73 % Contextual simplify-reflections : 3
% 0.31/0.73 % Paramodulations : 580
% 0.31/0.73 % Factorizations : 0
% 0.31/0.73 % NegExts : 0
% 0.31/0.73 % Equation resolutions : 73
% 0.31/0.73 % Disequality decompositions : 0
% 0.31/0.73 % Total rewrite steps : 228
% 0.31/0.73 % ...of those cached : 211
% 0.31/0.73 % Propositional unsat checks : 0
% 0.31/0.73 % Propositional check models : 0
% 0.31/0.73 % Propositional check unsatisfiable : 0
% 0.31/0.73 % Propositional clauses : 0
% 0.31/0.73 % Propositional clauses after purity: 0
% 0.31/0.73 % Propositional unsat core size : 0
% 0.31/0.73 % Propositional preprocessing time : 0.000
% 0.31/0.73 % Propositional encoding time : 0.000
% 0.31/0.73 % Propositional solver time : 0.000
% 0.31/0.73 % Success case prop preproc time : 0.000
% 0.31/0.73 % Success case prop encoding time : 0.000
% 0.31/0.73 % Success case prop solver time : 0.000
% 0.31/0.73 % Current number of processed clauses : 203
% 0.31/0.73 % Positive orientable unit clauses : 22
% 0.31/0.73 % Positive unorientable unit clauses: 0
% 0.31/0.73 % Negative unit clauses : 7
% 0.31/0.73 % Non-unit-clauses : 174
% 0.31/0.73 % Current number of unprocessed clauses: 494
% 0.31/0.73 % ...number of literals in the above : 3346
% 0.31/0.73 % Current number of archived formulas : 0
% 0.31/0.73 % Current number of archived clauses : 192
% 0.31/0.73 % Clause-clause subsumption calls (NU) : 16878
% 0.31/0.73 % Rec. Clause-clause subsumption calls : 3754
% 0.31/0.73 % Non-unit clause-clause subsumptions : 8
% 0.31/0.73 % Unit Clause-clause subsumption calls : 72
% 0.31/0.73 % Rewrite failures with RHS unbound : 0
% 0.31/0.73 % BW rewrite match attempts : 0
% 0.31/0.73 % BW rewrite match successes : 0
% 0.31/0.73 % Condensation attempts : 0
% 0.31/0.73 % Condensation successes : 0
% 0.31/0.73 % Termbank termtop insertions : 33543
% 0.31/0.73 % Search garbage collected termcells : 4321
% 0.31/0.73
% 0.31/0.73 % -------------------------------------------------
% 0.31/0.73 % User time : 0.089 s
% 0.31/0.73 % System time : 0.014 s
% 0.31/0.73 % Total time : 0.103 s
% 0.31/0.73 % Maximum resident set size: 4016 pages
% 0.31/0.73
% 0.31/0.73 % -------------------------------------------------
% 0.31/0.73 % User time : 0.287 s
% 0.31/0.73 % System time : 0.046 s
% 0.31/0.73 % Total time : 0.333 s
% 0.31/0.73 % Maximum resident set size: 4608 pages
% 0.31/0.73 % E exiting
%------------------------------------------------------------------------------