%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC373+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 : n010.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:08 PM UTC 2026
% Result : Theorem 0.15s 10.70s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 14 unt; 0 def)
% Number of atoms : 115 ( 24 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 141 ( 56 ~; 51 |; 15 &)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 25 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X2,X1)
| ~ rearsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax6,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( rearsegP(X1,X2)
<=> ? [X3] :
( app(X3,X2) = X1
& ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax6) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X2,X1)
| ~ rearsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X2,X1)
| ~ rearsegP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,negated_conjecture,
( ~ segmentP(esk49_0,esk48_0)
& rearsegP(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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_8,plain,
! [X24,X25,X27] :
( ( ~ ssList(X24)
| ~ ssList(X25)
| rearsegP(X24,X25)
| app(X27,X25) != X24
| ~ ssList(X27) )
& ( ~ ssList(X24)
| ~ ssList(X25)
| ~ rearsegP(X24,X25)
| app(esk7_2(X24,X25),X25) = X24 )
& ( ~ ssList(X24)
| ~ ssList(X25)
| ~ rearsegP(X24,X25)
| ssList(esk7_2(X24,X25)) ) ),
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)],[ax6])])])])])]) ).
cnf(c_0_9,negated_conjecture,
rearsegP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_13,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])])])])])]) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(esk7_2(X1,X2),X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
rearsegP(esk51_0,esk48_0),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| ssList(esk7_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,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_13]) ).
cnf(c_0_20,negated_conjecture,
app(esk7_2(esk51_0,esk48_0),esk48_0) = esk51_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_21,negated_conjecture,
ssList(esk7_2(esk51_0,esk48_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_15]),c_0_16]),c_0_17])]) ).
fof(c_0_22,plain,
! [X227] :
( app(X227,nil) = X227
| ~ ssList(X227) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_23,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X1)
| app(esk51_0,X2) != X1
| segmentP(X1,esk48_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_16]),c_0_21])]) ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_26,negated_conjecture,
~ segmentP(esk49_0,esk48_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(X1)
| esk51_0 != X1
| segmentP(X1,esk48_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_17])]) ).
cnf(c_0_28,negated_conjecture,
~ segmentP(esk51_0,esk48_0),
inference(rw,[status(thm)],[c_0_26,c_0_12]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_27]),c_0_17])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC373+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/10.59 % Computer : n010.cluster.edu
% 0.09/10.59 % Model : x86_64 x86_64
% 0.09/10.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.59 % Memory : 8046.5625MB
% 0.09/10.59 % OS : Linux 6.8.0-71-generic
% 0.09/10.59 % CPULimit : 300
% 0.09/10.59 % WCLimit : 300
% 0.09/10.59 % DateTime : Mon Sep 21 08:19:52 UTC 2026
% 0.09/10.59 % CPUTime :
% 0.09/10.59 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/10.64 Running first-order theorem proving
% 0.15/10.64 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.15/10.70 % Version: 3.5.1
% 0.15/10.70 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/10.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/10.70 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.70 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.70 % Starting sh5l with 300s (1) cores
% 0.15/10.70 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 456913 completed with status 0
% 0.15/10.70 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/10.70 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/10.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/10.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.70 % No SInE strategy applied
% 0.15/10.70 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/10.70 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.70 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/10.70 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.15/10.70 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.15/10.70 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.15/10.70 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 456923 completed with status 0
% 0.15/10.70 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 0.15/10.70 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/10.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/10.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.70 % No SInE strategy applied
% 0.15/10.70 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/10.70 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.70 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/10.70 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.15/10.70 % Preprocessing time : 0.004 s
% 0.15/10.70
% 0.15/10.70 % Proof found!
% 0.15/10.70 % SZS status Theorem
% 0.15/10.70 % SZS output start CNFRefutation
% See solution above
% 0.15/10.70 % Parsed axioms : 96
% 0.15/10.70 % Removed by relevancy pruning/SinE : 0
% 0.15/10.70 % Initial clauses : 198
% 0.15/10.70 % Removed in clause preprocessing : 2
% 0.15/10.70 % Initial clauses in saturation : 196
% 0.15/10.70 % Processed clauses : 247
% 0.15/10.70 % ...of these trivial : 2
% 0.15/10.70 % ...subsumed : 17
% 0.15/10.70 % ...remaining for further processing : 228
% 0.15/10.70 % Other redundant clauses eliminated : 63
% 0.15/10.70 % Clauses deleted for lack of memory : 0
% 0.15/10.70 % Backward-subsumed : 0
% 0.15/10.70 % Backward-rewritten : 0
% 0.15/10.70 % Generated clauses : 565
% 0.15/10.70 % ...of the previous two non-redundant : 464
% 0.15/10.70 % ...aggressively subsumed : 0
% 0.15/10.70 % Contextual simplify-reflections : 2
% 0.15/10.70 % Paramodulations : 477
% 0.15/10.70 % Factorizations : 0
% 0.15/10.70 % NegExts : 0
% 0.15/10.70 % Equation resolutions : 88
% 0.15/10.70 % Disequality decompositions : 0
% 0.15/10.70 % Total rewrite steps : 174
% 0.15/10.70 % ...of those cached : 167
% 0.15/10.70 % Propositional unsat checks : 0
% 0.15/10.70 % Propositional check models : 0
% 0.15/10.70 % Propositional check unsatisfiable : 0
% 0.15/10.70 % Propositional clauses : 0
% 0.15/10.70 % Propositional clauses after purity: 0
% 0.15/10.70 % Propositional unsat core size : 0
% 0.15/10.70 % Propositional preprocessing time : 0.000
% 0.15/10.70 % Propositional encoding time : 0.000
% 0.15/10.70 % Propositional solver time : 0.000
% 0.15/10.70 % Success case prop preproc time : 0.000
% 0.15/10.70 % Success case prop encoding time : 0.000
% 0.15/10.70 % Success case prop solver time : 0.000
% 0.15/10.70 % Current number of processed clauses : 222
% 0.15/10.70 % Positive orientable unit clauses : 26
% 0.15/10.70 % Positive unorientable unit clauses: 0
% 0.15/10.70 % Negative unit clauses : 3
% 0.15/10.70 % Non-unit-clauses : 193
% 0.15/10.70 % Current number of unprocessed clauses: 413
% 0.15/10.70 % ...number of literals in the above : 2910
% 0.15/10.70 % Current number of archived formulas : 0
% 0.15/10.70 % Current number of archived clauses : 0
% 0.15/10.70 % Clause-clause subsumption calls (NU) : 7681
% 0.15/10.70 % Rec. Clause-clause subsumption calls : 2109
% 0.15/10.70 % Non-unit clause-clause subsumptions : 19
% 0.15/10.70 % Unit Clause-clause subsumption calls : 22
% 0.15/10.70 % Rewrite failures with RHS unbound : 0
% 0.15/10.70 % BW rewrite match attempts : 0
% 0.15/10.70 % BW rewrite match successes : 0
% 0.15/10.70 % Condensation attempts : 0
% 0.15/10.70 % Condensation successes : 0
% 0.15/10.70 % Termbank termtop insertions : 28973
% 0.15/10.70 % Search garbage collected termcells : 4191
% 0.15/10.70
% 0.15/10.70 % -------------------------------------------------
% 0.15/10.70 % User time : 0.040 s
% 0.15/10.70 % System time : 0.007 s
% 0.15/10.70 % Total time : 0.046 s
% 0.15/10.70 % Maximum resident set size: 4216 pages
% 0.15/10.70
% 0.15/10.70 % -------------------------------------------------
% 0.15/10.70 % User time : 0.161 s
% 0.15/10.70 % System time : 0.023 s
% 0.15/10.70 % Total time : 0.183 s
% 0.15/10.70 % Maximum resident set size: 4864 pages
% 0.15/10.70 % E exiting
%------------------------------------------------------------------------------