%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC271-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 : n017.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:44 PM UTC 2026
% Result : Unsatisfiable 11.71s 7.11s
% Output : CNFRefutation 11.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 36 ( 21 unt; 4 nHn; 26 RR)
% Number of literals : 93 ( 8 equ; 57 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 47 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause181,axiom,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause181) ).
cnf(clause164,axiom,
( ~ ssList(X1)
| app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
| totalorderedP(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause164) ).
cnf(co1_10,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause103,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause103) ).
cnf(clause30,axiom,
ssItem(skaf65(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause30) ).
cnf(clause31,axiom,
ssItem(skaf64(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause31) ).
cnf(clause27,axiom,
ssList(skaf68(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause27) ).
cnf(clause28,axiom,
ssList(skaf67(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause28) ).
cnf(clause29,axiom,
ssList(skaf66(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause29) ).
cnf(clause91,axiom,
( ~ ssList(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| totalorderedP(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause91) ).
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(co1_8,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(c_0_13,plain,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
inference(fof_simplification,[status(thm)],[clause181]) ).
cnf(c_0_14,plain,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
c_0_13 ).
cnf(c_0_15,plain,
( ~ ssList(X1)
| app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
| totalorderedP(X1) ),
inference(fof_simplification,[status(thm)],[clause164]) ).
cnf(c_0_16,negated_conjecture,
~ totalorderedP(sk1),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_17,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause103]) ).
cnf(c_0_18,plain,
( ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssItem(X1)
| ~ ssItem(X2)
| lt(X1,X2) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
| totalorderedP(X1) ),
c_0_15 ).
cnf(c_0_20,axiom,
ssItem(skaf65(X1)),
clause30 ).
cnf(c_0_21,axiom,
ssItem(skaf64(X1)),
clause31 ).
cnf(c_0_22,axiom,
ssList(skaf68(X1)),
clause27 ).
cnf(c_0_23,axiom,
ssList(skaf67(X1)),
clause28 ).
cnf(c_0_24,axiom,
ssList(skaf66(X1)),
clause29 ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| totalorderedP(X1) ),
inference(fof_simplification,[status(thm)],[clause91]) ).
cnf(c_0_26,negated_conjecture,
~ totalorderedP(sk1),
c_0_16 ).
cnf(c_0_27,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_28,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
c_0_17 ).
cnf(c_0_29,plain,
( ~ strictorderedP(X1)
| ~ ssList(X1)
| totalorderedP(X1)
| lt(skaf64(X1),skaf65(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| totalorderedP(X1) ),
c_0_25 ).
cnf(c_0_31,negated_conjecture,
~ totalorderedP(sk3),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( ~ strictorderedP(X1)
| ~ ssList(X1)
| totalorderedP(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20]),c_0_21])]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
ssList(sk3),
co1_3 ).
cnf(c_0_34,negated_conjecture,
strictorderedP(sk3),
co1_8 ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC271-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/5.47 % Computer : n017.cluster.edu
% 0.20/5.47 % Model : x86_64 x86_64
% 0.20/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/5.47 % Memory : 8046.5625MB
% 0.20/5.47 % OS : Linux 6.8.0-71-generic
% 0.20/5.47 % CPULimit : 300
% 0.20/5.47 % WCLimit : 300
% 0.20/5.47 % DateTime : Mon Sep 21 08:06:02 UTC 2026
% 0.20/5.48 % CPUTime :
% 0.20/5.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/5.53 Running first-order theorem proving
% 0.24/5.53 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
% 11.71/7.11 % Version: 3.5.1
% 11.71/7.11 % Preprocessing class: FSLSSMSSSSSNFFN.
% 11.71/7.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.71/7.11 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.71/7.11 % Starting new_bool_3 with 300s (1) cores
% 11.71/7.11 % Starting new_bool_1 with 300s (1) cores
% 11.71/7.11 % Starting sh5l with 300s (1) cores
% 11.71/7.11 % sh5l with pid 1856956 completed with status 0
% 11.71/7.11 % Result found by sh5l
% 11.71/7.11 % Preprocessing class: FSLSSMSSSSSNFFN.
% 11.71/7.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.71/7.11 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.71/7.11 % Starting new_bool_3 with 300s (1) cores
% 11.71/7.11 % Starting new_bool_1 with 300s (1) cores
% 11.71/7.11 % Starting sh5l with 300s (1) cores
% 11.71/7.11 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 11.71/7.11 % SinE strategy is gf500_gu_R04_F100_L20000
% 11.71/7.11 % Search class: FGHSM-FSLM21-MFFFFFNN
% 11.71/7.11 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 11.71/7.11 % Starting SubtermCWHack with 28s (1) cores
% 11.71/7.11 % SubtermCWHack with pid 1856963 completed with status 0
% 11.71/7.11 % Result found by SubtermCWHack
% 11.71/7.11 % Preprocessing class: FSLSSMSSSSSNFFN.
% 11.71/7.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.71/7.11 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 11.71/7.11 % Starting new_bool_3 with 300s (1) cores
% 11.71/7.11 % Starting new_bool_1 with 300s (1) cores
% 11.71/7.11 % Starting sh5l with 300s (1) cores
% 11.71/7.11 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 11.71/7.11 % SinE strategy is gf500_gu_R04_F100_L20000
% 11.71/7.11 % Search class: FGHSM-FSLM21-MFFFFFNN
% 11.71/7.11 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 11.71/7.11 % Starting SubtermCWHack with 28s (1) cores
% 11.71/7.11 % Preprocessing time : 0.004 s
% 11.71/7.11
% 11.71/7.11 % Proof found!
% 11.71/7.11 % SZS status Unsatisfiable
% 11.71/7.11 % SZS output start CNFRefutation
% See solution above
% 11.71/7.11 % Parsed axioms : 195
% 11.71/7.11 % Removed by relevancy pruning/SinE : 30
% 11.71/7.11 % Initial clauses : 165
% 11.71/7.11 % Removed in clause preprocessing : 0
% 11.71/7.11 % Initial clauses in saturation : 165
% 11.71/7.11 % Processed clauses : 7800
% 11.71/7.11 % ...of these trivial : 6
% 11.71/7.11 % ...subsumed : 6444
% 11.71/7.11 % ...remaining for further processing : 1350
% 11.71/7.11 % Other redundant clauses eliminated : 320
% 11.71/7.11 % Clauses deleted for lack of memory : 0
% 11.71/7.11 % Backward-subsumed : 35
% 11.71/7.11 % Backward-rewritten : 6
% 11.71/7.11 % Generated clauses : 38695
% 11.71/7.11 % ...of the previous two non-redundant : 35107
% 11.71/7.11 % ...aggressively subsumed : 0
% 11.71/7.11 % Contextual simplify-reflections : 280
% 11.71/7.11 % Paramodulations : 38366
% 11.71/7.11 % Factorizations : 0
% 11.71/7.11 % NegExts : 0
% 11.71/7.11 % Equation resolutions : 330
% 11.71/7.11 % Disequality decompositions : 0
% 11.71/7.11 % Total rewrite steps : 40226
% 11.71/7.11 % ...of those cached : 39603
% 11.71/7.11 % Propositional unsat checks : 0
% 11.71/7.11 % Propositional check models : 0
% 11.71/7.11 % Propositional check unsatisfiable : 0
% 11.71/7.11 % Propositional clauses : 0
% 11.71/7.11 % Propositional clauses after purity: 0
% 11.71/7.11 % Propositional unsat core size : 0
% 11.71/7.11 % Propositional preprocessing time : 0.000
% 11.71/7.11 % Propositional encoding time : 0.000
% 11.71/7.11 % Propositional solver time : 0.000
% 11.71/7.11 % Success case prop preproc time : 0.000
% 11.71/7.11 % Success case prop encoding time : 0.000
% 11.71/7.11 % Success case prop solver time : 0.000
% 11.71/7.11 % Current number of processed clauses : 1289
% 11.71/7.11 % Positive orientable unit clauses : 52
% 11.71/7.11 % Positive unorientable unit clauses: 0
% 11.71/7.11 % Negative unit clauses : 1
% 11.71/7.11 % Non-unit-clauses : 1236
% 11.71/7.11 % Current number of unprocessed clauses: 27427
% 11.71/7.11 % ...number of literals in the above : 161506
% 11.71/7.11 % Current number of archived formulas : 0
% 11.71/7.11 % Current number of archived clauses : 41
% 11.71/7.11 % Clause-clause subsumption calls (NU) : 407570
% 11.71/7.11 % Rec. Clause-clause subsumption calls : 233110
% 11.71/7.11 % Non-unit clause-clause subsumptions : 6757
% 11.71/7.11 % Unit Clause-clause subsumption calls : 783
% 11.71/7.11 % Rewrite failures with RHS unbound : 0
% 11.71/7.11 % BW rewrite match attempts : 3
% 11.71/7.11 % BW rewrite match successes : 3
% 11.71/7.11 % Condensation attempts : 0
% 11.71/7.11 % Condensation successes : 0
% 11.71/7.11 % Termbank termtop insertions : 804769
% 11.71/7.11 % Search garbage collected termcells : 615
% 11.71/7.11
% 11.71/7.11 % -------------------------------------------------
% 11.71/7.11 % User time : 1.368 s
% 11.71/7.11 % System time : 0.058 s
% 11.71/7.11 % Total time : 1.426 s
% 11.71/7.11 % Maximum resident set size: 4064 pages
% 11.71/7.11
% 11.71/7.11 % -------------------------------------------------
% 11.71/7.11 % User time : 1.375 s
% 11.71/7.11 % System time : 0.064 s
% 11.71/7.11 % Total time : 1.439 s
% 11.71/7.11 % Maximum resident set size: 4864 pages
% 11.71/7.11 % E exiting
%------------------------------------------------------------------------------