%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC076+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 : n013.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:53 PM UTC 2026
% Result : Theorem 0.19s 0.69s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 188 ( 59 equ)
% Maximal formula atoms : 28 ( 6 avg)
% Number of connectives : 232 ( 75 ~; 73 |; 54 &)
% ( 2 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn 41 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X1
& nil = X2 )
| ( nil = X3
& nil != X4 )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( ? [X11] :
( ? [X12] :
( ? [X13] :
( app(X13,cons(X11,nil)) = X3
& ssList(X13) )
& app(cons(X11,nil),X12) = X7
& ssList(X12) )
& ssItem(X11) )
| ? [X8] :
( ? [X9] :
( ? [X10] :
( app(cons(X8,nil),X10) = X3
& ssList(X10) )
& app(X9,cons(X8,nil)) = X6
& ssList(X9) )
& ssItem(X8) )
| ~ equalelemsP(X3)
| app(app(X6,X3),X7) != X4 ) ) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax56,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( segmentP(X1,X2)
=> segmentP(app(app(X3,X1),X4),X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax55,axiom,
! [X1] :
( ssList(X1)
=> segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( nil = X1
& nil = X2 )
| ( nil = X3
& nil != X4 )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( ? [X11] :
( ? [X12] :
( ? [X13] :
( app(X13,cons(X11,nil)) = X3
& ssList(X13) )
& app(cons(X11,nil),X12) = X7
& ssList(X12) )
& ssItem(X11) )
| ? [X8] :
( ? [X9] :
( ? [X10] :
( app(cons(X8,nil),X10) = X3
& ssList(X10) )
& app(X9,cons(X8,nil)) = X6
& ssList(X9) )
& ssItem(X8) )
| ~ equalelemsP(X3)
| app(app(X6,X3),X7) != X4 ) ) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| 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)
=> ( ( nil = X1
& nil = X2 )
| ( nil = X3
& nil != X4 )
| ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( ? [X11] :
( ? [X12] :
( ? [X13] :
( app(X13,cons(X11,nil)) = X3
& ssList(X13) )
& app(cons(X11,nil),X12) = X7
& ssList(X12) )
& ssItem(X11) )
| ? [X8] :
( ? [X9] :
( ? [X10] :
( app(cons(X8,nil),X10) = X3
& ssList(X10) )
& app(X9,cons(X8,nil)) = X6
& ssList(X9) )
& ssItem(X8) )
| ~ equalelemsP(X3)
| app(app(X6,X3),X7) != X4 ) ) )
| ? [X5] :
( segmentP(X1,X5)
& segmentP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,negated_conjecture,
! [X18,X21,X22,X23,X24,X25,X26] :
( ( nil != esk1_0
| nil != esk2_0 )
& ( nil != esk3_0
| nil = esk4_0 )
& ( app(X26,cons(X24,nil)) != esk3_0
| ~ ssList(X26)
| app(cons(X24,nil),X25) != esk6_0
| ~ ssList(X25)
| ~ ssItem(X24) )
& ( app(cons(X21,nil),X23) != esk3_0
| ~ ssList(X23)
| app(X22,cons(X21,nil)) != esk5_0
| ~ ssList(X22)
| ~ ssItem(X21) )
& equalelemsP(esk3_0)
& app(app(esk5_0,esk3_0),esk6_0) = esk4_0
& ssList(esk6_0)
& ssList(esk5_0)
& ( ~ segmentP(esk1_0,X18)
| ~ segmentP(esk2_0,X18)
| ~ neq(X18,nil)
| ~ ssList(X18) )
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_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_6])])])])]) ).
fof(c_0_8,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_9,negated_conjecture,
( ~ segmentP(esk1_0,X1)
| ~ segmentP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X92,X93] :
( ( ~ ssList(X92)
| ~ ssList(X93)
| neq(X92,X93)
| X92 = X93 )
& ( ~ ssList(X92)
| ~ ssList(X93)
| X92 != X93
| ~ neq(X92,X93) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
fof(c_0_13,plain,
! [X84,X85,X86,X87] :
( segmentP(app(app(X86,X84),X87),X85)
| ~ segmentP(X84,X85)
| ~ ssList(X87)
| ~ ssList(X86)
| ~ ssList(X85)
| ~ ssList(X84) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax56])])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(esk3_0,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_17,plain,
( ~ segmentP(X1,X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X3,X1),X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
app(app(esk5_0,esk3_0),esk6_0) = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
ssList(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk4_0,X1)
| ~ segmentP(esk3_0,X1)
| X1 = nil ),
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,
( ~ ssList(X1)
| ~ segmentP(esk3_0,X1)
| segmentP(esk4_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[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]),c_0_21])]) ).
fof(c_0_24,plain,
! [X83] :
( segmentP(X83,X83)
| ~ ssList(X83) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])])]) ).
cnf(c_0_25,negated_conjecture,
( nil != esk1_0
| nil != esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,negated_conjecture,
( nil != esk3_0
| nil = esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(esk3_0,X1)
| X1 = nil ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
esk3_0 != nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_10]),c_0_11]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC076+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.12/0.61 % Computer : n013.cluster.edu
% 0.12/0.61 % Model : x86_64 x86_64
% 0.12/0.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.61 % Memory : 8046.5625MB
% 0.12/0.61 % OS : Linux 6.8.0-71-generic
% 0.12/0.61 % CPULimit : 300
% 0.12/0.61 % WCLimit : 300
% 0.12/0.61 % DateTime : Mon Sep 21 07:52:52 UTC 2026
% 0.12/0.62 % CPUTime :
% 0.12/0.62 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.66 Running first-order theorem proving
% 0.19/0.66 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.19/0.69 % Version: 3.5.1
% 0.19/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.69 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.69 % Starting sh5l with 300s (1) cores
% 0.19/0.69 % new_bool_3 with pid 307058 completed with status 0
% 0.19/0.69 % Result found by new_bool_3
% 0.19/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.69 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.69 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.69 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.69 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.69 % Starting SubtermCWHack with 31s (1) cores
% 0.19/0.69 % SubtermCWHack with pid 307064 completed with status 0
% 0.19/0.69 % Result found by SubtermCWHack
% 0.19/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.69 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.69 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.69 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.19/0.69 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.69 % Starting SubtermCWHack with 31s (1) cores
% 0.19/0.69 % Preprocessing time : 0.002 s
% 0.19/0.69
% 0.19/0.69 % Proof found!
% 0.19/0.69 % SZS status Theorem
% 0.19/0.69 % SZS output start CNFRefutation
% See solution above
% 0.19/0.69 % Parsed axioms : 96
% 0.19/0.69 % Removed by relevancy pruning/SinE : 67
% 0.19/0.69 % Initial clauses : 62
% 0.19/0.69 % Removed in clause preprocessing : 0
% 0.19/0.69 % Initial clauses in saturation : 62
% 0.19/0.69 % Processed clauses : 145
% 0.19/0.69 % ...of these trivial : 1
% 0.19/0.69 % ...subsumed : 35
% 0.19/0.69 % ...remaining for further processing : 109
% 0.19/0.69 % Other redundant clauses eliminated : 14
% 0.19/0.69 % Clauses deleted for lack of memory : 0
% 0.19/0.69 % Backward-subsumed : 14
% 0.19/0.69 % Backward-rewritten : 3
% 0.19/0.69 % Generated clauses : 338
% 0.19/0.69 % ...of the previous two non-redundant : 259
% 0.19/0.69 % ...aggressively subsumed : 0
% 0.19/0.69 % Contextual simplify-reflections : 7
% 0.19/0.69 % Paramodulations : 321
% 0.19/0.69 % Factorizations : 0
% 0.19/0.69 % NegExts : 0
% 0.19/0.69 % Equation resolutions : 18
% 0.19/0.69 % Disequality decompositions : 0
% 0.19/0.69 % Total rewrite steps : 298
% 0.19/0.69 % ...of those cached : 289
% 0.19/0.69 % Propositional unsat checks : 0
% 0.19/0.69 % Propositional check models : 0
% 0.19/0.69 % Propositional check unsatisfiable : 0
% 0.19/0.69 % Propositional clauses : 0
% 0.19/0.69 % Propositional clauses after purity: 0
% 0.19/0.69 % Propositional unsat core size : 0
% 0.19/0.69 % Propositional preprocessing time : 0.000
% 0.19/0.69 % Propositional encoding time : 0.000
% 0.19/0.69 % Propositional solver time : 0.000
% 0.19/0.69 % Success case prop preproc time : 0.000
% 0.19/0.69 % Success case prop encoding time : 0.000
% 0.19/0.69 % Success case prop solver time : 0.000
% 0.19/0.69 % Current number of processed clauses : 87
% 0.19/0.69 % Positive orientable unit clauses : 16
% 0.19/0.69 % Positive unorientable unit clauses: 0
% 0.19/0.69 % Negative unit clauses : 5
% 0.19/0.69 % Non-unit-clauses : 66
% 0.19/0.69 % Current number of unprocessed clauses: 151
% 0.19/0.69 % ...number of literals in the above : 800
% 0.19/0.69 % Current number of archived formulas : 0
% 0.19/0.69 % Current number of archived clauses : 17
% 0.19/0.69 % Clause-clause subsumption calls (NU) : 651
% 0.19/0.69 % Rec. Clause-clause subsumption calls : 313
% 0.19/0.69 % Non-unit clause-clause subsumptions : 46
% 0.19/0.69 % Unit Clause-clause subsumption calls : 30
% 0.19/0.69 % Rewrite failures with RHS unbound : 0
% 0.19/0.69 % BW rewrite match attempts : 3
% 0.19/0.69 % BW rewrite match successes : 3
% 0.19/0.69 % Condensation attempts : 0
% 0.19/0.69 % Condensation successes : 0
% 0.19/0.69 % Termbank termtop insertions : 11494
% 0.19/0.69 % Search garbage collected termcells : 1883
% 0.19/0.69
% 0.19/0.69 % -------------------------------------------------
% 0.19/0.69 % User time : 0.016 s
% 0.19/0.69 % System time : 0.003 s
% 0.19/0.69 % Total time : 0.019 s
% 0.19/0.69 % Maximum resident set size: 3764 pages
% 0.19/0.69
% 0.19/0.69 % -------------------------------------------------
% 0.19/0.69 % User time : 0.018 s
% 0.19/0.69 % System time : 0.006 s
% 0.19/0.69 % Total time : 0.024 s
% 0.19/0.69 % Maximum resident set size: 4608 pages
% 0.19/0.69 % E exiting
%------------------------------------------------------------------------------