%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC077-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:42:54 PM UTC 2026
% Result : Unsatisfiable 1.69s 0.63s
% Output : CNFRefutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 30
% Syntax : Number of clauses : 106 ( 26 unt; 7 nHn; 98 RR)
% Number of literals : 320 ( 60 equ; 227 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 137 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_9,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_10,negated_conjecture,
( ~ strictorderedP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(clause66,axiom,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause66) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause154,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| frontsegP(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause154) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(co1_7,negated_conjecture,
frontsegP(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(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause178,axiom,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(clause83,axiom,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause83) ).
cnf(co1_11,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause84,axiom,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause84) ).
cnf(clause137,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2)
| frontsegP(app(X1,X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause137) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_0_30,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_31,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_33,negated_conjecture,
( ~ strictorderedP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_35,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_36,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_37,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
c_0_30 ).
cnf(c_0_38,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_39,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_31 ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_32 ).
cnf(c_0_41,axiom,
ssList(nil),
clause8 ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_43,negated_conjecture,
( ~ strictorderedP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
c_0_33 ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_34 ).
cnf(c_0_45,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_46,plain,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause66]) ).
cnf(c_0_47,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| ~ neq(X1,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_36]),c_0_38]) ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(X2,X3) != X1
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_42 ).
cnf(c_0_50,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_51,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_52,negated_conjecture,
( ~ strictorderedP(X1)
| ~ ssList(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| X1 = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_53,plain,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
c_0_46 ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk3,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_44]),c_0_41])]) ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2)
| segmentP(X1,X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])])]) ).
cnf(c_0_57,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_51,c_0_38]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| frontsegP(X1,X3) ),
inference(fof_simplification,[status(thm)],[clause154]) ).
cnf(c_0_61,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| ~ segmentP(cons(X1,nil),sk3)
| ~ frontsegP(sk4,cons(X1,nil))
| cons(X1,nil) = sk3 ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_54 ).
cnf(c_0_63,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk3,X1)
| ~ frontsegP(sk4,X1)
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_58 ).
cnf(c_0_66,negated_conjecture,
frontsegP(sk4,sk3),
co1_7 ).
cnf(c_0_67,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_68,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_59 ).
cnf(c_0_69,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_70,plain,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ frontsegP(X1,X2)
| frontsegP(X1,X3) ),
c_0_60 ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause83]) ).
cnf(c_0_73,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_74,negated_conjecture,
( ~ ssList(X1)
| ~ singletonP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| X1 = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]) ).
cnf(c_0_75,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),c_0_45])]) ).
cnf(c_0_76,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_67 ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| X1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_62]),c_0_63]),c_0_41])]) ).
cnf(c_0_78,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_69 ).
cnf(c_0_79,plain,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
c_0_70 ).
cnf(c_0_80,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_81,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause84]) ).
cnf(c_0_82,negated_conjecture,
( ~ ssList(X1)
| ~ frontsegP(X1,sk4)
| frontsegP(X1,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_66]),c_0_45]),c_0_57])]) ).
cnf(c_0_83,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
c_0_72 ).
cnf(c_0_84,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_73 ).
cnf(c_0_85,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2)
| frontsegP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause137]) ).
cnf(c_0_86,negated_conjecture,
( ~ ssList(X1)
| ~ singletonP(X1)
| ~ frontsegP(sk4,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75]),c_0_75]),c_0_76]),c_0_77]) ).
cnf(c_0_87,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_78]) ).
cnf(c_0_88,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ~ frontsegP(X2,X3)
| frontsegP(cons(X1,X2),cons(X1,X3)) ),
inference(er,[status(thm)],[c_0_79]) ).
cnf(c_0_89,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_80 ).
cnf(c_0_90,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_91,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_92,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
c_0_81 ).
cnf(c_0_93,negated_conjecture,
( sk4 != nil
| frontsegP(nil,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_41]),c_0_57])]) ).
cnf(c_0_94,negated_conjecture,
( sk4 != nil
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_36]),c_0_38]) ).
cnf(c_0_95,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2)
| frontsegP(app(X1,X3),X2) ),
c_0_85 ).
cnf(c_0_96,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| ~ frontsegP(sk4,cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_97,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(skaf82(X1),X2)
| frontsegP(X1,cons(skaf83(X1),X2))
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_91])]) ).
cnf(c_0_98,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_45])]),c_0_94]) ).
cnf(c_0_99,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(nil,X2)
| frontsegP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_40]),c_0_41])]) ).
cnf(c_0_100,negated_conjecture,
( ~ ssList(cons(skaf83(sk4),nil))
| ~ frontsegP(skaf82(sk4),nil) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_90]),c_0_41]),c_0_57])]),c_0_98]) ).
cnf(c_0_101,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| frontsegP(X1,X2) ),
inference(spm,[status(thm)],[c_0_99,c_0_83]) ).
cnf(c_0_102,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_103,negated_conjecture,
~ ssList(cons(skaf83(sk4),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_91]),c_0_41])]) ).
cnf(c_0_104,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_102 ).
cnf(c_0_105,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_90]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC077-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 07:54:03 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.69/0.63 % Version: 3.5.1
% 1.69/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.69/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.69/0.63 % Starting new_bool_3 with 300s (1) cores
% 1.69/0.63 % Starting new_bool_1 with 300s (1) cores
% 1.69/0.63 % Starting sh5l with 300s (1) cores
% 1.69/0.63 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2951765 completed with status 0
% 1.69/0.63 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.69/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.69/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.69/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.69/0.63 % No SInE strategy applied
% 1.69/0.63 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.69/0.63 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.69/0.63 % Starting SubtermCWHack with 136s (1) cores
% 1.69/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.69/0.63 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.69/0.63 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.69/0.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.69/0.63 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 2951774 completed with status 0
% 1.69/0.63 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 1.69/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.69/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.69/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.69/0.63 % No SInE strategy applied
% 1.69/0.63 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.69/0.63 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.69/0.63 % Starting SubtermCWHack with 136s (1) cores
% 1.69/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.69/0.63 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.69/0.63 % Preprocessing time : 0.004 s
% 1.69/0.63 % Presaturation interreduction done
% 1.69/0.63
% 1.69/0.63 % Proof found!
% 1.69/0.63 % SZS status Unsatisfiable
% 1.69/0.63 % SZS output start CNFRefutation
% See solution above
% 1.69/0.63 % Parsed axioms : 196
% 1.69/0.63 % Removed by relevancy pruning/SinE : 0
% 1.69/0.63 % Initial clauses : 196
% 1.69/0.63 % Removed in clause preprocessing : 0
% 1.69/0.63 % Initial clauses in saturation : 196
% 1.69/0.63 % Processed clauses : 1605
% 1.69/0.63 % ...of these trivial : 83
% 1.69/0.63 % ...subsumed : 703
% 1.69/0.63 % ...remaining for further processing : 819
% 1.69/0.63 % Other redundant clauses eliminated : 181
% 1.69/0.63 % Clauses deleted for lack of memory : 0
% 1.69/0.63 % Backward-subsumed : 21
% 1.69/0.63 % Backward-rewritten : 171
% 1.69/0.63 % Generated clauses : 5493
% 1.69/0.63 % ...of the previous two non-redundant : 4763
% 1.69/0.63 % ...aggressively subsumed : 0
% 1.69/0.63 % Contextual simplify-reflections : 101
% 1.69/0.63 % Paramodulations : 5266
% 1.69/0.63 % Factorizations : 0
% 1.69/0.63 % NegExts : 0
% 1.69/0.63 % Equation resolutions : 214
% 1.69/0.63 % Disequality decompositions : 0
% 1.69/0.63 % Total rewrite steps : 4204
% 1.69/0.63 % ...of those cached : 4004
% 1.69/0.63 % Propositional unsat checks : 0
% 1.69/0.63 % Propositional check models : 0
% 1.69/0.63 % Propositional check unsatisfiable : 0
% 1.69/0.63 % Propositional clauses : 0
% 1.69/0.63 % Propositional clauses after purity: 0
% 1.69/0.63 % Propositional unsat core size : 0
% 1.69/0.63 % Propositional preprocessing time : 0.000
% 1.69/0.63 % Propositional encoding time : 0.000
% 1.69/0.63 % Propositional solver time : 0.000
% 1.69/0.63 % Success case prop preproc time : 0.000
% 1.69/0.63 % Success case prop encoding time : 0.000
% 1.69/0.63 % Success case prop solver time : 0.000
% 1.69/0.63 % Current number of processed clauses : 425
% 1.69/0.63 % Positive orientable unit clauses : 63
% 1.69/0.63 % Positive unorientable unit clauses: 0
% 1.69/0.63 % Negative unit clauses : 12
% 1.69/0.63 % Non-unit-clauses : 350
% 1.69/0.63 % Current number of unprocessed clauses: 3400
% 1.69/0.63 % ...number of literals in the above : 22729
% 1.69/0.63 % Current number of archived formulas : 0
% 1.69/0.63 % Current number of archived clauses : 384
% 1.69/0.63 % Clause-clause subsumption calls (NU) : 54980
% 1.69/0.63 % Rec. Clause-clause subsumption calls : 10650
% 1.69/0.63 % Non-unit clause-clause subsumptions : 688
% 1.69/0.63 % Unit Clause-clause subsumption calls : 2438
% 1.69/0.63 % Rewrite failures with RHS unbound : 0
% 1.69/0.63 % BW rewrite match attempts : 4
% 1.69/0.63 % BW rewrite match successes : 4
% 1.69/0.63 % Condensation attempts : 0
% 1.69/0.63 % Condensation successes : 0
% 1.69/0.63 % Termbank termtop insertions : 106660
% 1.69/0.63 % Search garbage collected termcells : 552
% 1.69/0.63
% 1.69/0.63 % -------------------------------------------------
% 1.69/0.63 % User time : 0.186 s
% 1.69/0.63 % System time : 0.011 s
% 1.69/0.63 % Total time : 0.197 s
% 1.69/0.63 % Maximum resident set size: 4068 pages
% 1.69/0.63
% 1.69/0.63 % -------------------------------------------------
% 1.69/0.63 % User time : 0.917 s
% 1.69/0.63 % System time : 0.064 s
% 1.69/0.63 % Total time : 0.980 s
% 1.69/0.63 % Maximum resident set size: 4864 pages
% 1.69/0.63 % E exiting
%------------------------------------------------------------------------------