%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC272-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 : n004.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 81.11s 12.42s
% Output : CNFRefutation 81.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 38 ( 25 unt; 3 nHn; 28 RR)
% Number of literals : 90 ( 9 equ; 53 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 2 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 : 45 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
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/sandbox/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/sandbox/benchmark/Axioms/SWC001-0.ax',clause164) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause103,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause103) ).
cnf(clause30,axiom,
ssItem(skaf65(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause30) ).
cnf(clause31,axiom,
ssItem(skaf64(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause31) ).
cnf(clause27,axiom,
ssList(skaf68(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause27) ).
cnf(clause28,axiom,
ssList(skaf67(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause28) ).
cnf(clause29,axiom,
ssList(skaf66(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause29) ).
cnf(co1_9,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause91,axiom,
( ~ ssList(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| totalorderedP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause91) ).
cnf(c_0_13,negated_conjecture,
~ totalorderedP(sk1),
inference(fof_simplification,[status(thm)],[co1_11]) ).
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) ),
inference(fof_simplification,[status(thm)],[clause181]) ).
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,
ssList(sk1),
co1_1 ).
cnf(c_0_17,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_18,negated_conjecture,
~ totalorderedP(sk1),
c_0_13 ).
cnf(c_0_19,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_14 ).
cnf(c_0_20,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_21,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
~ totalorderedP(sk3),
inference(rw,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_23,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause103]) ).
cnf(c_0_24,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_19]) ).
cnf(c_0_25,negated_conjecture,
app(app(skaf66(sk3),cons(skaf64(sk3),skaf67(sk3))),cons(skaf65(sk3),skaf68(sk3))) = sk3,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_26,axiom,
ssItem(skaf65(X1)),
clause30 ).
cnf(c_0_27,axiom,
ssItem(skaf64(X1)),
clause31 ).
cnf(c_0_28,axiom,
ssList(skaf68(X1)),
clause27 ).
cnf(c_0_29,axiom,
ssList(skaf67(X1)),
clause28 ).
cnf(c_0_30,axiom,
ssList(skaf66(X1)),
clause29 ).
cnf(c_0_31,negated_conjecture,
strictorderedP(sk3),
co1_9 ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| totalorderedP(X1) ),
inference(fof_simplification,[status(thm)],[clause91]) ).
cnf(c_0_33,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
c_0_23 ).
cnf(c_0_34,negated_conjecture,
lt(skaf64(sk3),skaf65(sk3)),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]),c_0_21]),c_0_28]),c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| totalorderedP(X1) ),
c_0_32 ).
cnf(c_0_36,negated_conjecture,
leq(skaf64(sk3),skaf65(sk3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_26]),c_0_27])]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_21])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC272-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42 % Computer : n004.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Mon Sep 21 08:10:35 UTC 2026
% 0.17/0.42 % CPUTime :
% 0.17/0.42 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.49 Running first-order theorem proving
% 0.17/0.49 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
% 81.11/12.42 % Version: 3.5.1
% 81.11/12.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 81.11/12.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 81.11/12.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 81.11/12.42 % Starting new_bool_3 with 300s (1) cores
% 81.11/12.42 % Starting new_bool_1 with 300s (1) cores
% 81.11/12.42 % Starting sh5l with 300s (1) cores
% 81.11/12.42 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2677595 completed with status 0
% 81.11/12.42 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 81.11/12.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 81.11/12.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 81.11/12.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 81.11/12.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 81.11/12.42 % No SInE strategy applied
% 81.11/12.42 % Search class: FGHSM-FSLM21-MFFFFFNN
% 81.11/12.42 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 81.11/12.42 % Starting SubtermCWHack with 136s (1) cores
% 81.11/12.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 81.11/12.42 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 81.11/12.42 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 81.11/12.42 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 81.11/12.42 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 2677605 completed with status 0
% 81.11/12.42 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 81.11/12.42 % Preprocessing class: FSLSSMSMSSSNFFN.
% 81.11/12.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 81.11/12.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 81.11/12.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 81.11/12.42 % No SInE strategy applied
% 81.11/12.42 % Search class: FGHSM-FSLM21-MFFFFFNN
% 81.11/12.42 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 81.11/12.42 % Starting SubtermCWHack with 136s (1) cores
% 81.11/12.42 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 81.11/12.42 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 81.11/12.42 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 81.11/12.42 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 81.11/12.42 % Preprocessing time : 0.007 s
% 81.11/12.42
% 81.11/12.42 % Proof found!
% 81.11/12.42 % SZS status Unsatisfiable
% 81.11/12.42 % SZS output start CNFRefutation
% See solution above
% 81.11/12.43 % Parsed axioms : 197
% 81.11/12.43 % Removed by relevancy pruning/SinE : 0
% 81.11/12.43 % Initial clauses : 197
% 81.11/12.43 % Removed in clause preprocessing : 0
% 81.11/12.43 % Initial clauses in saturation : 197
% 81.11/12.43 % Processed clauses : 9572
% 81.11/12.43 % ...of these trivial : 459
% 81.11/12.43 % ...subsumed : 5757
% 81.11/12.43 % ...remaining for further processing : 3356
% 81.11/12.43 % Other redundant clauses eliminated : 277
% 81.11/12.43 % Clauses deleted for lack of memory : 0
% 81.11/12.43 % Backward-subsumed : 251
% 81.11/12.43 % Backward-rewritten : 16
% 81.11/12.43 % Generated clauses : 222214
% 81.11/12.43 % ...of the previous two non-redundant : 214441
% 81.11/12.43 % ...aggressively subsumed : 0
% 81.11/12.43 % Contextual simplify-reflections : 675
% 81.11/12.43 % Paramodulations : 221226
% 81.11/12.43 % Factorizations : 386
% 81.11/12.43 % NegExts : 0
% 81.11/12.43 % Equation resolutions : 602
% 81.11/12.43 % Disequality decompositions : 0
% 81.11/12.43 % Total rewrite steps : 162432
% 81.11/12.43 % ...of those cached : 158274
% 81.11/12.43 % Propositional unsat checks : 0
% 81.11/12.43 % Propositional check models : 0
% 81.11/12.43 % Propositional check unsatisfiable : 0
% 81.11/12.43 % Propositional clauses : 0
% 81.11/12.43 % Propositional clauses after purity: 0
% 81.11/12.43 % Propositional unsat core size : 0
% 81.11/12.43 % Propositional preprocessing time : 0.000
% 81.11/12.43 % Propositional encoding time : 0.000
% 81.11/12.43 % Propositional solver time : 0.000
% 81.11/12.43 % Success case prop preproc time : 0.000
% 81.11/12.43 % Success case prop encoding time : 0.000
% 81.11/12.43 % Success case prop solver time : 0.000
% 81.11/12.43 % Current number of processed clauses : 3084
% 81.11/12.43 % Positive orientable unit clauses : 75
% 81.11/12.43 % Positive unorientable unit clauses: 0
% 81.11/12.43 % Negative unit clauses : 4
% 81.11/12.43 % Non-unit-clauses : 3005
% 81.11/12.43 % Current number of unprocessed clauses: 204892
% 81.11/12.43 % ...number of literals in the above : 1345677
% 81.11/12.43 % Current number of archived formulas : 0
% 81.11/12.43 % Current number of archived clauses : 267
% 81.11/12.43 % Clause-clause subsumption calls (NU) : 1434692
% 81.11/12.43 % Rec. Clause-clause subsumption calls : 252829
% 81.11/12.43 % Non-unit clause-clause subsumptions : 5860
% 81.11/12.43 % Unit Clause-clause subsumption calls : 2113
% 81.11/12.43 % Rewrite failures with RHS unbound : 0
% 81.11/12.43 % BW rewrite match attempts : 10
% 81.11/12.43 % BW rewrite match successes : 7
% 81.11/12.43 % Condensation attempts : 0
% 81.11/12.43 % Condensation successes : 0
% 81.11/12.43 % Termbank termtop insertions : 6621251
% 81.11/12.43 % Search garbage collected termcells : 544
% 81.11/12.43
% 81.11/12.43 % -------------------------------------------------
% 81.11/12.43 % User time : 11.204 s
% 81.11/12.43 % System time : 0.375 s
% 81.11/12.43 % Total time : 11.580 s
% 81.11/12.43 % Maximum resident set size: 3812 pages
% 81.11/12.43
% 81.11/12.43 % -------------------------------------------------
% 81.11/12.43 % User time : 56.602 s
% 81.11/12.43 % System time : 1.552 s
% 81.11/12.43 % Total time : 58.154 s
% 81.11/12.43 % Maximum resident set size: 4864 pages
% 81.11/12.43 % E exiting
%------------------------------------------------------------------------------