%------------------------------------------------------------------------------
% 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/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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 : Unsatisfiable 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 47 ( 14 unt; 10 nHn; 47 RR)
% Number of literals : 108 ( 33 equ; 55 neg)
% Maximal clause size : 5 ( 2 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 : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( ~ rearsegP(sk1,X1)
| ~ rearsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_11,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_12,negated_conjecture,
( rearsegP(sk4,sk3)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause128,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X2,X1)
| ~ rearsegP(X1,X2)
| X2 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause128) ).
cnf(co1_14,negated_conjecture,
( rearsegP(sk4,sk3)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_3,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
cnf(clause59,axiom,
( ~ ssList(X1)
| rearsegP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause59) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_9,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause58,axiom,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause58) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_0_14,negated_conjecture,
( ~ rearsegP(sk1,X1)
| ~ rearsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_15,negated_conjecture,
( ~ rearsegP(sk1,X1)
| ~ rearsegP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
c_0_14 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
co1_11 ).
cnf(c_0_18,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_19,negated_conjecture,
( rearsegP(sk4,sk3)
| nil = sk4 ),
co1_12 ).
cnf(c_0_20,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X2,X1)
| ~ rearsegP(X1,X2)
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[clause128]) ).
cnf(c_0_21,negated_conjecture,
( rearsegP(sk4,sk3)
| nil = sk3 ),
co1_14 ).
cnf(c_0_22,negated_conjecture,
( ~ ssList(X1)
| ~ rearsegP(sk2,X1)
| ~ rearsegP(sk3,X1)
| ~ neq(X1,nil)
| sk2 = nil ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( neq(sk3,nil)
| sk2 = nil ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_25,negated_conjecture,
( rearsegP(sk2,sk3)
| sk2 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_18]),c_0_18]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| rearsegP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause59]) ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X2,X1)
| ~ rearsegP(X1,X2)
| X2 = X1 ),
c_0_20 ).
cnf(c_0_28,negated_conjecture,
( rearsegP(sk2,sk3)
| sk3 = nil ),
inference(rw,[status(thm)],[c_0_21,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_30,negated_conjecture,
( ~ rearsegP(sk3,sk3)
| sk2 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| rearsegP(X1,X1) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_33,negated_conjecture,
( ~ rearsegP(sk3,sk2)
| sk3 = sk2
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_24])]) ).
cnf(c_0_34,negated_conjecture,
sk2 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_24])]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_37,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_32 ).
cnf(c_0_38,negated_conjecture,
( ~ rearsegP(sk3,nil)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34]),c_0_34])]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
c_0_35 ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_36 ).
cnf(c_0_41,negated_conjecture,
( sk3 != nil
| neq(sk2,nil) ),
inference(rw,[status(thm)],[c_0_37,c_0_16]) ).
cnf(c_0_42,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_24])]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_34]),c_0_42])]) ).
cnf(c_0_45,axiom,
ssList(nil),
clause8 ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),
[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/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n015.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 07:54:22 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % new_bool_1 with pid 972056 completed with status 0
% 0.15/0.45 % Result found by new_bool_1
% 0.15/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.15/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.45 % SubtermCWHack with pid 972058 completed with status 0
% 0.15/0.45 % Result found by SubtermCWHack
% 0.15/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.15/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.45 % Preprocessing time : 0.002 s
% 0.15/0.45
% 0.15/0.45 % Proof found!
% 0.15/0.45 % SZS status Unsatisfiable
% 0.15/0.45 % SZS output start CNFRefutation
% See solution above
% 0.15/0.45 % Parsed axioms : 199
% 0.15/0.45 % Removed by relevancy pruning/SinE : 156
% 0.15/0.45 % Initial clauses : 43
% 0.15/0.45 % Removed in clause preprocessing : 0
% 0.15/0.45 % Initial clauses in saturation : 43
% 0.15/0.45 % Processed clauses : 61
% 0.15/0.45 % ...of these trivial : 0
% 0.15/0.45 % ...subsumed : 8
% 0.15/0.45 % ...remaining for further processing : 53
% 0.15/0.45 % Other redundant clauses eliminated : 10
% 0.15/0.45 % Clauses deleted for lack of memory : 0
% 0.15/0.45 % Backward-subsumed : 0
% 0.15/0.45 % Backward-rewritten : 17
% 0.15/0.45 % Generated clauses : 57
% 0.15/0.45 % ...of the previous two non-redundant : 46
% 0.15/0.45 % ...aggressively subsumed : 0
% 0.15/0.45 % Contextual simplify-reflections : 2
% 0.15/0.45 % Paramodulations : 46
% 0.15/0.45 % Factorizations : 0
% 0.15/0.45 % NegExts : 0
% 0.15/0.45 % Equation resolutions : 12
% 0.15/0.45 % Disequality decompositions : 0
% 0.15/0.45 % Total rewrite steps : 75
% 0.15/0.45 % ...of those cached : 67
% 0.15/0.45 % Propositional unsat checks : 0
% 0.15/0.45 % Propositional check models : 0
% 0.15/0.45 % Propositional check unsatisfiable : 0
% 0.15/0.45 % Propositional clauses : 0
% 0.15/0.45 % Propositional clauses after purity: 0
% 0.15/0.45 % Propositional unsat core size : 0
% 0.15/0.45 % Propositional preprocessing time : 0.000
% 0.15/0.45 % Propositional encoding time : 0.000
% 0.15/0.45 % Propositional solver time : 0.000
% 0.15/0.45 % Success case prop preproc time : 0.000
% 0.15/0.45 % Success case prop encoding time : 0.000
% 0.15/0.45 % Success case prop solver time : 0.000
% 0.15/0.45 % Current number of processed clauses : 31
% 0.15/0.45 % Positive orientable unit clauses : 8
% 0.15/0.45 % Positive unorientable unit clauses: 0
% 0.15/0.45 % Negative unit clauses : 0
% 0.15/0.45 % Non-unit-clauses : 23
% 0.15/0.45 % Current number of unprocessed clauses: 28
% 0.15/0.45 % ...number of literals in the above : 131
% 0.15/0.45 % Current number of archived formulas : 0
% 0.15/0.45 % Current number of archived clauses : 17
% 0.15/0.45 % Clause-clause subsumption calls (NU) : 133
% 0.15/0.45 % Rec. Clause-clause subsumption calls : 76
% 0.15/0.45 % Non-unit clause-clause subsumptions : 10
% 0.15/0.45 % Unit Clause-clause subsumption calls : 0
% 0.15/0.45 % Rewrite failures with RHS unbound : 0
% 0.15/0.45 % BW rewrite match attempts : 4
% 0.15/0.45 % BW rewrite match successes : 4
% 0.15/0.45 % Condensation attempts : 0
% 0.15/0.45 % Condensation successes : 0
% 0.15/0.45 % Termbank termtop insertions : 3997
% 0.15/0.45 % Search garbage collected termcells : 921
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.007 s
% 0.15/0.45 % System time : 0.002 s
% 0.15/0.45 % Total time : 0.008 s
% 0.15/0.45 % Maximum resident set size: 3812 pages
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.012 s
% 0.15/0.45 % System time : 0.005 s
% 0.15/0.45 % Total time : 0.017 s
% 0.15/0.45 % Maximum resident set size: 5120 pages
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------