%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC331-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 : n011.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 : Unsatisfiable 0.24s 0.63s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 17 unt; 0 nHn; 31 RR)
% Number of literals : 61 ( 9 equ; 35 neg)
% Maximal clause size : 6 ( 1 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 : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_12,negated_conjecture,
( ~ equalelemsP(sk1)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_9,negated_conjecture,
equalelemsP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_8,negated_conjecture,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_3,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_11,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_12,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_13,negated_conjecture,
( ~ equalelemsP(sk1)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_11 ).
cnf(c_0_15,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_12 ).
cnf(c_0_16,axiom,
ssList(nil),
clause8 ).
cnf(c_0_17,negated_conjecture,
( ~ equalelemsP(sk1)
| ~ segmentP(sk2,sk1) ),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_19,negated_conjecture,
equalelemsP(sk3),
co1_9 ).
cnf(c_0_20,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_21,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_14,c_0_15]),c_0_16])]) ).
cnf(c_0_22,negated_conjecture,
app(sk3,sk5) = sk4,
co1_8 ).
cnf(c_0_23,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_24,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_25,negated_conjecture,
~ segmentP(sk4,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),c_0_18])]) ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk3,X1)
| segmentP(sk4,X1) ),
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_24])]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_28,negated_conjecture,
~ segmentP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24])]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_27 ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC331-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n011.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 08:16:10 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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.63 % Version: 3.5.1
% 0.24/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.63 % Starting sh5l with 300s (1) cores
% 0.24/0.63 % new_bool_3 with pid 1436630 completed with status 0
% 0.24/0.63 % Result found by new_bool_3
% 0.24/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.63 % Search class: FHHSF-FFMM22-MFFFFFNN
% 0.24/0.63 % partial match(1): FHHSF-FFMM22-SFFFFFNN
% 0.24/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.63 % SubtermCWHack with pid 1436633 completed with status 0
% 0.24/0.63 % Result found by SubtermCWHack
% 0.24/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.63 % Search class: FHHSF-FFMM22-MFFFFFNN
% 0.24/0.63 % partial match(1): FHHSF-FFMM22-SFFFFFNN
% 0.24/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.63 % Preprocessing time : 0.002 s
% 0.24/0.63
% 0.24/0.63 % Proof found!
% 0.24/0.63 % SZS status Unsatisfiable
% 0.24/0.63 % SZS output start CNFRefutation
% See solution above
% 0.24/0.63 % Parsed axioms : 197
% 0.24/0.63 % Removed by relevancy pruning/SinE : 157
% 0.24/0.63 % Initial clauses : 40
% 0.24/0.63 % Removed in clause preprocessing : 0
% 0.24/0.63 % Initial clauses in saturation : 40
% 0.24/0.63 % Processed clauses : 265
% 0.24/0.63 % ...of these trivial : 19
% 0.24/0.63 % ...subsumed : 104
% 0.24/0.63 % ...remaining for further processing : 142
% 0.24/0.63 % Other redundant clauses eliminated : 11
% 0.24/0.63 % Clauses deleted for lack of memory : 0
% 0.24/0.63 % Backward-subsumed : 31
% 0.24/0.63 % Backward-rewritten : 2
% 0.24/0.63 % Generated clauses : 794
% 0.24/0.63 % ...of the previous two non-redundant : 641
% 0.24/0.63 % ...aggressively subsumed : 0
% 0.24/0.63 % Contextual simplify-reflections : 3
% 0.24/0.63 % Paramodulations : 782
% 0.24/0.63 % Factorizations : 0
% 0.24/0.63 % NegExts : 0
% 0.24/0.63 % Equation resolutions : 13
% 0.24/0.63 % Disequality decompositions : 0
% 0.24/0.63 % Total rewrite steps : 702
% 0.24/0.63 % ...of those cached : 688
% 0.24/0.63 % Propositional unsat checks : 0
% 0.24/0.63 % Propositional check models : 0
% 0.24/0.63 % Propositional check unsatisfiable : 0
% 0.24/0.63 % Propositional clauses : 0
% 0.24/0.63 % Propositional clauses after purity: 0
% 0.24/0.63 % Propositional unsat core size : 0
% 0.24/0.63 % Propositional preprocessing time : 0.000
% 0.24/0.63 % Propositional encoding time : 0.000
% 0.24/0.63 % Propositional solver time : 0.000
% 0.24/0.63 % Success case prop preproc time : 0.000
% 0.24/0.63 % Success case prop encoding time : 0.000
% 0.24/0.63 % Success case prop solver time : 0.000
% 0.24/0.63 % Current number of processed clauses : 105
% 0.24/0.63 % Positive orientable unit clauses : 15
% 0.24/0.63 % Positive unorientable unit clauses: 0
% 0.24/0.63 % Negative unit clauses : 5
% 0.24/0.63 % Non-unit-clauses : 85
% 0.24/0.63 % Current number of unprocessed clauses: 387
% 0.24/0.63 % ...number of literals in the above : 1937
% 0.24/0.63 % Current number of archived formulas : 0
% 0.24/0.63 % Current number of archived clauses : 33
% 0.24/0.63 % Clause-clause subsumption calls (NU) : 1399
% 0.24/0.63 % Rec. Clause-clause subsumption calls : 742
% 0.24/0.63 % Non-unit clause-clause subsumptions : 110
% 0.24/0.63 % Unit Clause-clause subsumption calls : 103
% 0.24/0.63 % Rewrite failures with RHS unbound : 0
% 0.24/0.63 % BW rewrite match attempts : 2
% 0.24/0.63 % BW rewrite match successes : 2
% 0.24/0.63 % Condensation attempts : 0
% 0.24/0.63 % Condensation successes : 0
% 0.24/0.63 % Termbank termtop insertions : 15139
% 0.24/0.63 % Search garbage collected termcells : 916
% 0.24/0.63
% 0.24/0.63 % -------------------------------------------------
% 0.24/0.63 % User time : 0.018 s
% 0.24/0.63 % System time : 0.006 s
% 0.24/0.63 % Total time : 0.025 s
% 0.24/0.63 % Maximum resident set size: 4016 pages
% 0.24/0.63
% 0.24/0.63 % -------------------------------------------------
% 0.24/0.63 % User time : 0.026 s
% 0.24/0.63 % System time : 0.013 s
% 0.24/0.63 % Total time : 0.039 s
% 0.24/0.63 % Maximum resident set size: 5120 pages
% 0.24/0.63 % E exiting
%------------------------------------------------------------------------------