%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC174-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 : n015.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:45:15 PM UTC 2026
% Result : Unsatisfiable 0.24s 5.85s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 28
% Syntax : Number of clauses : 129 ( 49 unt; 11 nHn; 121 RR)
% Number of literals : 326 ( 81 equ; 199 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 146 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_13,negated_conjecture,
~ neq(sk5,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(clause102,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(co1_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_9,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_12,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
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(co1_10,negated_conjecture,
ssList(sk7),
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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
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_11,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause144,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause132,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause150,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause179,axiom,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause183,axiom,
( ~ ssList(X6)
| ~ strictorderP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X4,X2)
| lt(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause183) ).
cnf(clause68,axiom,
( ~ ssItem(X1)
| strictorderP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause68) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_7,negated_conjecture,
singletonP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause63,axiom,
( ~ ssItem(X1)
| ~ lt(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause63) ).
cnf(c_0_28,negated_conjecture,
~ neq(sk5,sk6),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_29,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_30,negated_conjecture,
~ neq(sk5,sk6),
c_0_28 ).
cnf(c_0_31,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_29 ).
cnf(c_0_32,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_33,negated_conjecture,
ssItem(sk6),
co1_9 ).
cnf(c_0_34,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_12 ).
cnf(c_0_35,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_36,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_37,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk5,nil)),sk8) = sk1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_36 ).
cnf(c_0_39,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_40,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(sk7,app(cons(sk5,nil),cons(sk5,nil))),sk8) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_40 ).
cnf(c_0_43,axiom,
ssList(nil),
clause8 ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_45,negated_conjecture,
app(app(sk7,app(cons(sk5,nil),cons(sk5,nil))),sk8) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_32]),c_0_43])]) ).
cnf(c_0_46,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_44 ).
cnf(c_0_47,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(sk7,cons(sk5,cons(sk5,nil))),sk8) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_32])]) ).
cnf(c_0_48,negated_conjecture,
app(app(sk7,cons(sk5,cons(sk5,nil))),sk8) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_42]),c_0_32]),c_0_43])]) ).
cnf(c_0_49,negated_conjecture,
ssList(sk8),
co1_11 ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(cons(sk5,cons(sk5,nil)))
| app(sk7,app(cons(sk5,cons(sk5,nil)),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_48]),c_0_39]),c_0_49])]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(sk7,app(cons(sk5,cons(sk5,nil)),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_42]),c_0_32])]) ).
cnf(c_0_52,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_53,negated_conjecture,
app(sk7,app(cons(sk5,cons(sk5,nil)),sk8)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_42]),c_0_32]),c_0_43])]) ).
cnf(c_0_54,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_52 ).
cnf(c_0_55,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(sk7,cons(sk5,app(cons(sk5,nil),sk8))) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_32]),c_0_49])]) ).
cnf(c_0_58,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
c_0_55 ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_56 ).
cnf(c_0_60,negated_conjecture,
app(sk7,cons(sk5,app(cons(sk5,nil),sk8))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_42]),c_0_32]),c_0_43])]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_58]),c_0_59]) ).
cnf(c_0_62,negated_conjecture,
app(sk7,cons(sk5,cons(sk5,sk8))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_46]),c_0_32]),c_0_49])]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssList(cons(sk5,cons(sk5,sk8)))
| frontsegP(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_39])]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_65,negated_conjecture,
( ~ ssList(cons(sk5,sk8))
| frontsegP(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_42]),c_0_32])]) ).
cnf(c_0_66,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_67,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_64 ).
cnf(c_0_68,negated_conjecture,
frontsegP(sk1,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_42]),c_0_32]),c_0_49])]) ).
cnf(c_0_69,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_70,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != app(X1,X3)
| X2 = X3 ),
c_0_66 ).
cnf(c_0_71,negated_conjecture,
app(sk7,skaf45(sk1,sk7)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_39]),c_0_69])]) ).
cnf(c_0_72,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_73,negated_conjecture,
( ~ ssList(X1)
| app(sk7,X1) != sk1
| skaf45(sk1,sk7) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]),c_0_39])]) ).
cnf(c_0_74,negated_conjecture,
( ~ ssList(app(cons(sk5,cons(sk5,nil)),sk8))
| app(cons(sk5,cons(sk5,nil)),sk8) = skaf45(sk1,sk7) ),
inference(spm,[status(thm)],[c_0_73,c_0_53]) ).
cnf(c_0_75,negated_conjecture,
( ~ ssList(cons(sk5,cons(sk5,nil)))
| app(cons(sk5,cons(sk5,nil)),sk8) = skaf45(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_59]),c_0_49])]) ).
cnf(c_0_76,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(cons(sk5,cons(sk5,nil)),sk8) = skaf45(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_42]),c_0_32])]) ).
cnf(c_0_77,negated_conjecture,
app(cons(sk5,cons(sk5,nil)),sk8) = skaf45(sk1,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_42]),c_0_32]),c_0_43])]) ).
cnf(c_0_78,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_79,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| cons(sk5,app(cons(sk5,nil),sk8)) = skaf45(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_77]),c_0_32]),c_0_49])]) ).
cnf(c_0_80,negated_conjecture,
( ~ ssList(cons(sk5,cons(sk5,sk8)))
| cons(sk5,cons(sk5,sk8)) = skaf45(sk1,sk7) ),
inference(spm,[status(thm)],[c_0_73,c_0_62]) ).
cnf(c_0_81,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_78 ).
cnf(c_0_82,negated_conjecture,
cons(sk5,app(cons(sk5,nil),sk8)) = skaf45(sk1,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_42]),c_0_32]),c_0_43])]) ).
cnf(c_0_83,negated_conjecture,
( ~ ssList(cons(sk5,sk8))
| cons(sk5,cons(sk5,sk8)) = skaf45(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_42]),c_0_32])]) ).
cnf(c_0_84,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_38]),c_0_49])]),c_0_35]),c_0_35]) ).
cnf(c_0_85,negated_conjecture,
( ~ ssList(app(cons(sk5,nil),sk8))
| app(cons(sk5,nil),sk8) = tl(skaf45(sk1,sk7)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_32])]) ).
cnf(c_0_86,negated_conjecture,
cons(sk5,cons(sk5,sk8)) = skaf45(sk1,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_42]),c_0_32]),c_0_49])]) ).
cnf(c_0_87,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,nil)))
| app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_42]),c_0_32]),c_0_43])]) ).
cnf(c_0_88,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(cons(sk5,nil),sk8) = tl(skaf45(sk1,sk7)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_59]),c_0_49])]) ).
cnf(c_0_89,negated_conjecture,
( ~ ssList(cons(sk5,sk8))
| cons(sk5,sk8) = tl(skaf45(sk1,sk7)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_86]),c_0_32])]) ).
cnf(c_0_90,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_91,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_59]),c_0_39])]) ).
cnf(c_0_92,negated_conjecture,
app(cons(sk5,nil),sk8) = tl(skaf45(sk1,sk7)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_42]),c_0_32]),c_0_43])]) ).
cnf(c_0_93,negated_conjecture,
cons(sk5,sk8) = tl(skaf45(sk1,sk7)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_42]),c_0_32]),c_0_49])]) ).
cnf(c_0_94,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
c_0_90 ).
cnf(c_0_95,negated_conjecture,
app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_42]),c_0_32]),c_0_43])]) ).
cnf(c_0_96,negated_conjecture,
cons(sk5,app(nil,sk8)) = tl(skaf45(sk1,sk7)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_92]),c_0_32]),c_0_49]),c_0_43])]) ).
cnf(c_0_97,negated_conjecture,
tl(tl(skaf45(sk1,sk7))) = sk8,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_93]),c_0_32]),c_0_49])]) ).
cnf(c_0_98,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_99,plain,
( ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_94]) ).
cnf(c_0_100,negated_conjecture,
app(app(sk7,cons(sk5,nil)),cons(sk5,app(nil,sk8))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_54]),c_0_32]),c_0_49]),c_0_43])]) ).
cnf(c_0_101,negated_conjecture,
( ~ ssList(app(nil,sk8))
| app(nil,sk8) = sk8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_96]),c_0_97]),c_0_32])]) ).
cnf(c_0_102,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_98 ).
cnf(c_0_103,negated_conjecture,
( ~ duplicatefreeP(sk1)
| ~ ssList(app(nil,sk8)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_32]),c_0_69]),c_0_43]),c_0_39])]) ).
cnf(c_0_104,negated_conjecture,
app(nil,sk8) = sk8,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_59]),c_0_43]),c_0_49])]) ).
cnf(c_0_105,plain,
( ~ ssList(X6)
| ~ strictorderP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X4,X2)
| lt(X2,X4) ),
inference(fof_simplification,[status(thm)],[clause183]) ).
cnf(c_0_106,plain,
( ~ ssItem(X1)
| strictorderP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause68]) ).
cnf(c_0_107,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| duplicatefreeP(app(X2,X3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_102,c_0_59]) ).
cnf(c_0_108,negated_conjecture,
~ duplicatefreeP(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104]),c_0_49])]) ).
cnf(c_0_109,plain,
( ~ ssList(X6)
| ~ strictorderP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X4,X2)
| lt(X2,X4) ),
c_0_105 ).
cnf(c_0_110,plain,
( ~ ssItem(X1)
| strictorderP(cons(X1,nil)) ),
c_0_106 ).
cnf(c_0_111,negated_conjecture,
ssItem(X1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_71]),c_0_39]),c_0_72])]),c_0_108]) ).
cnf(c_0_112,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_113,plain,
( ~ strictorderP(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ ssItem(X2)
| ~ ssItem(X1)
| lt(X2,X1)
| lt(X1,X2) ),
inference(er,[status(thm)],[c_0_109]) ).
cnf(c_0_114,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_115,plain,
strictorderP(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_110,c_0_111])]) ).
cnf(c_0_116,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_112 ).
cnf(c_0_117,negated_conjecture,
singletonP(sk3),
co1_7 ).
cnf(c_0_118,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_119,plain,
( ~ ssItem(X1)
| ~ lt(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause63]) ).
cnf(c_0_120,negated_conjecture,
( ~ strictorderP(sk1)
| ~ ssList(app(nil,sk8))
| lt(sk5,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_100]),c_0_32]),c_0_69]),c_0_43]),c_0_39])]) ).
cnf(c_0_121,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_114 ).
cnf(c_0_122,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| strictorderP(X1) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_123,negated_conjecture,
singletonP(sk1),
inference(rw,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_124,plain,
( ~ ssItem(X1)
| ~ lt(X1,X1) ),
c_0_119 ).
cnf(c_0_125,negated_conjecture,
( ~ strictorderP(sk1)
| lt(sk5,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_49])]) ).
cnf(c_0_126,negated_conjecture,
strictorderP(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_69])]) ).
cnf(c_0_127,plain,
~ lt(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_111])]) ).
cnf(c_0_128,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_126])]),c_0_127]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC174-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.62 % Computer : n015.cluster.edu
% 0.20/5.62 % Model : x86_64 x86_64
% 0.20/5.62 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/5.62 % Memory : 8046.5625MB
% 0.20/5.62 % OS : Linux 6.8.0-71-generic
% 0.20/5.62 % CPULimit : 300
% 0.20/5.62 % WCLimit : 300
% 0.20/5.62 % DateTime : Mon Sep 21 08:05:11 UTC 2026
% 0.20/5.62 % CPUTime :
% 0.20/5.62 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/5.67 Running first-order theorem proving
% 0.20/5.67 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
% 0.24/5.85 % Version: 3.5.1
% 0.24/5.85 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.85 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.85 % Starting new_bool_3 with 300s (1) cores
% 0.24/5.85 % Starting new_bool_1 with 300s (1) cores
% 0.24/5.85 % Starting sh5l with 300s (1) cores
% 0.24/5.85 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 992036 completed with status 0
% 0.24/5.85 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/5.85 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.85 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/5.85 % No SInE strategy applied
% 0.24/5.85 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.24/5.85 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/5.85 % Starting SubtermCWHack with 136s (1) cores
% 0.24/5.85 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/5.85 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.24/5.85 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.24/5.85 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.24/5.85 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 992046 completed with status 0
% 0.24/5.85 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.24/5.85 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/5.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/5.85 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/5.85 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/5.85 % No SInE strategy applied
% 0.24/5.85 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.24/5.85 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/5.85 % Starting SubtermCWHack with 136s (1) cores
% 0.24/5.85 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/5.85 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.24/5.85 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.24/5.85 % Preprocessing time : 0.005 s
% 0.24/5.85
% 0.24/5.85 % Proof found!
% 0.24/5.85 % SZS status Unsatisfiable
% 0.24/5.85 % SZS output start CNFRefutation
% See solution above
% 0.24/5.85 % Parsed axioms : 198
% 0.24/5.85 % Removed by relevancy pruning/SinE : 0
% 0.24/5.85 % Initial clauses : 198
% 0.24/5.85 % Removed in clause preprocessing : 0
% 0.24/5.85 % Initial clauses in saturation : 198
% 0.24/5.85 % Processed clauses : 732
% 0.24/5.85 % ...of these trivial : 20
% 0.24/5.85 % ...subsumed : 116
% 0.24/5.85 % ...remaining for further processing : 596
% 0.24/5.85 % Other redundant clauses eliminated : 76
% 0.24/5.85 % Clauses deleted for lack of memory : 0
% 0.24/5.85 % Backward-subsumed : 80
% 0.24/5.85 % Backward-rewritten : 206
% 0.24/5.85 % Generated clauses : 2136
% 0.24/5.85 % ...of the previous two non-redundant : 1884
% 0.24/5.85 % ...aggressively subsumed : 0
% 0.24/5.85 % Contextual simplify-reflections : 6
% 0.24/5.85 % Paramodulations : 2055
% 0.24/5.85 % Factorizations : 0
% 0.24/5.85 % NegExts : 0
% 0.24/5.85 % Equation resolutions : 82
% 0.24/5.85 % Disequality decompositions : 0
% 0.24/5.85 % Total rewrite steps : 2902
% 0.24/5.85 % ...of those cached : 2721
% 0.24/5.85 % Propositional unsat checks : 0
% 0.24/5.85 % Propositional check models : 0
% 0.24/5.85 % Propositional check unsatisfiable : 0
% 0.24/5.85 % Propositional clauses : 0
% 0.24/5.85 % Propositional clauses after purity: 0
% 0.24/5.85 % Propositional unsat core size : 0
% 0.24/5.85 % Propositional preprocessing time : 0.000
% 0.24/5.85 % Propositional encoding time : 0.000
% 0.24/5.85 % Propositional solver time : 0.000
% 0.24/5.85 % Success case prop preproc time : 0.000
% 0.24/5.85 % Success case prop encoding time : 0.000
% 0.24/5.85 % Success case prop solver time : 0.000
% 0.24/5.85 % Current number of processed clauses : 287
% 0.24/5.85 % Positive orientable unit clauses : 113
% 0.24/5.85 % Positive unorientable unit clauses: 0
% 0.24/5.85 % Negative unit clauses : 12
% 0.24/5.85 % Non-unit-clauses : 162
% 0.24/5.85 % Current number of unprocessed clauses: 1280
% 0.24/5.85 % ...number of literals in the above : 6221
% 0.24/5.85 % Current number of archived formulas : 0
% 0.24/5.85 % Current number of archived clauses : 286
% 0.24/5.85 % Clause-clause subsumption calls (NU) : 16934
% 0.24/5.85 % Rec. Clause-clause subsumption calls : 9653
% 0.24/5.85 % Non-unit clause-clause subsumptions : 113
% 0.24/5.85 % Unit Clause-clause subsumption calls : 1248
% 0.24/5.85 % Rewrite failures with RHS unbound : 0
% 0.24/5.85 % BW rewrite match attempts : 110
% 0.24/5.85 % BW rewrite match successes : 72
% 0.24/5.85 % Condensation attempts : 0
% 0.24/5.85 % Condensation successes : 0
% 0.24/5.85 % Termbank termtop insertions : 50928
% 0.24/5.85 % Search garbage collected termcells : 529
% 0.24/5.85
% 0.24/5.85 % -------------------------------------------------
% 0.24/5.85 % User time : 0.125 s
% 0.24/5.85 % System time : 0.015 s
% 0.24/5.85 % Total time : 0.140 s
% 0.24/5.85 % Maximum resident set size: 3812 pages
% 0.24/5.85
% 0.24/5.85 % -------------------------------------------------
% 0.24/5.85 % User time : 0.456 s
% 0.24/5.85 % System time : 0.046 s
% 0.24/5.85 % Total time : 0.502 s
% 0.24/5.85 % Maximum resident set size: 4864 pages
% 0.24/5.85 % E exiting
%------------------------------------------------------------------------------