%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC110-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 : n001.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:03 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.45s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 50 ( 17 unt; 3 nHn; 50 RR)
% Number of literals : 120 ( 40 equ; 74 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( nil != sk3
| nil = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_14,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_13,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_8,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_15,negated_conjecture,
( nil != sk3
| nil = sk4 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_16,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_17,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_18,negated_conjecture,
( nil != sk3
| nil = sk4 ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_16 ).
cnf(c_0_24,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_17 ).
cnf(c_0_25,negated_conjecture,
( sk1 != nil
| sk2 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_21 ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_22 ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,negated_conjecture,
app(sk3,sk5) = sk4,
co1_8 ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_34,negated_conjecture,
( sk1 != nil
| neq(nil,nil) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_35,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
c_0_26 ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_27 ).
cnf(c_0_37,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_39,negated_conjecture,
app(sk1,sk5) = sk2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_20]),c_0_19]) ).
cnf(c_0_40,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_32 ).
cnf(c_0_42,negated_conjecture,
sk1 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_30])]) ).
cnf(c_0_43,negated_conjecture,
( ~ segmentP(sk2,sk1)
| sk2 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_30])]),c_0_25]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk1,X1)
| segmentP(sk2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_37])]) ).
cnf(c_0_45,negated_conjecture,
sk2 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_39]),c_0_40]),c_0_37])]),c_0_42]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_47,negated_conjecture,
~ segmentP(sk1,sk1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_37])]),c_0_45]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_46 ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC110-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.09/0.37 % Computer : n001.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 08:02:00 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.45 % Version: 3.5.1
% 0.09/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.45 % Starting sh5l with 300s (1) cores
% 0.09/0.45 % new_bool_1 with pid 2621916 completed with status 0
% 0.09/0.45 % Result found by new_bool_1
% 0.09/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.45 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.09/0.45 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.09/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.45 % SubtermCWHack with pid 2621919 completed with status 0
% 0.09/0.45 % Result found by SubtermCWHack
% 0.09/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.09/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.09/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.45 % Search class: FGHSF-FFMM22-MFFFFFNN
% 0.09/0.45 % partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.09/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.45 % Preprocessing time : 0.001 s
% 0.09/0.45
% 0.09/0.45 % Proof found!
% 0.09/0.45 % SZS status Unsatisfiable
% 0.09/0.45 % SZS output start CNFRefutation
% See solution above
% 0.09/0.45 % Parsed axioms : 200
% 0.09/0.45 % Removed by relevancy pruning/SinE : 153
% 0.09/0.45 % Initial clauses : 47
% 0.09/0.45 % Removed in clause preprocessing : 0
% 0.09/0.45 % Initial clauses in saturation : 47
% 0.09/0.45 % Processed clauses : 217
% 0.09/0.45 % ...of these trivial : 7
% 0.09/0.45 % ...subsumed : 82
% 0.09/0.45 % ...remaining for further processing : 128
% 0.09/0.45 % Other redundant clauses eliminated : 12
% 0.09/0.45 % Clauses deleted for lack of memory : 0
% 0.09/0.45 % Backward-subsumed : 15
% 0.09/0.45 % Backward-rewritten : 3
% 0.09/0.45 % Generated clauses : 546
% 0.09/0.45 % ...of the previous two non-redundant : 444
% 0.09/0.45 % ...aggressively subsumed : 0
% 0.09/0.45 % Contextual simplify-reflections : 1
% 0.09/0.45 % Paramodulations : 530
% 0.09/0.45 % Factorizations : 0
% 0.09/0.45 % NegExts : 0
% 0.09/0.45 % Equation resolutions : 16
% 0.09/0.45 % Disequality decompositions : 0
% 0.09/0.45 % Total rewrite steps : 509
% 0.09/0.45 % ...of those cached : 497
% 0.09/0.45 % Propositional unsat checks : 0
% 0.09/0.45 % Propositional check models : 0
% 0.09/0.45 % Propositional check unsatisfiable : 0
% 0.09/0.45 % Propositional clauses : 0
% 0.09/0.45 % Propositional clauses after purity: 0
% 0.09/0.45 % Propositional unsat core size : 0
% 0.09/0.45 % Propositional preprocessing time : 0.000
% 0.09/0.45 % Propositional encoding time : 0.000
% 0.09/0.45 % Propositional solver time : 0.000
% 0.09/0.45 % Success case prop preproc time : 0.000
% 0.09/0.45 % Success case prop encoding time : 0.000
% 0.09/0.45 % Success case prop solver time : 0.000
% 0.09/0.45 % Current number of processed clauses : 103
% 0.09/0.45 % Positive orientable unit clauses : 16
% 0.09/0.45 % Positive unorientable unit clauses: 0
% 0.09/0.45 % Negative unit clauses : 8
% 0.09/0.45 % Non-unit-clauses : 79
% 0.09/0.45 % Current number of unprocessed clauses: 271
% 0.09/0.45 % ...number of literals in the above : 1391
% 0.09/0.45 % Current number of archived formulas : 0
% 0.09/0.45 % Current number of archived clauses : 19
% 0.09/0.45 % Clause-clause subsumption calls (NU) : 1316
% 0.09/0.45 % Rec. Clause-clause subsumption calls : 618
% 0.09/0.45 % Non-unit clause-clause subsumptions : 66
% 0.09/0.45 % Unit Clause-clause subsumption calls : 141
% 0.09/0.45 % Rewrite failures with RHS unbound : 0
% 0.09/0.45 % BW rewrite match attempts : 2
% 0.09/0.45 % BW rewrite match successes : 2
% 0.09/0.45 % Condensation attempts : 0
% 0.09/0.45 % Condensation successes : 0
% 0.09/0.45 % Termbank termtop insertions : 11971
% 0.09/0.45 % Search garbage collected termcells : 919
% 0.09/0.45
% 0.09/0.45 % -------------------------------------------------
% 0.09/0.45 % User time : 0.010 s
% 0.09/0.45 % System time : 0.003 s
% 0.09/0.45 % Total time : 0.013 s
% 0.09/0.45 % Maximum resident set size: 3804 pages
% 0.09/0.45
% 0.09/0.45 % -------------------------------------------------
% 0.09/0.45 % User time : 0.017 s
% 0.09/0.45 % System time : 0.006 s
% 0.09/0.45 % Total time : 0.022 s
% 0.09/0.45 % Maximum resident set size: 4864 pages
% 0.09/0.45 % E exiting
%------------------------------------------------------------------------------