%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC277-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 : n013.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:45 PM UTC 2026
% Result : Unsatisfiable 0.16s 5.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 39 ( 23 unt; 3 nHn; 37 RR)
% Number of literals : 68 ( 13 equ; 31 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause67,axiom,
( ~ ssItem(X1)
| totalorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause67) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(co1_8,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(co1_9,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_3,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause80,axiom,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause80) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause4,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause4) ).
cnf(c_0_13,plain,
( ~ ssItem(X1)
| totalorderedP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause67]) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_15,negated_conjecture,
~ totalorderedP(sk1),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_16,plain,
( ~ ssItem(X1)
| totalorderedP(cons(X1,nil)) ),
c_0_13 ).
cnf(c_0_17,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_14 ).
cnf(c_0_18,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_19,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_20,negated_conjecture,
~ totalorderedP(sk1),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| totalorderedP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_25,negated_conjecture,
~ totalorderedP(sk3),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_27,negated_conjecture,
~ neq(sk4,nil),
inference(sr,[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_28,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_26 ).
cnf(c_0_29,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause80]) ).
cnf(c_0_32,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_33,negated_conjecture,
sk4 = 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_30])]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
c_0_31 ).
cnf(c_0_35,negated_conjecture,
segmentP(nil,sk3),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_24])]) ).
cnf(c_0_37,axiom,
totalorderedP(nil),
clause4 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_36]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC277-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.11/5.39 % Computer : n013.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Mon Sep 21 08:11:35 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.44 Running first-order theorem proving
% 0.16/5.44 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.16/5.47 % Version: 3.5.1
% 0.16/5.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.47 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.47 % Starting sh5l with 300s (1) cores
% 0.16/5.47 % sh5l with pid 333773 completed with status 0
% 0.16/5.47 % Result found by sh5l
% 0.16/5.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.47 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.47 % Starting sh5l with 300s (1) cores
% 0.16/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/5.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/5.47 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.16/5.47 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.47 % Starting SubtermCWHack with 28s (1) cores
% 0.16/5.47 % SubtermCWHack with pid 333781 completed with status 0
% 0.16/5.47 % Result found by SubtermCWHack
% 0.16/5.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.47 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.47 % Starting sh5l with 300s (1) cores
% 0.16/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.16/5.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/5.47 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.16/5.47 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.47 % Starting SubtermCWHack with 28s (1) cores
% 0.16/5.47 % Preprocessing time : 0.003 s
% 0.16/5.47
% 0.16/5.47 % Proof found!
% 0.16/5.47 % SZS status Unsatisfiable
% 0.16/5.47 % SZS output start CNFRefutation
% See solution above
% 0.16/5.47 % Parsed axioms : 194
% 0.16/5.47 % Removed by relevancy pruning/SinE : 29
% 0.16/5.47 % Initial clauses : 165
% 0.16/5.47 % Removed in clause preprocessing : 0
% 0.16/5.47 % Initial clauses in saturation : 165
% 0.16/5.47 % Processed clauses : 102
% 0.16/5.47 % ...of these trivial : 0
% 0.16/5.47 % ...subsumed : 4
% 0.16/5.47 % ...remaining for further processing : 98
% 0.16/5.47 % Other redundant clauses eliminated : 7
% 0.16/5.47 % Clauses deleted for lack of memory : 0
% 0.16/5.47 % Backward-subsumed : 2
% 0.16/5.47 % Backward-rewritten : 11
% 0.16/5.47 % Generated clauses : 23
% 0.16/5.47 % ...of the previous two non-redundant : 21
% 0.16/5.47 % ...aggressively subsumed : 0
% 0.16/5.47 % Contextual simplify-reflections : 0
% 0.16/5.47 % Paramodulations : 17
% 0.16/5.47 % Factorizations : 0
% 0.16/5.47 % NegExts : 0
% 0.16/5.47 % Equation resolutions : 7
% 0.16/5.47 % Disequality decompositions : 0
% 0.16/5.47 % Total rewrite steps : 41
% 0.16/5.47 % ...of those cached : 31
% 0.16/5.47 % Propositional unsat checks : 0
% 0.16/5.47 % Propositional check models : 0
% 0.16/5.47 % Propositional check unsatisfiable : 0
% 0.16/5.47 % Propositional clauses : 0
% 0.16/5.47 % Propositional clauses after purity: 0
% 0.16/5.47 % Propositional unsat core size : 0
% 0.16/5.47 % Propositional preprocessing time : 0.000
% 0.16/5.47 % Propositional encoding time : 0.000
% 0.16/5.47 % Propositional solver time : 0.000
% 0.16/5.47 % Success case prop preproc time : 0.000
% 0.16/5.47 % Success case prop encoding time : 0.000
% 0.16/5.47 % Success case prop solver time : 0.000
% 0.16/5.47 % Current number of processed clauses : 81
% 0.16/5.47 % Positive orientable unit clauses : 40
% 0.16/5.47 % Positive unorientable unit clauses: 0
% 0.16/5.47 % Negative unit clauses : 2
% 0.16/5.47 % Non-unit-clauses : 39
% 0.16/5.47 % Current number of unprocessed clauses: 84
% 0.16/5.47 % ...number of literals in the above : 413
% 0.16/5.47 % Current number of archived formulas : 0
% 0.16/5.47 % Current number of archived clauses : 13
% 0.16/5.47 % Clause-clause subsumption calls (NU) : 315
% 0.16/5.47 % Rec. Clause-clause subsumption calls : 255
% 0.16/5.47 % Non-unit clause-clause subsumptions : 2
% 0.16/5.47 % Unit Clause-clause subsumption calls : 68
% 0.16/5.47 % Rewrite failures with RHS unbound : 0
% 0.16/5.47 % BW rewrite match attempts : 4
% 0.16/5.47 % BW rewrite match successes : 4
% 0.16/5.47 % Condensation attempts : 0
% 0.16/5.47 % Condensation successes : 0
% 0.16/5.47 % Termbank termtop insertions : 7026
% 0.16/5.47 % Search garbage collected termcells : 607
% 0.16/5.47
% 0.16/5.47 % -------------------------------------------------
% 0.16/5.47 % User time : 0.010 s
% 0.16/5.47 % System time : 0.004 s
% 0.16/5.47 % Total time : 0.013 s
% 0.16/5.47 % Maximum resident set size: 4064 pages
% 0.16/5.47
% 0.16/5.47 % -------------------------------------------------
% 0.16/5.47 % User time : 0.013 s
% 0.16/5.47 % System time : 0.009 s
% 0.16/5.47 % Total time : 0.022 s
% 0.16/5.47 % Maximum resident set size: 5120 pages
% 0.16/5.47 % E exiting
%------------------------------------------------------------------------------