%------------------------------------------------------------------------------
% File : E---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 : n001.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:42:35 PM UTC 2026
% Result : Theorem 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 13 unt; 0 def)
% Number of atoms : 131 ( 33 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(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(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
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])])]) ).
fof(c_0_11,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_12,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,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_15,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_17,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1)
| app(X1,esk6_2(X2,X1)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
frontsegP(esk51_0,esk50_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| ssList(esk6_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != esk50_0
| app(app(X1,X2),nil) != esk51_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_23,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_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_24,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_21,c_0_18]),c_0_20]),c_0_19])]) ).
cnf(c_0_25,negated_conjecture,
app(esk51_0,nil) != esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_20])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC008+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.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 07:54:29 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.15/0.46 % Version: 3.5.1
% 0.15/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 % Starting sh5l with 300s (1) cores
% 0.15/0.46 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2604793 completed with status 0
% 0.15/0.46 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.15/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46 % No SInE strategy applied
% 0.15/0.46 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/0.46 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.46 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.15/0.46 % Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.15/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.15/0.46 % G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with pid 2604808 completed with status 0
% 0.15/0.46 % Result found by G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 0.15/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.46 % No SInE strategy applied
% 0.15/0.46 % Search class: FGHSF-FSLM21-MFFFFFNN
% 0.15/0.46 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.15/0.46 % Starting G-E--_008_C45_F1_PI_AE_Q4_CS_SP_S4d with 136s (1) cores
% 0.15/0.46 % Preprocessing time : 0.002 s
% 0.15/0.46
% 0.15/0.46 % Proof found!
% 0.15/0.46 % SZS status Theorem
% 0.15/0.46 % SZS output start CNFRefutation
% See solution above
% 0.15/0.46 % Parsed axioms : 96
% 0.15/0.46 % Removed by relevancy pruning/SinE : 0
% 0.15/0.46 % Initial clauses : 200
% 0.15/0.46 % Removed in clause preprocessing : 2
% 0.15/0.46 % Initial clauses in saturation : 198
% 0.15/0.46 % Processed clauses : 254
% 0.15/0.46 % ...of these trivial : 2
% 0.15/0.46 % ...subsumed : 15
% 0.15/0.46 % ...remaining for further processing : 237
% 0.15/0.46 % Other redundant clauses eliminated : 69
% 0.15/0.46 % Clauses deleted for lack of memory : 0
% 0.15/0.46 % Backward-subsumed : 5
% 0.15/0.46 % Backward-rewritten : 0
% 0.15/0.46 % Generated clauses : 656
% 0.15/0.46 % ...of the previous two non-redundant : 546
% 0.15/0.46 % ...aggressively subsumed : 0
% 0.15/0.46 % Contextual simplify-reflections : 4
% 0.15/0.46 % Paramodulations : 562
% 0.15/0.46 % Factorizations : 0
% 0.15/0.46 % NegExts : 0
% 0.15/0.46 % Equation resolutions : 94
% 0.15/0.46 % Disequality decompositions : 0
% 0.15/0.46 % Total rewrite steps : 203
% 0.15/0.46 % ...of those cached : 196
% 0.15/0.46 % Propositional unsat checks : 0
% 0.15/0.46 % Propositional check models : 0
% 0.15/0.46 % Propositional check unsatisfiable : 0
% 0.15/0.46 % Propositional clauses : 0
% 0.15/0.46 % Propositional clauses after purity: 0
% 0.15/0.46 % Propositional unsat core size : 0
% 0.15/0.46 % Propositional preprocessing time : 0.000
% 0.15/0.46 % Propositional encoding time : 0.000
% 0.15/0.46 % Propositional solver time : 0.000
% 0.15/0.46 % Success case prop preproc time : 0.000
% 0.15/0.46 % Success case prop encoding time : 0.000
% 0.15/0.46 % Success case prop solver time : 0.000
% 0.15/0.46 % Current number of processed clauses : 226
% 0.15/0.46 % Positive orientable unit clauses : 27
% 0.15/0.46 % Positive unorientable unit clauses: 0
% 0.15/0.46 % Negative unit clauses : 6
% 0.15/0.46 % Non-unit-clauses : 193
% 0.15/0.46 % Current number of unprocessed clauses: 490
% 0.15/0.46 % ...number of literals in the above : 3500
% 0.15/0.46 % Current number of archived formulas : 0
% 0.15/0.46 % Current number of archived clauses : 5
% 0.15/0.46 % Clause-clause subsumption calls (NU) : 7651
% 0.15/0.46 % Rec. Clause-clause subsumption calls : 1967
% 0.15/0.46 % Non-unit clause-clause subsumptions : 20
% 0.15/0.46 % Unit Clause-clause subsumption calls : 91
% 0.15/0.46 % Rewrite failures with RHS unbound : 0
% 0.15/0.46 % BW rewrite match attempts : 0
% 0.15/0.46 % BW rewrite match successes : 0
% 0.15/0.46 % Condensation attempts : 0
% 0.15/0.46 % Condensation successes : 0
% 0.15/0.46 % Termbank termtop insertions : 31083
% 0.15/0.46 % Search garbage collected termcells : 4321
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.027 s
% 0.15/0.46 % System time : 0.007 s
% 0.15/0.46 % Total time : 0.033 s
% 0.15/0.46 % Maximum resident set size: 4272 pages
% 0.15/0.46
% 0.15/0.46 % -------------------------------------------------
% 0.15/0.46 % User time : 0.098 s
% 0.15/0.46 % System time : 0.020 s
% 0.15/0.46 % Total time : 0.118 s
% 0.15/0.46 % Maximum resident set size: 4608 pages
% 0.15/0.46 % E exiting
%------------------------------------------------------------------------------