%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC193-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:24 PM UTC 2026
% Result : Unsatisfiable 1.08s 0.71s
% Output : CNFRefutation 1.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 29
% Syntax : Number of clauses : 109 ( 43 unt; 8 nHn; 99 RR)
% Number of literals : 277 ( 58 equ; 172 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 125 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
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_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(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(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(co1_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_9,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
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(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
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(clause64,axiom,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause64) ).
cnf(co1_14,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause180,axiom,
( ~ ssList(X5)
| ~ equalelemsP(X5)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| app(X1,cons(X2,cons(X3,X4))) != X5
| X2 = X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause180) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_13,negated_conjecture,
sk5 != sk6,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause127,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause127) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause56,axiom,
( ~ ssList(X1)
| segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause1,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause1) ).
cnf(c_0_29,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_30,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_12 ).
cnf(c_0_31,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_29 ).
cnf(c_0_32,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_34,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_35,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil))
| app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_33 ).
cnf(c_0_37,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_38,axiom,
ssList(nil),
clause8 ).
cnf(c_0_39,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_34 ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_42,negated_conjecture,
ssItem(sk6),
co1_9 ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_44,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_39]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_40 ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_47,negated_conjecture,
app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_36]),c_0_42]),c_0_38])]) ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_43 ).
cnf(c_0_49,plain,
( ~ duplicatefreeP(app(cons(X1,X2),cons(X1,X3)))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(app(cons(X1,X2),cons(X1,X3)))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_38])]),c_0_36]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_46 ).
cnf(c_0_51,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_52,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_37])]) ).
cnf(c_0_54,plain,
( ~ duplicatefreeP(app(cons(skaf44(X1),X2),X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(app(cons(skaf44(X1),X2),X1))
| ~ singletonP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_38])]) ).
cnf(c_0_55,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_52 ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_57,negated_conjecture,
app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_36]),c_0_42]),c_0_38])]) ).
cnf(c_0_58,negated_conjecture,
ssList(sk8),
co1_11 ).
cnf(c_0_59,plain,
( ~ duplicatefreeP(app(X1,X1))
| ~ ssList(X1)
| ~ ssList(app(X1,X1))
| ~ singletonP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_50]),c_0_38])]) ).
cnf(c_0_60,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_56 ).
cnf(c_0_62,negated_conjecture,
( ~ ssList(cons(sk5,cons(sk6,nil)))
| app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_57]),c_0_32]),c_0_58])]) ).
cnf(c_0_63,plain,
( ~ duplicatefreeP(cons(X1,cons(X1,nil)))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_48]),c_0_36]),c_0_60]) ).
cnf(c_0_64,plain,
( ~ ssList(X3)
| ~ ssItem(X2)
| duplicatefreeP(cons(X2,X3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_36]) ).
cnf(c_0_65,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_36]),c_0_37])]) ).
cnf(c_0_66,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_67,plain,
( ~ ssList(cons(X2,nil))
| ~ ssItem(X2)
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_36]),c_0_42]),c_0_38])]) ).
cnf(c_0_69,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_66 ).
cnf(c_0_70,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause64]) ).
cnf(c_0_71,plain,
( ~ ssItem(X2)
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_36]),c_0_38])]) ).
cnf(c_0_72,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_73,plain,
( ~ ssList(X5)
| ~ equalelemsP(X5)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| app(X1,cons(X2,cons(X3,X4))) != X5
| X2 = X3 ),
inference(fof_simplification,[status(thm)],[clause180]) ).
cnf(c_0_74,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_37]),c_0_58])]) ).
cnf(c_0_75,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
c_0_70 ).
cnf(c_0_76,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_71,c_0_42]) ).
cnf(c_0_77,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
c_0_72 ).
cnf(c_0_78,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_79,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_80,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_81,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_82,plain,
( ~ ssList(X5)
| ~ equalelemsP(X5)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| app(X1,cons(X2,cons(X3,X4))) != X5
| X2 = X3 ),
c_0_73 ).
cnf(c_0_83,negated_conjecture,
app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_36]),c_0_42]),c_0_38])]) ).
cnf(c_0_84,negated_conjecture,
sk5 != sk6,
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_85,plain,
equalelemsP(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]) ).
cnf(c_0_86,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk1) ),
inference(rw,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_87,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_79 ).
cnf(c_0_88,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_89,plain,
( ~ equalelemsP(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(X3,cons(X1,cons(X2,X4))))
| ~ ssItem(X1)
| ~ ssItem(X2)
| X1 = X2 ),
inference(er,[status(thm)],[c_0_82]) ).
cnf(c_0_90,negated_conjecture,
app(sk7,cons(sk5,cons(sk6,sk8))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_48]),c_0_42]),c_0_58])]) ).
cnf(c_0_91,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_92,negated_conjecture,
sk5 != sk6,
c_0_84 ).
cnf(c_0_93,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[clause127]) ).
cnf(c_0_94,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_95,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_96,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| equalelemsP(X1) ),
inference(spm,[status(thm)],[c_0_85,c_0_50]) ).
cnf(c_0_97,negated_conjecture,
( singletonP(sk1)
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]),c_0_38])]) ).
cnf(c_0_98,negated_conjecture,
~ equalelemsP(sk1),
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(spm,[status(thm)],[c_0_89,c_0_90]),c_0_42]),c_0_37]),c_0_91]),c_0_58]),c_0_32])]),c_0_92]) ).
cnf(c_0_99,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
c_0_93 ).
cnf(c_0_100,negated_conjecture,
segmentP(sk4,sk1),
inference(rw,[status(thm)],[c_0_94,c_0_78]) ).
cnf(c_0_101,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_95 ).
cnf(c_0_102,negated_conjecture,
nil = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_91])]),c_0_98]) ).
cnf(c_0_103,axiom,
equalelemsP(nil),
clause1 ).
cnf(c_0_104,negated_conjecture,
( ~ segmentP(sk1,sk4)
| sk4 = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_88]),c_0_91])]) ).
cnf(c_0_105,plain,
( ~ ssList(X1)
| segmentP(X1,sk4) ),
inference(rw,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_106,plain,
equalelemsP(sk4),
inference(rw,[status(thm)],[c_0_103,c_0_102]) ).
cnf(c_0_107,negated_conjecture,
sk4 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_91])]) ).
cnf(c_0_108,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_107]),c_0_98]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC193-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n005.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 08:03:19 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.52 Running first-order theorem proving
% 0.24/0.52 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
% 1.08/0.71 % Version: 3.5.1
% 1.08/0.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.08/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.08/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.08/0.71 % Starting new_bool_3 with 300s (1) cores
% 1.08/0.71 % Starting new_bool_1 with 300s (1) cores
% 1.08/0.71 % Starting sh5l with 300s (1) cores
% 1.08/0.71 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2971873 completed with status 0
% 1.08/0.71 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.08/0.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.08/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.08/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.08/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.08/0.71 % No SInE strategy applied
% 1.08/0.71 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.08/0.71 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.08/0.71 % Starting SubtermCWHack with 136s (1) cores
% 1.08/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.08/0.71 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.08/0.71 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.08/0.71 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.08/0.71 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 2971882 completed with status 0
% 1.08/0.71 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 1.08/0.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.08/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.08/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.08/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.08/0.71 % No SInE strategy applied
% 1.08/0.71 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.08/0.71 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.08/0.71 % Starting SubtermCWHack with 136s (1) cores
% 1.08/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.08/0.71 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.08/0.71 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.08/0.71 % Preprocessing time : 0.005 s
% 1.08/0.71
% 1.08/0.71 % Proof found!
% 1.08/0.71 % SZS status Unsatisfiable
% 1.08/0.71 % SZS output start CNFRefutation
% See solution above
% 1.08/0.71 % Parsed axioms : 199
% 1.08/0.71 % Removed by relevancy pruning/SinE : 0
% 1.08/0.71 % Initial clauses : 199
% 1.08/0.71 % Removed in clause preprocessing : 0
% 1.08/0.71 % Initial clauses in saturation : 199
% 1.08/0.71 % Processed clauses : 678
% 1.08/0.71 % ...of these trivial : 13
% 1.08/0.71 % ...subsumed : 108
% 1.08/0.71 % ...remaining for further processing : 557
% 1.08/0.71 % Other redundant clauses eliminated : 66
% 1.08/0.71 % Clauses deleted for lack of memory : 0
% 1.08/0.71 % Backward-subsumed : 52
% 1.08/0.71 % Backward-rewritten : 271
% 1.08/0.71 % Generated clauses : 1933
% 1.08/0.71 % ...of the previous two non-redundant : 1876
% 1.08/0.71 % ...aggressively subsumed : 0
% 1.08/0.71 % Contextual simplify-reflections : 25
% 1.08/0.71 % Paramodulations : 1862
% 1.08/0.71 % Factorizations : 0
% 1.08/0.71 % NegExts : 0
% 1.08/0.71 % Equation resolutions : 72
% 1.08/0.71 % Disequality decompositions : 0
% 1.08/0.71 % Total rewrite steps : 2323
% 1.08/0.71 % ...of those cached : 2158
% 1.08/0.71 % Propositional unsat checks : 0
% 1.08/0.71 % Propositional check models : 0
% 1.08/0.71 % Propositional check unsatisfiable : 0
% 1.08/0.71 % Propositional clauses : 0
% 1.08/0.71 % Propositional clauses after purity: 0
% 1.08/0.71 % Propositional unsat core size : 0
% 1.08/0.71 % Propositional preprocessing time : 0.000
% 1.08/0.71 % Propositional encoding time : 0.000
% 1.08/0.71 % Propositional solver time : 0.000
% 1.08/0.71 % Success case prop preproc time : 0.000
% 1.08/0.71 % Success case prop encoding time : 0.000
% 1.08/0.71 % Success case prop solver time : 0.000
% 1.08/0.71 % Current number of processed clauses : 211
% 1.08/0.71 % Positive orientable unit clauses : 78
% 1.08/0.71 % Positive unorientable unit clauses: 0
% 1.08/0.71 % Negative unit clauses : 5
% 1.08/0.71 % Non-unit-clauses : 128
% 1.08/0.71 % Current number of unprocessed clauses: 1346
% 1.08/0.71 % ...number of literals in the above : 6662
% 1.08/0.71 % Current number of archived formulas : 0
% 1.08/0.71 % Current number of archived clauses : 323
% 1.08/0.71 % Clause-clause subsumption calls (NU) : 26333
% 1.08/0.71 % Rec. Clause-clause subsumption calls : 7576
% 1.08/0.71 % Non-unit clause-clause subsumptions : 113
% 1.08/0.71 % Unit Clause-clause subsumption calls : 1635
% 1.08/0.71 % Rewrite failures with RHS unbound : 0
% 1.08/0.71 % BW rewrite match attempts : 80
% 1.08/0.71 % BW rewrite match successes : 48
% 1.08/0.71 % Condensation attempts : 0
% 1.08/0.71 % Condensation successes : 0
% 1.08/0.71 % Termbank termtop insertions : 50411
% 1.08/0.71 % Search garbage collected termcells : 532
% 1.08/0.71
% 1.08/0.71 % -------------------------------------------------
% 1.08/0.71 % User time : 0.135 s
% 1.08/0.71 % System time : 0.015 s
% 1.08/0.71 % Total time : 0.150 s
% 1.08/0.71 % Maximum resident set size: 4068 pages
% 1.08/0.71
% 1.08/0.71 % -------------------------------------------------
% 1.08/0.71 % User time : 0.529 s
% 1.08/0.71 % System time : 0.042 s
% 1.08/0.71 % Total time : 0.571 s
% 1.08/0.71 % Maximum resident set size: 5120 pages
% 1.08/0.71 % E exiting
%------------------------------------------------------------------------------