%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC305-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 : n010.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:51 PM UTC 2026
% Result : Unsatisfiable 0.27s 0.69s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of clauses : 52 ( 29 unt; 0 nHn; 52 RR)
% Number of literals : 124 ( 21 equ; 76 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_15,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_12,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_13,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_10,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_14,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_11,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
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(clause114,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause114) ).
cnf(co1_8,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_16,negated_conjecture,
lt(sk6,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(c_0_17,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_18,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
co1_15 ).
cnf(c_0_19,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_17 ).
cnf(c_0_20,negated_conjecture,
ssList(sk7),
co1_12 ).
cnf(c_0_21,negated_conjecture,
ssList(sk8),
co1_13 ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_23,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk1 ),
inference(cn,[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])]) ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_22 ).
cnf(c_0_25,negated_conjecture,
ssItem(sk5),
co1_10 ).
cnf(c_0_26,axiom,
ssList(nil),
clause8 ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_28,negated_conjecture,
app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_27 ).
cnf(c_0_30,negated_conjecture,
app(app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)),sk9) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25]),c_0_21])]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk9),
co1_14 ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,sk8)))
| app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_31])]) ).
cnf(c_0_33,negated_conjecture,
ssItem(sk6),
co1_11 ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,sk8)))
| app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_33]),c_0_26])]) ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_34 ).
cnf(c_0_37,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_38,negated_conjecture,
( ~ ssList(cons(sk5,sk8))
| app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20])]) ).
cnf(c_0_39,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause114]) ).
cnf(c_0_40,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_37 ).
cnf(c_0_41,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_24]),c_0_25]),c_0_21])]) ).
cnf(c_0_42,negated_conjecture,
strictorderedP(sk3),
co1_8 ).
cnf(c_0_43,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_44,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
c_0_39 ).
cnf(c_0_45,negated_conjecture,
lt(sk6,sk5),
co1_16 ).
cnf(c_0_46,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_40]) ).
cnf(c_0_47,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),cons(sk6,sk9)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_29]),c_0_33]),c_0_31])]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_49,negated_conjecture,
strictorderedP(sk1),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,negated_conjecture,
~ lt(sk5,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_33]),c_0_25])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[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_46,c_0_47]),c_0_33]),c_0_25]),c_0_48]),c_0_31]),c_0_21]),c_0_20]),c_0_49])]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC305-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42 % Computer : n010.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:14:10 UTC 2026
% 0.17/0.42 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.53 Running first-order theorem proving
% 0.17/0.53 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.27/0.69 % Version: 3.5.1
% 0.27/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.27/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.27/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.69 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.69 % Starting sh5l with 300s (1) cores
% 0.27/0.69 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 443697 completed with status 0
% 0.27/0.69 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.27/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.27/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.27/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.69 % No SInE strategy applied
% 0.27/0.69 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.27/0.69 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.27/0.69 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.27/0.69 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.27/0.69 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.27/0.69 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 443706 completed with status 0
% 0.27/0.69 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.27/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.27/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.27/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.69 % No SInE strategy applied
% 0.27/0.69 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.27/0.69 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.27/0.69 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.27/0.69 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.27/0.69 % Preprocessing time : 0.005 s
% 0.27/0.69
% 0.27/0.69 % Proof found!
% 0.27/0.69 % SZS status Unsatisfiable
% 0.27/0.69 % SZS output start CNFRefutation
% See solution above
% 0.27/0.69 % Parsed axioms : 201
% 0.27/0.69 % Removed by relevancy pruning/SinE : 0
% 0.27/0.69 % Initial clauses : 201
% 0.27/0.69 % Removed in clause preprocessing : 0
% 0.27/0.69 % Initial clauses in saturation : 201
% 0.27/0.69 % Processed clauses : 490
% 0.27/0.69 % ...of these trivial : 4
% 0.27/0.69 % ...subsumed : 71
% 0.27/0.69 % ...remaining for further processing : 415
% 0.27/0.69 % Other redundant clauses eliminated : 58
% 0.27/0.69 % Clauses deleted for lack of memory : 0
% 0.27/0.69 % Backward-subsumed : 17
% 0.27/0.69 % Backward-rewritten : 27
% 0.27/0.69 % Generated clauses : 1282
% 0.27/0.69 % ...of the previous two non-redundant : 1129
% 0.27/0.69 % ...aggressively subsumed : 0
% 0.27/0.69 % Contextual simplify-reflections : 23
% 0.27/0.69 % Paramodulations : 1220
% 0.27/0.69 % Factorizations : 0
% 0.27/0.69 % NegExts : 0
% 0.27/0.69 % Equation resolutions : 63
% 0.27/0.69 % Disequality decompositions : 0
% 0.27/0.69 % Total rewrite steps : 1414
% 0.27/0.69 % ...of those cached : 1302
% 0.27/0.69 % Propositional unsat checks : 0
% 0.27/0.69 % Propositional check models : 0
% 0.27/0.69 % Propositional check unsatisfiable : 0
% 0.27/0.69 % Propositional clauses : 0
% 0.27/0.69 % Propositional clauses after purity: 0
% 0.27/0.69 % Propositional unsat core size : 0
% 0.27/0.69 % Propositional preprocessing time : 0.000
% 0.27/0.69 % Propositional encoding time : 0.000
% 0.27/0.69 % Propositional solver time : 0.000
% 0.27/0.69 % Success case prop preproc time : 0.000
% 0.27/0.69 % Success case prop encoding time : 0.000
% 0.27/0.69 % Success case prop solver time : 0.000
% 0.27/0.69 % Current number of processed clauses : 348
% 0.27/0.69 % Positive orientable unit clauses : 98
% 0.27/0.69 % Positive unorientable unit clauses: 0
% 0.27/0.69 % Negative unit clauses : 4
% 0.27/0.69 % Non-unit-clauses : 246
% 0.27/0.69 % Current number of unprocessed clauses: 806
% 0.27/0.69 % ...number of literals in the above : 4189
% 0.27/0.69 % Current number of archived formulas : 0
% 0.27/0.69 % Current number of archived clauses : 44
% 0.27/0.69 % Clause-clause subsumption calls (NU) : 18746
% 0.27/0.69 % Rec. Clause-clause subsumption calls : 5302
% 0.27/0.69 % Non-unit clause-clause subsumptions : 94
% 0.27/0.69 % Unit Clause-clause subsumption calls : 218
% 0.27/0.69 % Rewrite failures with RHS unbound : 0
% 0.27/0.69 % BW rewrite match attempts : 35
% 0.27/0.69 % BW rewrite match successes : 16
% 0.27/0.69 % Condensation attempts : 0
% 0.27/0.69 % Condensation successes : 0
% 0.27/0.69 % Termbank termtop insertions : 37153
% 0.27/0.69 % Search garbage collected termcells : 538
% 0.27/0.69
% 0.27/0.69 % -------------------------------------------------
% 0.27/0.69 % User time : 0.101 s
% 0.27/0.69 % System time : 0.009 s
% 0.27/0.69 % Total time : 0.110 s
% 0.27/0.69 % Maximum resident set size: 3816 pages
% 0.27/0.69
% 0.27/0.69 % -------------------------------------------------
% 0.27/0.69 % User time : 0.490 s
% 0.27/0.69 % System time : 0.049 s
% 0.27/0.69 % Total time : 0.539 s
% 0.27/0.69 % Maximum resident set size: 4864 pages
% 0.27/0.69 % E exiting
%------------------------------------------------------------------------------