%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC038+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 : n003.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:43 PM UTC 2026
% Result : Theorem 0.10s 0.42s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 9 unt; 0 def)
% Number of atoms : 75 ( 37 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 90 ( 32 ~; 29 |; 15 &)
% ( 1 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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 : 15 ( 0 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ~ frontsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| nil = X1
| X1 != X3
| X2 != X4
| nil != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax46,axiom,
! [X1] :
( ssList(X1)
=> ( frontsegP(nil,X1)
<=> nil = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax46) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ~ frontsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| nil = X1
| X1 != X3
| X2 != X4
| nil != X2 ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( ( ( ~ frontsegP(X4,X3)
| ~ neq(X3,nil) )
& ( nil != X3
| nil != X4 ) )
| nil = X1
| X1 != X3
| X2 != X4
| nil != X2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_4,negated_conjecture,
( ( nil = esk3_0
| frontsegP(esk4_0,esk3_0) )
& ( nil = esk3_0
| neq(esk3_0,nil) )
& ( nil = esk4_0
| frontsegP(esk4_0,esk3_0) )
& ( nil = esk4_0
| neq(esk3_0,nil) )
& nil != esk1_0
& esk1_0 = esk3_0
& esk2_0 = esk4_0
& nil = esk2_0
& ssList(esk4_0)
& ssList(esk3_0)
& ssList(esk2_0)
& ssList(esk1_0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_5,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,negated_conjecture,
nil = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_9,plain,
! [X29] :
( ( ~ ssList(X29)
| frontsegP(nil,X29)
| nil != X29 )
& ( ~ ssList(X29)
| nil = X29
| ~ frontsegP(nil,X29) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax46])])])]) ).
cnf(c_0_10,negated_conjecture,
( nil = esk3_0
| frontsegP(esk4_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
esk4_0 = nil,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_12,negated_conjecture,
esk3_0 != nil,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
frontsegP(nil,esk3_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC038+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.10/0.36 % Computer : n003.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.36 % DateTime : Mon Sep 21 07:52:33 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.42 % Version: 3.5.1
% 0.10/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.42 % Starting sh5l with 300s (1) cores
% 0.10/0.42 % new_bool_3 with pid 3790060 completed with status 0
% 0.10/0.42 % Result found by new_bool_3
% 0.10/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.42 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.10/0.42 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.42 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.42 % SubtermCWHack with pid 3790063 completed with status 0
% 0.10/0.42 % Result found by SubtermCWHack
% 0.10/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.42 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.10/0.42 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.42 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.42 % Preprocessing time : 0.002 s
% 0.10/0.42
% 0.10/0.42 % Proof found!
% 0.10/0.42 % SZS status Theorem
% 0.10/0.42 % SZS output start CNFRefutation
% See solution above
% 0.10/0.42 % Parsed axioms : 96
% 0.10/0.42 % Removed by relevancy pruning/SinE : 69
% 0.10/0.42 % Initial clauses : 52
% 0.10/0.42 % Removed in clause preprocessing : 0
% 0.10/0.42 % Initial clauses in saturation : 52
% 0.10/0.42 % Processed clauses : 25
% 0.10/0.42 % ...of these trivial : 2
% 0.10/0.42 % ...subsumed : 0
% 0.10/0.42 % ...remaining for further processing : 23
% 0.10/0.42 % Other redundant clauses eliminated : 1
% 0.10/0.42 % Clauses deleted for lack of memory : 0
% 0.10/0.42 % Backward-subsumed : 0
% 0.10/0.42 % Backward-rewritten : 3
% 0.10/0.42 % Generated clauses : 2
% 0.10/0.42 % ...of the previous two non-redundant : 1
% 0.10/0.42 % ...aggressively subsumed : 0
% 0.10/0.42 % Contextual simplify-reflections : 0
% 0.10/0.42 % Paramodulations : 1
% 0.10/0.42 % Factorizations : 0
% 0.10/0.42 % NegExts : 0
% 0.10/0.42 % Equation resolutions : 1
% 0.10/0.42 % Disequality decompositions : 0
% 0.10/0.42 % Total rewrite steps : 16
% 0.10/0.42 % ...of those cached : 9
% 0.10/0.42 % Propositional unsat checks : 0
% 0.10/0.42 % Propositional check models : 0
% 0.10/0.42 % Propositional check unsatisfiable : 0
% 0.10/0.42 % Propositional clauses : 0
% 0.10/0.42 % Propositional clauses after purity: 0
% 0.10/0.42 % Propositional unsat core size : 0
% 0.10/0.42 % Propositional preprocessing time : 0.000
% 0.10/0.42 % Propositional encoding time : 0.000
% 0.10/0.42 % Propositional solver time : 0.000
% 0.10/0.42 % Success case prop preproc time : 0.000
% 0.10/0.42 % Success case prop encoding time : 0.000
% 0.10/0.42 % Success case prop solver time : 0.000
% 0.10/0.42 % Current number of processed clauses : 19
% 0.10/0.42 % Positive orientable unit clauses : 10
% 0.10/0.42 % Positive unorientable unit clauses: 0
% 0.10/0.42 % Negative unit clauses : 2
% 0.10/0.42 % Non-unit-clauses : 7
% 0.10/0.42 % Current number of unprocessed clauses: 28
% 0.10/0.42 % ...number of literals in the above : 125
% 0.10/0.42 % Current number of archived formulas : 0
% 0.10/0.42 % Current number of archived clauses : 3
% 0.10/0.42 % Clause-clause subsumption calls (NU) : 12
% 0.10/0.42 % Rec. Clause-clause subsumption calls : 12
% 0.10/0.42 % Non-unit clause-clause subsumptions : 0
% 0.10/0.42 % Unit Clause-clause subsumption calls : 1
% 0.10/0.42 % Rewrite failures with RHS unbound : 0
% 0.10/0.42 % BW rewrite match attempts : 3
% 0.10/0.42 % BW rewrite match successes : 3
% 0.10/0.42 % Condensation attempts : 0
% 0.10/0.42 % Condensation successes : 0
% 0.10/0.42 % Termbank termtop insertions : 4923
% 0.10/0.42 % Search garbage collected termcells : 1528
% 0.10/0.42
% 0.10/0.42 % -------------------------------------------------
% 0.10/0.42 % User time : 0.006 s
% 0.10/0.42 % System time : 0.003 s
% 0.10/0.42 % Total time : 0.009 s
% 0.10/0.42 % Maximum resident set size: 4012 pages
% 0.10/0.42
% 0.10/0.42 % -------------------------------------------------
% 0.10/0.42 % User time : 0.012 s
% 0.10/0.42 % System time : 0.006 s
% 0.10/0.42 % Total time : 0.018 s
% 0.10/0.42 % Maximum resident set size: 4864 pages
% 0.10/0.42 % E exiting
%------------------------------------------------------------------------------