%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC048+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 : 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:42:46 PM UTC 2026
% Result : Theorem 0.11s 0.46s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 10 unt; 0 def)
% Number of atoms : 171 ( 54 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 205 ( 75 ~; 77 |; 30 &)
% ( 2 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 39 ( 0 sgn 27 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ~ rearsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| ( ( ? [X5] :
( rearsegP(X1,X5)
& rearsegP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax48,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( rearsegP(X2,X1)
& rearsegP(X1,X2) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax48) ).
fof(ax49,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax49) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax51,axiom,
! [X1] :
( ssList(X1)
=> rearsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax51) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ~ rearsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| ( ( ? [X5] :
( rearsegP(X1,X5)
& rearsegP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ~ rearsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| ( ( ? [X5] :
( rearsegP(X1,X5)
& rearsegP(X2,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X2,nil) )
& ( nil = X1
| nil != X2 ) )
| X1 != X3
| X2 != X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,negated_conjecture,
! [X11] :
( ( nil = esk3_0
| rearsegP(esk4_0,esk3_0) )
& ( nil = esk3_0
| neq(esk3_0,nil) )
& ( nil = esk4_0
| rearsegP(esk4_0,esk3_0) )
& ( nil = esk4_0
| neq(esk3_0,nil) )
& ( nil != esk1_0
| ~ rearsegP(esk1_0,X11)
| ~ rearsegP(esk2_0,X11)
| ~ neq(X11,nil)
| ~ ssList(X11) )
& ( nil != esk1_0
| neq(esk2_0,nil) )
& ( nil = esk2_0
| ~ rearsegP(esk1_0,X11)
| ~ rearsegP(esk2_0,X11)
| ~ neq(X11,nil)
| ~ ssList(X11) )
& ( nil = esk2_0
| neq(esk2_0,nil) )
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_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_7])])])])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ rearsegP(esk1_0,X1)
| ~ rearsegP(esk2_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( nil = esk4_0
| neq(esk3_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( nil = esk4_0
| rearsegP(esk4_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X19,X20] :
( X19 = X20
| ~ rearsegP(X20,X19)
| ~ rearsegP(X19,X20)
| ~ ssList(X20)
| ~ ssList(X19) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax48])])])]) ).
cnf(c_0_15,negated_conjecture,
( nil = esk3_0
| rearsegP(esk4_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(X1,nil)
| ~ ssList(X1)
| ~ rearsegP(esk2_0,X1)
| ~ rearsegP(esk3_0,X1)
| esk2_0 = nil ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( neq(esk3_0,nil)
| esk2_0 = nil ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
( rearsegP(esk2_0,esk3_0)
| esk2_0 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_12]),c_0_12]) ).
fof(c_0_20,plain,
! [X21] :
( rearsegP(X21,X21)
| ~ ssList(X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax49])])]) ).
cnf(c_0_21,plain,
( ~ rearsegP(X2,X1)
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( rearsegP(esk2_0,esk3_0)
| esk3_0 = nil ),
inference(rw,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
( ~ rearsegP(esk3_0,esk3_0)
| esk2_0 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_19]) ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| rearsegP(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_26,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_27,negated_conjecture,
( ~ rearsegP(esk3_0,esk2_0)
| esk3_0 = esk2_0
| esk3_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_18])]) ).
cnf(c_0_28,negated_conjecture,
esk2_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_18])]) ).
fof(c_0_29,plain,
! [X25] :
( rearsegP(X25,nil)
| ~ ssList(X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax51])])]) ).
fof(c_0_30,plain,
! [X29,X30] :
( ( ~ ssList(X29)
| ~ ssList(X30)
| neq(X29,X30)
| X29 = X30 )
& ( ~ ssList(X29)
| ~ ssList(X30)
| X29 != X30
| ~ neq(X29,X30) ) ),
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_26])])])])]) ).
cnf(c_0_31,negated_conjecture,
( nil != esk1_0
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,negated_conjecture,
( ~ rearsegP(esk3_0,nil)
| esk3_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28])]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( esk3_0 != nil
| neq(esk2_0,nil) ),
inference(rw,[status(thm)],[c_0_31,c_0_10]) ).
cnf(c_0_36,negated_conjecture,
esk3_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_18])]) ).
cnf(c_0_37,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_28]),c_0_36])]) ).
cnf(c_0_39,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC048+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n007.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 07:49:20 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.11/0.46 % Version: 3.5.1
% 0.11/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.46 % Starting sh5l with 300s (1) cores
% 0.11/0.46 % new_bool_3 with pid 572381 completed with status 0
% 0.11/0.46 % Result found by new_bool_3
% 0.11/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.46 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.11/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.46 % SubtermCWHack with pid 572384 completed with status 0
% 0.11/0.46 % Result found by SubtermCWHack
% 0.11/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.46 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.11/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.46 % Preprocessing time : 0.002 s
% 0.11/0.46
% 0.11/0.46 % Proof found!
% 0.11/0.46 % SZS status Theorem
% 0.11/0.46 % SZS output start CNFRefutation
% See solution above
% 0.11/0.46 % Parsed axioms : 96
% 0.11/0.46 % Removed by relevancy pruning/SinE : 70
% 0.11/0.46 % Initial clauses : 51
% 0.11/0.46 % Removed in clause preprocessing : 0
% 0.11/0.46 % Initial clauses in saturation : 51
% 0.11/0.46 % Processed clauses : 61
% 0.11/0.46 % ...of these trivial : 0
% 0.11/0.46 % ...subsumed : 4
% 0.11/0.46 % ...remaining for further processing : 57
% 0.11/0.46 % Other redundant clauses eliminated : 8
% 0.11/0.46 % Clauses deleted for lack of memory : 0
% 0.11/0.46 % Backward-subsumed : 0
% 0.11/0.46 % Backward-rewritten : 17
% 0.11/0.46 % Generated clauses : 47
% 0.11/0.46 % ...of the previous two non-redundant : 40
% 0.11/0.46 % ...aggressively subsumed : 0
% 0.11/0.46 % Contextual simplify-reflections : 2
% 0.11/0.46 % Paramodulations : 39
% 0.11/0.46 % Factorizations : 0
% 0.11/0.46 % NegExts : 0
% 0.11/0.46 % Equation resolutions : 9
% 0.11/0.46 % Disequality decompositions : 0
% 0.11/0.46 % Total rewrite steps : 68
% 0.11/0.46 % ...of those cached : 60
% 0.11/0.46 % Propositional unsat checks : 0
% 0.11/0.46 % Propositional check models : 0
% 0.11/0.46 % Propositional check unsatisfiable : 0
% 0.11/0.46 % Propositional clauses : 0
% 0.11/0.46 % Propositional clauses after purity: 0
% 0.11/0.46 % Propositional unsat core size : 0
% 0.11/0.46 % Propositional preprocessing time : 0.000
% 0.11/0.46 % Propositional encoding time : 0.000
% 0.11/0.46 % Propositional solver time : 0.000
% 0.11/0.46 % Success case prop preproc time : 0.000
% 0.11/0.46 % Success case prop encoding time : 0.000
% 0.11/0.46 % Success case prop solver time : 0.000
% 0.11/0.46 % Current number of processed clauses : 35
% 0.11/0.46 % Positive orientable unit clauses : 10
% 0.11/0.46 % Positive unorientable unit clauses: 0
% 0.11/0.46 % Negative unit clauses : 1
% 0.11/0.46 % Non-unit-clauses : 24
% 0.11/0.46 % Current number of unprocessed clauses: 29
% 0.11/0.46 % ...number of literals in the above : 134
% 0.11/0.46 % Current number of archived formulas : 0
% 0.11/0.46 % Current number of archived clauses : 17
% 0.11/0.46 % Clause-clause subsumption calls (NU) : 184
% 0.11/0.46 % Rec. Clause-clause subsumption calls : 83
% 0.11/0.46 % Non-unit clause-clause subsumptions : 6
% 0.11/0.46 % Unit Clause-clause subsumption calls : 3
% 0.11/0.46 % Rewrite failures with RHS unbound : 0
% 0.11/0.46 % BW rewrite match attempts : 4
% 0.11/0.46 % BW rewrite match successes : 4
% 0.11/0.46 % Condensation attempts : 0
% 0.11/0.46 % Condensation successes : 0
% 0.11/0.46 % Termbank termtop insertions : 5609
% 0.11/0.46 % Search garbage collected termcells : 1524
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.008 s
% 0.11/0.46 % System time : 0.004 s
% 0.11/0.46 % Total time : 0.012 s
% 0.11/0.46 % Maximum resident set size: 3760 pages
% 0.11/0.46
% 0.11/0.46 % -------------------------------------------------
% 0.11/0.46 % User time : 0.011 s
% 0.11/0.46 % System time : 0.010 s
% 0.11/0.46 % Total time : 0.021 s
% 0.11/0.46 % Maximum resident set size: 4864 pages
% 0.11/0.46 % E exiting
%------------------------------------------------------------------------------