%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC333+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:45:54 PM UTC 2026
% Result : Theorem 0.25s 0.58s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 23 ( 12 unt; 0 def)
% Number of atoms : 125 ( 10 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 163 ( 61 ~; 56 |; 31 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 21 ( 0 sgn 16 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( totalorderedP(X1)
& segmentP(X2,X1)
& ! [X6] :
( ssList(X6)
=> ( ~ totalorderedP(X6)
| ~ segmentP(X6,X1)
| ~ segmentP(X2,X6)
| ~ neq(X1,X6) ) ) )
| ? [X5] :
( totalorderedP(X5)
& segmentP(X5,X3)
& segmentP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ totalorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(c_0_1,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( totalorderedP(X1)
& segmentP(X2,X1)
& ! [X6] :
( ssList(X6)
=> ( ~ totalorderedP(X6)
| ~ segmentP(X6,X1)
| ~ segmentP(X2,X6)
| ~ neq(X1,X6) ) ) )
| ? [X5] :
( totalorderedP(X5)
& segmentP(X5,X3)
& segmentP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ totalorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( totalorderedP(X1)
& segmentP(X2,X1)
& ! [X6] :
( ssList(X6)
=> ( ~ totalorderedP(X6)
| ~ segmentP(X6,X1)
| ~ segmentP(X2,X6)
| ~ neq(X1,X6) ) ) )
| ? [X5] :
( totalorderedP(X5)
& segmentP(X5,X3)
& segmentP(X4,X5)
& neq(X3,X5)
& ssList(X5) )
| ~ totalorderedP(X3)
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
! [X255] :
( ( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0)
| totalorderedP(esk52_0) )
& ( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0)
| segmentP(esk52_0,esk48_0) )
& ( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0)
| segmentP(esk49_0,esk52_0) )
& ( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0)
| neq(esk48_0,esk52_0) )
& ( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0)
| ssList(esk52_0) )
& ( ~ totalorderedP(X255)
| ~ segmentP(X255,esk50_0)
| ~ segmentP(esk51_0,X255)
| ~ neq(esk50_0,X255)
| ~ ssList(X255) )
& totalorderedP(esk50_0)
& segmentP(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(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_2])])])])])]) ).
cnf(c_0_4,negated_conjecture,
totalorderedP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
segmentP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( ~ totalorderedP(X1)
| ~ segmentP(X1,esk50_0)
| ~ segmentP(esk51_0,X1)
| ~ neq(esk50_0,X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0)
| neq(esk48_0,esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
totalorderedP(esk48_0),
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_11,negated_conjecture,
segmentP(esk49_0,esk48_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0)
| totalorderedP(esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_13,negated_conjecture,
( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0)
| segmentP(esk52_0,esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0)
| segmentP(esk49_0,esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,negated_conjecture,
( ~ totalorderedP(esk48_0)
| ~ segmentP(esk49_0,esk48_0)
| ssList(esk52_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(esk48_0,X1)
| ~ ssList(X1)
| ~ segmentP(esk49_0,X1)
| ~ segmentP(X1,esk48_0)
| ~ totalorderedP(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_5]),c_0_5]),c_0_7]) ).
cnf(c_0_17,negated_conjecture,
neq(esk48_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_18,negated_conjecture,
totalorderedP(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_11])]) ).
cnf(c_0_19,negated_conjecture,
segmentP(esk52_0,esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_10]),c_0_11])]) ).
cnf(c_0_20,negated_conjecture,
segmentP(esk49_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_10]),c_0_11])]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_10]),c_0_11])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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]),c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC333+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 % Computer : n002.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Mon Sep 21 08:19:32 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.42 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.50 Running first-order theorem proving
% 0.16/0.50 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.25/0.58 % Version: 3.5.1
% 0.25/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.58 % Starting sh5l with 300s (1) cores
% 0.25/0.58 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2851618 completed with status 0
% 0.25/0.58 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.25/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.58 % No SInE strategy applied
% 0.25/0.58 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.25/0.58 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.25/0.58 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.25/0.58 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.25/0.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.25/0.58 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 2851625 completed with status 0
% 0.25/0.58 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 0.25/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.58 % No SInE strategy applied
% 0.25/0.58 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.25/0.58 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.25/0.58 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.25/0.58 % Preprocessing time : 0.006 s
% 0.25/0.58
% 0.25/0.58 % Proof found!
% 0.25/0.58 % SZS status Theorem
% 0.25/0.58 % SZS output start CNFRefutation
% See solution above
% 0.25/0.58 % Parsed axioms : 96
% 0.25/0.58 % Removed by relevancy pruning/SinE : 0
% 0.25/0.58 % Initial clauses : 204
% 0.25/0.58 % Removed in clause preprocessing : 2
% 0.25/0.58 % Initial clauses in saturation : 202
% 0.25/0.58 % Processed clauses : 30
% 0.25/0.58 % ...of these trivial : 2
% 0.25/0.58 % ...subsumed : 0
% 0.25/0.58 % ...remaining for further processing : 28
% 0.25/0.58 % Other redundant clauses eliminated : 0
% 0.25/0.58 % Clauses deleted for lack of memory : 0
% 0.25/0.58 % Backward-subsumed : 0
% 0.25/0.58 % Backward-rewritten : 0
% 0.25/0.58 % Generated clauses : 1
% 0.25/0.58 % ...of the previous two non-redundant : 0
% 0.25/0.58 % ...aggressively subsumed : 0
% 0.25/0.58 % Contextual simplify-reflections : 0
% 0.25/0.58 % Paramodulations : 1
% 0.25/0.58 % Factorizations : 0
% 0.25/0.58 % NegExts : 0
% 0.25/0.58 % Equation resolutions : 0
% 0.25/0.58 % Disequality decompositions : 0
% 0.25/0.58 % Total rewrite steps : 24
% 0.25/0.58 % ...of those cached : 14
% 0.25/0.58 % Propositional unsat checks : 0
% 0.25/0.58 % Propositional check models : 0
% 0.25/0.58 % Propositional check unsatisfiable : 0
% 0.25/0.58 % Propositional clauses : 0
% 0.25/0.58 % Propositional clauses after purity: 0
% 0.25/0.58 % Propositional unsat core size : 0
% 0.25/0.58 % Propositional preprocessing time : 0.000
% 0.25/0.58 % Propositional encoding time : 0.000
% 0.25/0.58 % Propositional solver time : 0.000
% 0.25/0.58 % Success case prop preproc time : 0.000
% 0.25/0.58 % Success case prop encoding time : 0.000
% 0.25/0.58 % Success case prop solver time : 0.000
% 0.25/0.58 % Current number of processed clauses : 28
% 0.25/0.58 % Positive orientable unit clauses : 21
% 0.25/0.58 % Positive unorientable unit clauses: 0
% 0.25/0.58 % Negative unit clauses : 2
% 0.25/0.58 % Non-unit-clauses : 5
% 0.25/0.58 % Current number of unprocessed clauses: 172
% 0.25/0.58 % ...number of literals in the above : 685
% 0.25/0.58 % Current number of archived formulas : 0
% 0.25/0.58 % Current number of archived clauses : 0
% 0.25/0.58 % Clause-clause subsumption calls (NU) : 6
% 0.25/0.58 % Rec. Clause-clause subsumption calls : 2
% 0.25/0.58 % Non-unit clause-clause subsumptions : 0
% 0.25/0.58 % Unit Clause-clause subsumption calls : 0
% 0.25/0.58 % Rewrite failures with RHS unbound : 0
% 0.25/0.58 % BW rewrite match attempts : 0
% 0.25/0.58 % BW rewrite match successes : 0
% 0.25/0.58 % Condensation attempts : 0
% 0.25/0.58 % Condensation successes : 0
% 0.25/0.58 % Termbank termtop insertions : 16568
% 0.25/0.58 % Search garbage collected termcells : 4353
% 0.25/0.58
% 0.25/0.58 % -------------------------------------------------
% 0.25/0.58 % User time : 0.028 s
% 0.25/0.58 % System time : 0.006 s
% 0.25/0.58 % Total time : 0.034 s
% 0.25/0.58 % Maximum resident set size: 4016 pages
% 0.25/0.58
% 0.25/0.58 % -------------------------------------------------
% 0.25/0.58 % User time : 0.058 s
% 0.25/0.58 % System time : 0.025 s
% 0.25/0.58 % Total time : 0.083 s
% 0.25/0.58 % Maximum resident set size: 4608 pages
% 0.25/0.58 % E exiting
%------------------------------------------------------------------------------