%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC332+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:43:58 PM UTC 2026
% Result : Theorem 0.24s 0.75s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 15 unt; 0 def)
% Number of atoms : 128 ( 26 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 143 ( 53 ~; 48 |; 19 &)
% ( 4 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 25 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( equalelemsP(X1)
& segmentP(X2,X1) )
| ( neq(X4,nil)
& ~ singletonP(X3) )
| ~ segmentP(X4,X3)
| 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(ax73,axiom,
! [X1] :
( ssItem(X1)
=> equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax73) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( cons(X2,nil) = X1
& ssItem(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax58,axiom,
! [X1] :
( ssList(X1)
=> ( segmentP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(ax74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax74) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( equalelemsP(X1)
& segmentP(X2,X1) )
| ( neq(X4,nil)
& ~ singletonP(X3) )
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( equalelemsP(X1)
& segmentP(X2,X1) )
| ( neq(X4,nil)
& ~ singletonP(X3) )
| ~ segmentP(X4,X3)
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,negated_conjecture,
( ( ~ equalelemsP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) )
& ( ~ neq(esk4_0,nil)
| singletonP(esk3_0) )
& segmentP(esk4_0,esk3_0)
& 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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_10,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
fof(c_0_11,plain,
! [X20] :
( equalelemsP(cons(X20,nil))
| ~ ssItem(X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax73])])]) ).
fof(c_0_12,plain,
! [X48,X50] :
( ( ~ ssList(X48)
| singletonP(X48)
| cons(X50,nil) != X48
| ~ ssItem(X50) )
& ( ~ ssList(X48)
| ~ singletonP(X48)
| cons(esk13_1(X48),nil) = X48 )
& ( ~ ssList(X48)
| ~ singletonP(X48)
| ssItem(esk13_1(X48)) ) ),
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)],[ax4])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( ~ neq(esk4_0,nil)
| singletonP(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X41,X42] :
( ( ~ ssList(X41)
| ~ ssList(X42)
| neq(X41,X42)
| X41 = X42 )
& ( ~ ssList(X41)
| ~ ssList(X42)
| X41 != X42
| ~ neq(X41,X42) ) ),
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_10])])])])]) ).
cnf(c_0_16,negated_conjecture,
segmentP(esk4_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(esk13_1(X1),nil) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| ssItem(esk13_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( ~ neq(esk4_0,nil)
| singletonP(esk1_0) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| neq(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
( ~ equalelemsP(esk1_0)
| ~ segmentP(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
segmentP(esk4_0,esk1_0),
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| equalelemsP(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( singletonP(esk1_0)
| esk4_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,negated_conjecture,
~ equalelemsP(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
fof(c_0_31,plain,
! [X38] :
( ( ~ ssList(X38)
| segmentP(nil,X38)
| nil != X38 )
& ( ~ ssList(X38)
| nil = X38
| ~ segmentP(nil,X38) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])])]) ).
cnf(c_0_32,negated_conjecture,
esk4_0 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_34,negated_conjecture,
segmentP(nil,esk1_0),
inference(rw,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29])]) ).
cnf(c_0_36,plain,
equalelemsP(nil),
inference(split_conjunct,[status(thm)],[ax74]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC332+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.59 % Computer : n007.cluster.edu
% 0.19/0.59 % Model : x86_64 x86_64
% 0.19/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.59 % Memory : 8046.5625MB
% 0.19/0.59 % OS : Linux 6.8.0-71-generic
% 0.19/0.59 % CPULimit : 300
% 0.19/0.59 % WCLimit : 300
% 0.19/0.59 % DateTime : Mon Sep 21 08:14:06 UTC 2026
% 0.19/0.59 % CPUTime :
% 0.19/0.60 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.68 Running first-order theorem proving
% 0.24/0.68 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.24/0.75 % Version: 3.5.1
% 0.24/0.75 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.75 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.75 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.75 % Starting sh5l with 300s (1) cores
% 0.24/0.75 % new_bool_1 with pid 620418 completed with status 0
% 0.24/0.75 % Result found by new_bool_1
% 0.24/0.75 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.75 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.75 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.75 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.75 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.75 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.24/0.75 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.75 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.75 % SubtermCWHack with pid 620421 completed with status 0
% 0.24/0.75 % Result found by SubtermCWHack
% 0.24/0.75 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.75 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.75 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.75 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.75 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.75 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.75 % Search class: FGHSF-FFMM21-MFFFFFNN
% 0.24/0.75 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.75 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.75 % Preprocessing time : 0.003 s
% 0.24/0.75
% 0.24/0.75 % Proof found!
% 0.24/0.75 % SZS status Theorem
% 0.24/0.75 % SZS output start CNFRefutation
% See solution above
% 0.24/0.75 % Parsed axioms : 96
% 0.24/0.75 % Removed by relevancy pruning/SinE : 65
% 0.24/0.75 % Initial clauses : 60
% 0.24/0.75 % Removed in clause preprocessing : 0
% 0.24/0.75 % Initial clauses in saturation : 60
% 0.24/0.75 % Processed clauses : 48
% 0.24/0.75 % ...of these trivial : 0
% 0.24/0.75 % ...subsumed : 2
% 0.24/0.75 % ...remaining for further processing : 46
% 0.24/0.75 % Other redundant clauses eliminated : 5
% 0.24/0.75 % Clauses deleted for lack of memory : 0
% 0.24/0.75 % Backward-subsumed : 1
% 0.24/0.75 % Backward-rewritten : 11
% 0.24/0.75 % Generated clauses : 14
% 0.24/0.75 % ...of the previous two non-redundant : 12
% 0.24/0.75 % ...aggressively subsumed : 0
% 0.24/0.75 % Contextual simplify-reflections : 1
% 0.24/0.75 % Paramodulations : 10
% 0.24/0.75 % Factorizations : 0
% 0.24/0.75 % NegExts : 0
% 0.24/0.75 % Equation resolutions : 5
% 0.24/0.75 % Disequality decompositions : 0
% 0.24/0.75 % Total rewrite steps : 31
% 0.24/0.75 % ...of those cached : 21
% 0.24/0.75 % Propositional unsat checks : 0
% 0.24/0.75 % Propositional check models : 0
% 0.24/0.75 % Propositional check unsatisfiable : 0
% 0.24/0.75 % Propositional clauses : 0
% 0.24/0.75 % Propositional clauses after purity: 0
% 0.24/0.75 % Propositional unsat core size : 0
% 0.24/0.75 % Propositional preprocessing time : 0.000
% 0.24/0.75 % Propositional encoding time : 0.000
% 0.24/0.75 % Propositional solver time : 0.000
% 0.24/0.75 % Success case prop preproc time : 0.000
% 0.24/0.75 % Success case prop encoding time : 0.000
% 0.24/0.75 % Success case prop solver time : 0.000
% 0.24/0.75 % Current number of processed clauses : 32
% 0.24/0.75 % Positive orientable unit clauses : 8
% 0.24/0.75 % Positive unorientable unit clauses: 0
% 0.24/0.75 % Negative unit clauses : 2
% 0.24/0.75 % Non-unit-clauses : 22
% 0.24/0.75 % Current number of unprocessed clauses: 24
% 0.24/0.75 % ...number of literals in the above : 105
% 0.24/0.75 % Current number of archived formulas : 0
% 0.24/0.75 % Current number of archived clauses : 12
% 0.24/0.75 % Clause-clause subsumption calls (NU) : 45
% 0.24/0.75 % Rec. Clause-clause subsumption calls : 32
% 0.24/0.75 % Non-unit clause-clause subsumptions : 2
% 0.24/0.75 % Unit Clause-clause subsumption calls : 9
% 0.24/0.75 % Rewrite failures with RHS unbound : 0
% 0.24/0.75 % BW rewrite match attempts : 4
% 0.24/0.75 % BW rewrite match successes : 4
% 0.24/0.75 % Condensation attempts : 0
% 0.24/0.75 % Condensation successes : 0
% 0.24/0.75 % Termbank termtop insertions : 5712
% 0.24/0.75 % Search garbage collected termcells : 1683
% 0.24/0.75
% 0.24/0.75 % -------------------------------------------------
% 0.24/0.75 % User time : 0.013 s
% 0.24/0.75 % System time : 0.004 s
% 0.24/0.75 % Total time : 0.017 s
% 0.24/0.75 % Maximum resident set size: 4012 pages
% 0.24/0.75
% 0.24/0.75 % -------------------------------------------------
% 0.24/0.75 % User time : 0.018 s
% 0.24/0.75 % System time : 0.011 s
% 0.24/0.75 % Total time : 0.029 s
% 0.24/0.75 % Maximum resident set size: 4864 pages
% 0.24/0.75 % E exiting
%------------------------------------------------------------------------------