TSTP Solution File: SWC285-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC285-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:25:15 EDT 2024
% Result : Unsatisfiable 0.79s 0.58s
% Output : CNFRefutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 37
% Syntax : Number of clauses : 143 ( 42 unt; 23 nHn; 128 RR)
% Number of literals : 394 ( 72 equ; 240 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-2 aty)
% Number of variables : 196 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_9,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(co1_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause141,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(co1_17,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(co1_13,negated_conjecture,
( memberP(sk6,sk8)
| memberP(sk7,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause161,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause175,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause175) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause127,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause127) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause62,axiom,
( leq(X1,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause62) ).
cnf(co1_16,negated_conjecture,
( ~ leq(sk8,sk5)
| ~ leq(sk5,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(c_0_37,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
co1_11 ).
cnf(c_0_38,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_39,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_40,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk3,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_39 ).
cnf(c_0_42,negated_conjecture,
ssList(sk6),
co1_9 ).
cnf(c_0_43,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_44,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_45,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_46,negated_conjecture,
( app(sk6,app(cons(sk5,nil),sk7)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_47,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_44 ).
cnf(c_0_48,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_49,axiom,
ssList(nil),
clause8 ).
cnf(c_0_50,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_51,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
c_0_45 ).
cnf(c_0_52,negated_conjecture,
app(sk6,app(cons(sk5,nil),sk7)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49])]) ).
cnf(c_0_53,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_50 ).
cnf(c_0_54,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_51]) ).
cnf(c_0_55,negated_conjecture,
app(sk6,cons(sk5,sk7)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_48]),c_0_43])]) ).
cnf(c_0_56,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssList(app(sk3,cons(sk5,X1)))
| ~ ssList(X1)
| ~ duplicatefreeP(app(sk3,cons(sk5,X1))) ),
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_55]),c_0_48]),c_0_43]),c_0_42])]) ).
cnf(c_0_58,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_56 ).
cnf(c_0_59,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_60,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_61,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_62,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk3,cons(sk5,X2)))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_59 ).
cnf(c_0_64,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_60,c_0_38]) ).
cnf(c_0_65,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_61 ).
cnf(c_0_66,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk5,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_67,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_65]),c_0_63]) ).
cnf(c_0_68,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_69,negated_conjecture,
( ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_47]),c_0_48])]) ).
cnf(c_0_70,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_71,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_72,negated_conjecture,
( rearsegP(sk3,sk7)
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_40]),c_0_43])]) ).
cnf(c_0_73,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_74,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_68 ).
cnf(c_0_75,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_77,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
c_0_71 ).
cnf(c_0_78,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_79,negated_conjecture,
( rearsegP(sk3,sk7)
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_63]),c_0_42])]) ).
cnf(c_0_80,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_73 ).
cnf(c_0_81,plain,
( hd(cons(X1,X2)) = X1
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]) ).
cnf(c_0_82,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_76 ).
cnf(c_0_83,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_84,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_85,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_86,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_87,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_88,plain,
( memberP(app(X1,X2),X3)
| ~ memberP(X2,X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_75])]) ).
cnf(c_0_89,negated_conjecture,
( memberP(sk6,sk8)
| memberP(sk7,sk8) ),
co1_13 ).
cnf(c_0_90,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_78 ).
cnf(c_0_91,negated_conjecture,
rearsegP(sk3,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_47]),c_0_48]),c_0_49])]) ).
cnf(c_0_92,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_80]),c_0_63]) ).
cnf(c_0_93,plain,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
inference(fof_simplification,[status(thm)],[clause161]) ).
cnf(c_0_94,plain,
( skaf44(X1) = hd(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_49])]) ).
cnf(c_0_95,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
c_0_83 ).
cnf(c_0_96,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_84 ).
cnf(c_0_97,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_98,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_99,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
c_0_87 ).
cnf(c_0_100,negated_conjecture,
( memberP(app(X1,sk7),sk8)
| memberP(sk6,sk8)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_43])]) ).
cnf(c_0_101,negated_conjecture,
app(skaf46(sk3,sk7),sk7) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_43]),c_0_64])]) ).
cnf(c_0_102,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_103,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_104,negated_conjecture,
( frontsegP(sk3,sk6)
| ~ ssList(cons(sk5,sk7)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_55]),c_0_42])]) ).
cnf(c_0_105,plain,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause175]) ).
cnf(c_0_106,plain,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
c_0_93 ).
cnf(c_0_107,plain,
( cons(hd(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_82,c_0_94]) ).
cnf(c_0_108,negated_conjecture,
( sk4 = nil
| singletonP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]),c_0_49])]) ).
cnf(c_0_109,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_98 ).
cnf(c_0_110,plain,
( memberP(app(X1,X2),X3)
| ~ memberP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_75])]) ).
cnf(c_0_111,negated_conjecture,
( memberP(sk6,sk8)
| memberP(sk3,sk8) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102])]) ).
cnf(c_0_112,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_103 ).
cnf(c_0_113,negated_conjecture,
frontsegP(sk3,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_47]),c_0_48]),c_0_43])]) ).
cnf(c_0_114,plain,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
c_0_105 ).
cnf(c_0_115,plain,
( X1 = X2
| memberP(X3,X2)
| ~ memberP(cons(X1,X3),X2)
| ~ ssList(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_106,c_0_75]),c_0_75])]) ).
cnf(c_0_116,negated_conjecture,
( cons(hd(sk3),nil) = sk3
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_64])]) ).
cnf(c_0_117,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_75])]) ).
cnf(c_0_118,negated_conjecture,
( memberP(app(sk6,X1),sk8)
| memberP(sk3,sk8)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_42])]) ).
cnf(c_0_119,negated_conjecture,
app(sk6,skaf45(sk3,sk6)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_42]),c_0_64])]) ).
cnf(c_0_120,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_121,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_114]) ).
cnf(c_0_122,plain,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause127]) ).
cnf(c_0_123,negated_conjecture,
( hd(sk3) = X1
| sk4 = nil
| ~ memberP(sk3,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_49])]),c_0_117]) ).
cnf(c_0_124,negated_conjecture,
memberP(sk3,sk8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_120])]) ).
cnf(c_0_125,negated_conjecture,
memberP(sk3,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_121,c_0_55]),c_0_48]),c_0_64]),c_0_43]),c_0_42])]) ).
cnf(c_0_126,plain,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_122 ).
cnf(c_0_127,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_128,negated_conjecture,
( hd(sk3) = sk8
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_129,negated_conjecture,
( hd(sk3) = sk5
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_123,c_0_125]) ).
cnf(c_0_130,negated_conjecture,
( sk3 = sk4
| ~ segmentP(sk3,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_97]),c_0_64])]) ).
cnf(c_0_131,negated_conjecture,
( sk4 = nil
| sk5 = sk8 ),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_132,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_133,negated_conjecture,
( sk5 = sk8
| sk3 = nil
| ~ segmentP(sk3,nil) ),
inference(spm,[status(thm)],[c_0_130,c_0_131]) ).
cnf(c_0_134,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
c_0_132 ).
cnf(c_0_135,plain,
( leq(X1,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause62]) ).
cnf(c_0_136,negated_conjecture,
( ~ leq(sk8,sk5)
| ~ leq(sk5,sk8) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_137,negated_conjecture,
( sk3 = nil
| sk5 = sk8 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_134]),c_0_64])]) ).
cnf(c_0_138,plain,
( leq(X1,X1)
| ~ ssItem(X1) ),
c_0_135 ).
cnf(c_0_139,negated_conjecture,
( ~ leq(sk8,sk5)
| ~ leq(sk5,sk8) ),
c_0_136 ).
cnf(c_0_140,negated_conjecture,
sk5 = sk8,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_137]),c_0_117]) ).
cnf(c_0_141,plain,
leq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_75])]) ).
cnf(c_0_142,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_139,c_0_140]),c_0_141]),c_0_140]),c_0_141])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC285-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 03:24:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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.79/0.58 # Version: 3.1.0
% 0.79/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.79/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.79/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.79/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.79/0.58 # Starting sh5l with 300s (1) cores
% 0.79/0.58 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 14453 completed with status 0
% 0.79/0.58 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.79/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.79/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.79/0.58 # No SInE strategy applied
% 0.79/0.58 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.79/0.58 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.79/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.79/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.79/0.58 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.79/0.58 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.79/0.58 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.79/0.58 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 14459 completed with status 0
% 0.79/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.79/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.79/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.79/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.79/0.58 # No SInE strategy applied
% 0.79/0.58 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.79/0.58 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.79/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.79/0.58 # Preprocessing time : 0.003 s
% 0.79/0.58 # Presaturation interreduction done
% 0.79/0.58
% 0.79/0.58 # Proof found!
% 0.79/0.58 # SZS status Unsatisfiable
% 0.79/0.58 # SZS output start CNFRefutation
% See solution above
% 0.79/0.58 # Parsed axioms : 202
% 0.79/0.58 # Removed by relevancy pruning/SinE : 0
% 0.79/0.58 # Initial clauses : 202
% 0.79/0.58 # Removed in clause preprocessing : 0
% 0.79/0.58 # Initial clauses in saturation : 202
% 0.79/0.58 # Processed clauses : 854
% 0.79/0.58 # ...of these trivial : 12
% 0.79/0.58 # ...subsumed : 178
% 0.79/0.58 # ...remaining for further processing : 664
% 0.79/0.58 # Other redundant clauses eliminated : 81
% 0.79/0.58 # Clauses deleted for lack of memory : 0
% 0.79/0.58 # Backward-subsumed : 20
% 0.79/0.58 # Backward-rewritten : 118
% 0.79/0.58 # Generated clauses : 1759
% 0.79/0.58 # ...of the previous two non-redundant : 1579
% 0.79/0.58 # ...aggressively subsumed : 0
% 0.79/0.58 # Contextual simplify-reflections : 12
% 0.79/0.58 # Paramodulations : 1671
% 0.79/0.58 # Factorizations : 0
% 0.79/0.58 # NegExts : 0
% 0.79/0.58 # Equation resolutions : 89
% 0.79/0.58 # Disequality decompositions : 0
% 0.79/0.58 # Total rewrite steps : 1474
% 0.79/0.58 # ...of those cached : 1360
% 0.79/0.58 # Propositional unsat checks : 0
% 0.79/0.58 # Propositional check models : 0
% 0.79/0.58 # Propositional check unsatisfiable : 0
% 0.79/0.58 # Propositional clauses : 0
% 0.79/0.58 # Propositional clauses after purity: 0
% 0.79/0.58 # Propositional unsat core size : 0
% 0.79/0.58 # Propositional preprocessing time : 0.000
% 0.79/0.58 # Propositional encoding time : 0.000
% 0.79/0.58 # Propositional solver time : 0.000
% 0.79/0.58 # Success case prop preproc time : 0.000
% 0.79/0.58 # Success case prop encoding time : 0.000
% 0.79/0.58 # Success case prop solver time : 0.000
% 0.79/0.58 # Current number of processed clauses : 309
% 0.79/0.58 # Positive orientable unit clauses : 82
% 0.79/0.58 # Positive unorientable unit clauses: 0
% 0.79/0.58 # Negative unit clauses : 6
% 0.79/0.58 # Non-unit-clauses : 221
% 0.79/0.58 # Current number of unprocessed clauses: 1036
% 0.79/0.58 # ...number of literals in the above : 4937
% 0.79/0.58 # Current number of archived formulas : 0
% 0.79/0.58 # Current number of archived clauses : 332
% 0.79/0.58 # Clause-clause subsumption calls (NU) : 20614
% 0.79/0.58 # Rec. Clause-clause subsumption calls : 7121
% 0.79/0.58 # Non-unit clause-clause subsumptions : 182
% 0.79/0.58 # Unit Clause-clause subsumption calls : 418
% 0.79/0.58 # Rewrite failures with RHS unbound : 0
% 0.79/0.58 # BW rewrite match attempts : 45
% 0.79/0.58 # BW rewrite match successes : 38
% 0.79/0.58 # Condensation attempts : 0
% 0.79/0.58 # Condensation successes : 0
% 0.79/0.58 # Termbank termtop insertions : 36910
% 0.79/0.58 # Search garbage collected termcells : 537
% 0.79/0.58
% 0.79/0.58 # -------------------------------------------------
% 0.79/0.58 # User time : 0.081 s
% 0.79/0.58 # System time : 0.007 s
% 0.79/0.58 # Total time : 0.088 s
% 0.79/0.58 # Maximum resident set size: 2140 pages
% 0.79/0.58
% 0.79/0.58 # -------------------------------------------------
% 0.79/0.58 # User time : 0.380 s
% 0.79/0.58 # System time : 0.034 s
% 0.79/0.58 # Total time : 0.414 s
% 0.79/0.58 # Maximum resident set size: 1876 pages
% 0.79/0.58 % E---3.1 exiting
% 0.79/0.58 % E exiting
%------------------------------------------------------------------------------