%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC242-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:37 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.65s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 33 ( 13 unt; 8 nHn; 33 RR)
% Number of literals : 86 ( 25 equ; 52 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_11,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| lt(X1,sk5(X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_16,negated_conjecture,
( app(app(sk7,cons(sk6,nil)),sk8) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_13,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_15,negated_conjecture,
( ssList(sk8)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_8,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_12,negated_conjecture,
( ~ leq(X1,sk5(X3,X2,X1))
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause103,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause103) ).
cnf(c_0_10,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_11,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| lt(X1,sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_12,negated_conjecture,
( app(app(sk7,cons(sk6,nil)),sk8) = sk3
| nil = sk3 ),
co1_16 ).
cnf(c_0_13,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_14,negated_conjecture,
nil != sk1,
c_0_10 ).
cnf(c_0_15,negated_conjecture,
( ssItem(sk6)
| nil = sk3 ),
co1_13 ).
cnf(c_0_16,negated_conjecture,
( ssList(sk8)
| nil = sk3 ),
co1_15 ).
cnf(c_0_17,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
co1_14 ).
cnf(c_0_18,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_19,negated_conjecture,
( ~ leq(X1,sk5(X3,X2,X1))
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_20,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause103]) ).
cnf(c_0_21,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| lt(X1,sk5(X3,X2,X1)) ),
c_0_11 ).
cnf(c_0_22,negated_conjecture,
app(app(sk7,cons(sk6,nil)),sk8) = sk1,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]),c_0_14]) ).
cnf(c_0_23,negated_conjecture,
ssItem(sk6),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_13]),c_0_14]) ).
cnf(c_0_24,negated_conjecture,
ssList(sk8),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_13]),c_0_14]) ).
cnf(c_0_25,negated_conjecture,
ssList(sk7),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_13]),c_0_14]) ).
cnf(c_0_26,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
c_0_18 ).
cnf(c_0_27,negated_conjecture,
( ~ leq(X1,sk5(X3,X2,X1))
| app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
c_0_19 ).
cnf(c_0_28,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
c_0_20 ).
cnf(c_0_29,negated_conjecture,
lt(sk6,sk5(sk8,sk7,sk6)),
inference(cn,[status(thm)],[inference(rw,[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]),c_0_25])]) ).
cnf(c_0_30,negated_conjecture,
ssItem(sk5(sk8,sk7,sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_31,negated_conjecture,
~ leq(sk6,sk5(sk8,sk7,sk6)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_22]),c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[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_30]),c_0_23])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC242-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n004.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 08:07:49 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.47 Running first-order theorem proving
% 0.17/0.48 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.23/0.65 % Version: 3.5.1
% 0.23/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.65 % Starting sh5l with 300s (1) cores
% 0.23/0.65 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2671856 completed with status 0
% 0.23/0.65 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.23/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.65 % No SInE strategy applied
% 0.23/0.65 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.23/0.65 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.65 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.23/0.65 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.23/0.65 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.65 % U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 2671866 completed with status 0
% 0.23/0.65 % Result found by U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.23/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.23/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.65 % No SInE strategy applied
% 0.23/0.65 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.23/0.65 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.23/0.65 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.23/0.65 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.23/0.65 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.65 % Preprocessing time : 0.005 s
% 0.23/0.65 % Presaturation interreduction done
% 0.23/0.65
% 0.23/0.65 % Proof found!
% 0.23/0.65 % SZS status Unsatisfiable
% 0.23/0.65 % SZS output start CNFRefutation
% See solution above
% 0.23/0.66 % Parsed axioms : 202
% 0.23/0.66 % Removed by relevancy pruning/SinE : 0
% 0.23/0.66 % Initial clauses : 202
% 0.23/0.66 % Removed in clause preprocessing : 0
% 0.23/0.66 % Initial clauses in saturation : 202
% 0.23/0.66 % Processed clauses : 480
% 0.23/0.66 % ...of these trivial : 2
% 0.23/0.66 % ...subsumed : 13
% 0.23/0.66 % ...remaining for further processing : 464
% 0.23/0.66 % Other redundant clauses eliminated : 56
% 0.23/0.66 % Clauses deleted for lack of memory : 0
% 0.23/0.66 % Backward-subsumed : 0
% 0.23/0.66 % Backward-rewritten : 1
% 0.23/0.66 % Generated clauses : 1215
% 0.23/0.66 % ...of the previous two non-redundant : 1127
% 0.23/0.66 % ...aggressively subsumed : 0
% 0.23/0.66 % Contextual simplify-reflections : 2
% 0.23/0.66 % Paramodulations : 1156
% 0.23/0.66 % Factorizations : 0
% 0.23/0.66 % NegExts : 0
% 0.23/0.66 % Equation resolutions : 60
% 0.23/0.66 % Disequality decompositions : 0
% 0.23/0.66 % Total rewrite steps : 396
% 0.23/0.66 % ...of those cached : 324
% 0.23/0.66 % Propositional unsat checks : 0
% 0.23/0.66 % Propositional check models : 0
% 0.23/0.66 % Propositional check unsatisfiable : 0
% 0.23/0.66 % Propositional clauses : 0
% 0.23/0.66 % Propositional clauses after purity: 0
% 0.23/0.66 % Propositional unsat core size : 0
% 0.23/0.66 % Propositional preprocessing time : 0.000
% 0.23/0.66 % Propositional encoding time : 0.000
% 0.23/0.66 % Propositional solver time : 0.000
% 0.23/0.66 % Success case prop preproc time : 0.000
% 0.23/0.66 % Success case prop encoding time : 0.000
% 0.23/0.66 % Success case prop solver time : 0.000
% 0.23/0.66 % Current number of processed clauses : 246
% 0.23/0.66 % Positive orientable unit clauses : 70
% 0.23/0.66 % Positive unorientable unit clauses: 0
% 0.23/0.66 % Negative unit clauses : 4
% 0.23/0.66 % Non-unit-clauses : 172
% 0.23/0.66 % Current number of unprocessed clauses: 1043
% 0.23/0.66 % ...number of literals in the above : 4040
% 0.23/0.66 % Current number of archived formulas : 0
% 0.23/0.66 % Current number of archived clauses : 195
% 0.23/0.66 % Clause-clause subsumption calls (NU) : 13669
% 0.23/0.66 % Rec. Clause-clause subsumption calls : 1916
% 0.23/0.66 % Non-unit clause-clause subsumptions : 13
% 0.23/0.66 % Unit Clause-clause subsumption calls : 141
% 0.23/0.66 % Rewrite failures with RHS unbound : 0
% 0.23/0.66 % BW rewrite match attempts : 1
% 0.23/0.66 % BW rewrite match successes : 1
% 0.23/0.66 % Condensation attempts : 0
% 0.23/0.66 % Condensation successes : 0
% 0.23/0.66 % Termbank termtop insertions : 30046
% 0.23/0.66 % Search garbage collected termcells : 563
% 0.23/0.66
% 0.23/0.66 % -------------------------------------------------
% 0.23/0.66 % User time : 0.081 s
% 0.23/0.66 % System time : 0.008 s
% 0.23/0.66 % Total time : 0.089 s
% 0.23/0.66 % Maximum resident set size: 3560 pages
% 0.23/0.66
% 0.23/0.66 % -------------------------------------------------
% 0.23/0.66 % User time : 0.544 s
% 0.23/0.66 % System time : 0.055 s
% 0.23/0.66 % Total time : 0.599 s
% 0.23/0.66 % Maximum resident set size: 5120 pages
% 0.23/0.66 % E exiting
%------------------------------------------------------------------------------