%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC168-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 : n005.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:18 PM UTC 2026
% Result : Unsatisfiable 15.90s 2.73s
% Output : CNFRefutation 15.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 53 ( 26 unt; 3 nHn; 53 RR)
% Number of literals : 131 ( 22 equ; 82 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_18,negated_conjecture,
~ neq(sk7,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(clause102,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_17,negated_conjecture,
app(app(app(sk9,cons(sk7,nil)),cons(sk8,nil)),sk10) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_13,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_14,negated_conjecture,
ssItem(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_15,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
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(co1_16,negated_conjecture,
ssList(sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause63,axiom,
( ~ ssItem(X1)
| ~ lt(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause63) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_10,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_0_17,negated_conjecture,
~ neq(sk7,sk8),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_18,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_19,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_20,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_21,negated_conjecture,
app(app(app(sk9,cons(sk7,nil)),cons(sk8,nil)),sk10) = sk1,
co1_17 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
~ neq(sk7,sk8),
c_0_17 ).
cnf(c_0_24,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_18 ).
cnf(c_0_25,negated_conjecture,
ssItem(sk7),
co1_13 ).
cnf(c_0_26,negated_conjecture,
ssItem(sk8),
co1_14 ).
cnf(c_0_27,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_19 ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_20 ).
cnf(c_0_29,negated_conjecture,
app(app(app(sk9,cons(sk7,nil)),cons(sk8,nil)),sk10) = sk3,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,negated_conjecture,
sk8 = sk7,
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_31,negated_conjecture,
ssList(sk9),
co1_15 ).
cnf(c_0_32,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_33,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| app(app(X1,app(X2,X3)),X4) = app(app(X1,X2),app(X3,X4)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_27]),c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(cons(sk7,nil))
| app(app(sk9,app(cons(sk7,nil),cons(sk7,nil))),sk10) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_27]),c_0_30]),c_0_31]),c_0_30])]) ).
cnf(c_0_35,negated_conjecture,
ssList(sk10),
co1_16 ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
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) ),
c_0_32 ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(cons(sk7,nil))
| app(app(sk9,cons(sk7,nil)),app(cons(sk7,nil),sk10)) = 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_35]),c_0_31])]) ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_36 ).
cnf(c_0_40,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_41,plain,
( ~ ssItem(X1)
| ~ lt(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause63]) ).
cnf(c_0_42,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_37]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(cons(sk7,nil))
| app(app(sk9,cons(sk7,nil)),cons(sk7,sk10)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_25]),c_0_35])]) ).
cnf(c_0_44,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_40,c_0_22]) ).
cnf(c_0_45,axiom,
ssList(nil),
clause8 ).
cnf(c_0_46,negated_conjecture,
strictorderedP(sk3),
co1_10 ).
cnf(c_0_47,plain,
( ~ ssItem(X1)
| ~ lt(X1,X1) ),
c_0_41 ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(cons(sk7,nil))
| lt(sk7,sk7) ),
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(spm,[status(thm)],[c_0_42,c_0_43]),c_0_25]),c_0_44]),c_0_35]),c_0_45]),c_0_31]),c_0_46])]) ).
cnf(c_0_49,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_50,negated_conjecture,
~ ssList(cons(sk7,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_25])]) ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_49 ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_25]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC168-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n005.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 08:01:20 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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
% 15.90/2.73 % Version: 3.5.1
% 15.90/2.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 15.90/2.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.90/2.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 15.90/2.73 % Starting new_bool_3 with 300s (1) cores
% 15.90/2.73 % Starting new_bool_1 with 300s (1) cores
% 15.90/2.73 % Starting sh5l with 300s (1) cores
% 15.90/2.73 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2967517 completed with status 0
% 15.90/2.73 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 15.90/2.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 15.90/2.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.90/2.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 15.90/2.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.90/2.73 % No SInE strategy applied
% 15.90/2.73 % Search class: FGHSM-FSLM21-MFFFFFNN
% 15.90/2.73 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 15.90/2.73 % Starting SubtermCWHack with 136s (1) cores
% 15.90/2.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 15.90/2.73 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 15.90/2.73 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 15.90/2.73 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 15.90/2.73 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2967524 completed with status 0
% 15.90/2.73 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 15.90/2.73 % Preprocessing class: FSLSSMSMSSSNFFN.
% 15.90/2.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.90/2.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 15.90/2.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 15.90/2.73 % No SInE strategy applied
% 15.90/2.73 % Search class: FGHSM-FSLM21-MFFFFFNN
% 15.90/2.73 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 15.90/2.73 % Starting SubtermCWHack with 136s (1) cores
% 15.90/2.73 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 15.90/2.73 % Preprocessing time : 0.004 s
% 15.90/2.73 % Presaturation interreduction done
% 15.90/2.73
% 15.90/2.73 % Proof found!
% 15.90/2.73 % SZS status Unsatisfiable
% 15.90/2.73 % SZS output start CNFRefutation
% See solution above
% 15.90/2.73 % Parsed axioms : 204
% 15.90/2.73 % Removed by relevancy pruning/SinE : 0
% 15.90/2.73 % Initial clauses : 204
% 15.90/2.73 % Removed in clause preprocessing : 0
% 15.90/2.73 % Initial clauses in saturation : 204
% 15.90/2.73 % Processed clauses : 16959
% 15.90/2.73 % ...of these trivial : 730
% 15.90/2.73 % ...subsumed : 13706
% 15.90/2.73 % ...remaining for further processing : 2523
% 15.90/2.73 % Other redundant clauses eliminated : 399
% 15.90/2.73 % Clauses deleted for lack of memory : 0
% 15.90/2.73 % Backward-subsumed : 1275
% 15.90/2.73 % Backward-rewritten : 6
% 15.90/2.73 % Generated clauses : 99249
% 15.90/2.73 % ...of the previous two non-redundant : 90470
% 15.90/2.73 % ...aggressively subsumed : 0
% 15.90/2.73 % Contextual simplify-reflections : 328
% 15.90/2.73 % Paramodulations : 98844
% 15.90/2.73 % Factorizations : 0
% 15.90/2.73 % NegExts : 0
% 15.90/2.73 % Equation resolutions : 404
% 15.90/2.73 % Disequality decompositions : 0
% 15.90/2.73 % Total rewrite steps : 106242
% 15.90/2.73 % ...of those cached : 105726
% 15.90/2.73 % Propositional unsat checks : 0
% 15.90/2.73 % Propositional check models : 0
% 15.90/2.73 % Propositional check unsatisfiable : 0
% 15.90/2.73 % Propositional clauses : 0
% 15.90/2.73 % Propositional clauses after purity: 0
% 15.90/2.73 % Propositional unsat core size : 0
% 15.90/2.73 % Propositional preprocessing time : 0.000
% 15.90/2.73 % Propositional encoding time : 0.000
% 15.90/2.73 % Propositional solver time : 0.000
% 15.90/2.73 % Success case prop preproc time : 0.000
% 15.90/2.73 % Success case prop encoding time : 0.000
% 15.90/2.73 % Success case prop solver time : 0.000
% 15.90/2.73 % Current number of processed clauses : 1021
% 15.90/2.73 % Positive orientable unit clauses : 109
% 15.90/2.73 % Positive unorientable unit clauses: 0
% 15.90/2.73 % Negative unit clauses : 12
% 15.90/2.73 % Non-unit-clauses : 900
% 15.90/2.73 % Current number of unprocessed clauses: 68108
% 15.90/2.73 % ...number of literals in the above : 392730
% 15.90/2.73 % Current number of archived formulas : 0
% 15.90/2.73 % Current number of archived clauses : 1479
% 15.90/2.73 % Clause-clause subsumption calls (NU) : 1547741
% 15.90/2.73 % Rec. Clause-clause subsumption calls : 922401
% 15.90/2.73 % Non-unit clause-clause subsumptions : 13704
% 15.90/2.73 % Unit Clause-clause subsumption calls : 8696
% 15.90/2.73 % Rewrite failures with RHS unbound : 0
% 15.90/2.73 % BW rewrite match attempts : 18
% 15.90/2.73 % BW rewrite match successes : 17
% 15.90/2.73 % Condensation attempts : 0
% 15.90/2.73 % Condensation successes : 0
% 15.90/2.73 % Termbank termtop insertions : 1835335
% 15.90/2.73 % Search garbage collected termcells : 554
% 15.90/2.73
% 15.90/2.73 % -------------------------------------------------
% 15.90/2.73 % User time : 2.191 s
% 15.90/2.73 % System time : 0.073 s
% 15.90/2.73 % Total time : 2.264 s
% 15.90/2.73 % Maximum resident set size: 4072 pages
% 15.90/2.73
% 15.90/2.73 % -------------------------------------------------
% 15.90/2.73 % User time : 10.987 s
% 15.90/2.73 % System time : 0.396 s
% 15.90/2.73 % Total time : 11.383 s
% 15.90/2.73 % Maximum resident set size: 5120 pages
% 15.90/2.73 % E exiting
%------------------------------------------------------------------------------