TSTP Solution File: SWC176-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC176-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 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 : Thu Aug 31 20:20:27 EDT 2023
% Result : Unsatisfiable 0.57s 0.71s
% Output : CNFRefutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 108
% Syntax : Number of formulae : 212 ( 50 unt; 78 typ; 0 def)
% Number of atoms : 323 ( 86 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 383 ( 194 ~; 189 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 82 ( 65 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 59 ( 59 usr; 13 con; 0-2 aty)
% Number of variables : 137 ( 18 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
nil: $i ).
tff(decl_23,type,
equalelemsP: $i > $o ).
tff(decl_24,type,
duplicatefreeP: $i > $o ).
tff(decl_25,type,
strictorderedP: $i > $o ).
tff(decl_26,type,
totalorderedP: $i > $o ).
tff(decl_27,type,
strictorderP: $i > $o ).
tff(decl_28,type,
totalorderP: $i > $o ).
tff(decl_29,type,
cyclefreeP: $i > $o ).
tff(decl_30,type,
ssList: $i > $o ).
tff(decl_31,type,
skac3: $i ).
tff(decl_32,type,
ssItem: $i > $o ).
tff(decl_33,type,
skac2: $i ).
tff(decl_34,type,
singletonP: $i > $o ).
tff(decl_35,type,
skaf83: $i > $i ).
tff(decl_36,type,
skaf82: $i > $i ).
tff(decl_37,type,
skaf81: $i > $i ).
tff(decl_38,type,
skaf80: $i > $i ).
tff(decl_39,type,
skaf79: $i > $i ).
tff(decl_40,type,
skaf78: $i > $i ).
tff(decl_41,type,
skaf77: $i > $i ).
tff(decl_42,type,
skaf76: $i > $i ).
tff(decl_43,type,
skaf75: $i > $i ).
tff(decl_44,type,
skaf74: $i > $i ).
tff(decl_45,type,
skaf73: $i > $i ).
tff(decl_46,type,
skaf72: $i > $i ).
tff(decl_47,type,
skaf71: $i > $i ).
tff(decl_48,type,
skaf70: $i > $i ).
tff(decl_49,type,
skaf69: $i > $i ).
tff(decl_50,type,
skaf68: $i > $i ).
tff(decl_51,type,
skaf67: $i > $i ).
tff(decl_52,type,
skaf66: $i > $i ).
tff(decl_53,type,
skaf65: $i > $i ).
tff(decl_54,type,
skaf64: $i > $i ).
tff(decl_55,type,
skaf63: $i > $i ).
tff(decl_56,type,
skaf62: $i > $i ).
tff(decl_57,type,
skaf61: $i > $i ).
tff(decl_58,type,
skaf60: $i > $i ).
tff(decl_59,type,
skaf59: $i > $i ).
tff(decl_60,type,
skaf58: $i > $i ).
tff(decl_61,type,
skaf57: $i > $i ).
tff(decl_62,type,
skaf56: $i > $i ).
tff(decl_63,type,
skaf55: $i > $i ).
tff(decl_64,type,
skaf54: $i > $i ).
tff(decl_65,type,
skaf53: $i > $i ).
tff(decl_66,type,
skaf52: $i > $i ).
tff(decl_67,type,
skaf51: $i > $i ).
tff(decl_68,type,
skaf50: $i > $i ).
tff(decl_69,type,
skaf49: $i > $i ).
tff(decl_70,type,
skaf44: $i > $i ).
tff(decl_71,type,
skaf48: ( $i * $i ) > $i ).
tff(decl_72,type,
skaf47: ( $i * $i ) > $i ).
tff(decl_73,type,
skaf46: ( $i * $i ) > $i ).
tff(decl_74,type,
skaf45: ( $i * $i ) > $i ).
tff(decl_75,type,
skaf43: ( $i * $i ) > $i ).
tff(decl_76,type,
skaf42: ( $i * $i ) > $i ).
tff(decl_77,type,
geq: ( $i * $i ) > $o ).
tff(decl_78,type,
segmentP: ( $i * $i ) > $o ).
tff(decl_79,type,
rearsegP: ( $i * $i ) > $o ).
tff(decl_80,type,
frontsegP: ( $i * $i ) > $o ).
tff(decl_81,type,
leq: ( $i * $i ) > $o ).
tff(decl_82,type,
lt: ( $i * $i ) > $o ).
tff(decl_83,type,
cons: ( $i * $i ) > $i ).
tff(decl_84,type,
memberP: ( $i * $i ) > $o ).
tff(decl_85,type,
app: ( $i * $i ) > $i ).
tff(decl_86,type,
tl: $i > $i ).
tff(decl_87,type,
hd: $i > $i ).
tff(decl_88,type,
neq: ( $i * $i ) > $o ).
tff(decl_89,type,
gt: ( $i * $i ) > $o ).
tff(decl_90,type,
sk1: $i ).
tff(decl_91,type,
sk2: $i ).
tff(decl_92,type,
sk3: $i ).
tff(decl_93,type,
sk4: $i ).
tff(decl_94,type,
sk5: $i ).
tff(decl_95,type,
sk6: $i ).
tff(decl_96,type,
sk7: $i ).
tff(decl_97,type,
sk8: $i ).
tff(decl_98,type,
sk9: $i ).
tff(decl_99,type,
sk10: $i ).
cnf(co1_17,negated_conjecture,
app(app(app(sk9,cons(sk7,nil)),cons(sk8,nil)),sk10) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_18,negated_conjecture,
~ neq(sk7,sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(co1_13,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_14,negated_conjecture,
ssItem(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause143) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_15,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_16,negated_conjecture,
ssList(sk10),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(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,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause181,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause181) ).
cnf(clause63,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause63) ).
cnf(co1_10,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(c_0_30,negated_conjecture,
app(app(app(sk9,cons(sk7,nil)),cons(sk8,nil)),sk10) = sk1,
co1_17 ).
cnf(c_0_31,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_32,negated_conjecture,
~ neq(sk7,sk8),
co1_18 ).
cnf(c_0_33,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
clause102 ).
cnf(c_0_34,negated_conjecture,
ssItem(sk7),
co1_13 ).
cnf(c_0_35,negated_conjecture,
ssItem(sk8),
co1_14 ).
cnf(c_0_36,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_37,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_38,negated_conjecture,
app(app(app(sk9,cons(sk7,nil)),cons(sk8,nil)),sk10) = sk3,
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_40,negated_conjecture,
sk8 = sk7,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_41,negated_conjecture,
ssList(sk9),
co1_15 ).
cnf(c_0_42,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_36]),c_0_37]) ).
cnf(c_0_43,negated_conjecture,
ssList(sk10),
co1_16 ).
cnf(c_0_44,negated_conjecture,
( app(app(sk9,app(cons(sk7,nil),cons(sk7,nil))),sk10) = sk3
| ~ ssList(cons(sk7,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]),c_0_40])]) ).
cnf(c_0_45,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_46,axiom,
ssList(nil),
clause8 ).
cnf(c_0_47,negated_conjecture,
( rearsegP(sk3,sk10)
| ~ ssList(app(app(sk9,cons(sk7,nil)),cons(sk7,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_38]),c_0_43]),c_0_40])]) ).
cnf(c_0_48,negated_conjecture,
app(app(sk9,app(cons(sk7,nil),cons(sk7,nil))),sk10) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_34]),c_0_46])]) ).
cnf(c_0_49,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_50,negated_conjecture,
( rearsegP(sk3,sk10)
| ~ ssList(app(sk9,cons(sk7,nil)))
| ~ ssList(cons(sk7,nil)) ),
inference(spm,[status(thm)],[c_0_47,c_0_37]) ).
cnf(c_0_51,negated_conjecture,
( app(app(sk9,cons(sk7,cons(sk7,nil))),sk10) = sk3
| ~ ssList(cons(sk7,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_34])]) ).
cnf(c_0_52,negated_conjecture,
( rearsegP(sk3,sk10)
| ~ ssList(app(sk9,cons(sk7,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_45]),c_0_34]),c_0_46])]) ).
cnf(c_0_53,negated_conjecture,
app(app(sk9,cons(sk7,cons(sk7,nil))),sk10) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_45]),c_0_34]),c_0_46])]) ).
cnf(c_0_54,negated_conjecture,
( rearsegP(sk3,sk10)
| ~ ssList(cons(sk7,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_37]),c_0_41])]) ).
cnf(c_0_55,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_56,negated_conjecture,
( app(sk9,app(cons(sk7,cons(sk7,nil)),sk10)) = sk3
| ~ ssList(cons(sk7,cons(sk7,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_53]),c_0_41]),c_0_43])]) ).
cnf(c_0_57,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_58,negated_conjecture,
rearsegP(sk3,sk10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_45]),c_0_34]),c_0_46])]) ).
cnf(c_0_59,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_55,c_0_31]) ).
cnf(c_0_60,negated_conjecture,
( app(sk9,app(cons(sk7,cons(sk7,nil)),sk10)) = sk3
| ~ ssList(cons(sk7,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_45]),c_0_34])]) ).
cnf(c_0_61,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause151 ).
cnf(c_0_62,negated_conjecture,
app(skaf46(sk3,sk10),sk10) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_43]),c_0_59])]) ).
cnf(c_0_63,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_64,negated_conjecture,
app(sk9,app(cons(sk7,cons(sk7,nil)),sk10)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_45]),c_0_34]),c_0_46])]) ).
cnf(c_0_65,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_66,negated_conjecture,
( skaf46(sk3,sk10) = X1
| app(X1,sk10) != sk3
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_43]),c_0_63])]) ).
cnf(c_0_67,negated_conjecture,
( app(sk9,cons(sk7,app(cons(sk7,nil),sk10))) = sk3
| ~ ssList(cons(sk7,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_34]),c_0_43])]) ).
cnf(c_0_68,negated_conjecture,
( skaf46(sk3,sk10) = app(app(sk9,cons(sk7,nil)),cons(sk7,nil))
| ~ ssList(app(app(sk9,cons(sk7,nil)),cons(sk7,nil))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_38]),c_0_40]),c_0_40]) ).
cnf(c_0_69,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
clause179 ).
cnf(c_0_70,negated_conjecture,
app(sk9,cons(sk7,app(cons(sk7,nil),sk10))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_45]),c_0_34]),c_0_46])]) ).
cnf(c_0_71,negated_conjecture,
( skaf46(sk3,sk10) = app(app(sk9,cons(sk7,nil)),cons(sk7,nil))
| ~ ssList(app(sk9,cons(sk7,nil)))
| ~ ssList(cons(sk7,nil)) ),
inference(spm,[status(thm)],[c_0_68,c_0_37]) ).
cnf(c_0_72,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_73,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_69]) ).
cnf(c_0_74,negated_conjecture,
app(sk9,cons(sk7,cons(sk7,sk10))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_49]),c_0_34]),c_0_43])]) ).
cnf(c_0_75,negated_conjecture,
( skaf46(sk3,sk10) = app(app(sk9,cons(sk7,nil)),cons(sk7,nil))
| ~ ssList(app(sk9,cons(sk7,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_45]),c_0_34]),c_0_46])]) ).
cnf(c_0_76,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_72]),c_0_37]) ).
cnf(c_0_77,negated_conjecture,
( ~ ssList(app(sk3,cons(sk7,X1)))
| ~ ssList(cons(sk7,sk10))
| ~ ssList(X1)
| ~ duplicatefreeP(app(sk3,cons(sk7,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_34]),c_0_41])]) ).
cnf(c_0_78,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_79,negated_conjecture,
( skaf46(sk3,sk10) = app(app(sk9,cons(sk7,nil)),cons(sk7,nil))
| ~ ssList(cons(sk7,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_37]),c_0_41])]) ).
cnf(c_0_80,negated_conjecture,
( frontsegP(sk3,sk9)
| ~ ssList(cons(sk7,cons(sk7,sk10))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_74]),c_0_41])]) ).
cnf(c_0_81,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk3,cons(sk7,X2)))
| ~ ssList(cons(sk7,sk10))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_82,negated_conjecture,
skaf46(sk3,sk10) = app(app(sk9,cons(sk7,nil)),cons(sk7,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_45]),c_0_34]),c_0_46])]) ).
cnf(c_0_83,negated_conjecture,
( frontsegP(sk3,sk9)
| ~ ssList(cons(sk7,sk10)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_45]),c_0_34])]) ).
cnf(c_0_84,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk3,cons(sk7,X2)))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_45]),c_0_34]),c_0_43])]) ).
cnf(c_0_85,negated_conjecture,
ssList(app(app(sk9,cons(sk7,nil)),cons(sk7,nil))),
inference(spm,[status(thm)],[c_0_63,c_0_82]) ).
cnf(c_0_86,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_87,negated_conjecture,
frontsegP(sk3,sk9),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_45]),c_0_34]),c_0_43])]) ).
cnf(c_0_88,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk7,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_37]),c_0_59])]) ).
cnf(c_0_89,negated_conjecture,
( ssList(app(sk9,app(cons(sk7,nil),cons(sk7,nil))))
| ~ ssList(cons(sk7,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_39]),c_0_41])]) ).
cnf(c_0_90,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause150 ).
cnf(c_0_91,negated_conjecture,
app(sk9,skaf45(sk3,sk9)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_41]),c_0_59])]) ).
cnf(c_0_92,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_93,negated_conjecture,
( ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_45]),c_0_34])]) ).
cnf(c_0_94,negated_conjecture,
ssList(app(sk9,app(cons(sk7,nil),cons(sk7,nil)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_45]),c_0_34]),c_0_46])]) ).
cnf(c_0_95,negated_conjecture,
( skaf45(sk3,sk9) = X1
| app(sk9,X1) != sk3
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]),c_0_41])]) ).
cnf(c_0_96,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_97,negated_conjecture,
( skaf45(sk3,sk9) = cons(sk7,cons(sk7,sk10))
| ~ ssList(cons(sk7,cons(sk7,sk10))) ),
inference(spm,[status(thm)],[c_0_95,c_0_74]) ).
cnf(c_0_98,plain,
( ssList(cons(X1,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_96])]) ).
cnf(c_0_99,negated_conjecture,
app(sk9,cons(sk7,cons(sk7,app(nil,sk10)))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_65]),c_0_34]),c_0_43]),c_0_46])]) ).
cnf(c_0_100,negated_conjecture,
( skaf45(sk3,sk9) = cons(sk7,cons(sk7,sk10))
| ~ ssList(cons(sk7,sk10)) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_101,negated_conjecture,
( skaf45(sk3,sk9) = cons(sk7,cons(sk7,app(nil,sk10)))
| ~ ssList(cons(sk7,cons(sk7,app(nil,sk10)))) ),
inference(spm,[status(thm)],[c_0_95,c_0_99]) ).
cnf(c_0_102,negated_conjecture,
skaf45(sk3,sk9) = cons(sk7,cons(sk7,sk10)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_98]),c_0_43])]) ).
cnf(c_0_103,negated_conjecture,
( skaf45(sk3,sk9) = cons(sk7,app(cons(sk7,nil),sk10))
| ~ ssList(cons(sk7,app(cons(sk7,nil),sk10))) ),
inference(spm,[status(thm)],[c_0_95,c_0_70]) ).
cnf(c_0_104,negated_conjecture,
( cons(sk7,cons(sk7,app(nil,sk10))) = cons(sk7,cons(sk7,sk10))
| ~ ssList(cons(sk7,cons(sk7,app(nil,sk10)))) ),
inference(rw,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_105,negated_conjecture,
( cons(sk7,app(cons(sk7,nil),sk10)) = cons(sk7,cons(sk7,sk10))
| ~ ssList(cons(sk7,app(cons(sk7,nil),sk10))) ),
inference(rw,[status(thm)],[c_0_103,c_0_102]) ).
cnf(c_0_106,negated_conjecture,
( cons(sk7,cons(sk7,app(nil,sk10))) = cons(sk7,cons(sk7,sk10))
| ~ ssList(cons(sk7,app(nil,sk10))) ),
inference(spm,[status(thm)],[c_0_104,c_0_98]) ).
cnf(c_0_107,negated_conjecture,
( cons(sk7,app(cons(sk7,nil),sk10)) = cons(sk7,cons(sk7,sk10))
| ~ ssList(app(cons(sk7,nil),sk10)) ),
inference(spm,[status(thm)],[c_0_105,c_0_98]) ).
cnf(c_0_108,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_109,negated_conjecture,
( cons(sk7,cons(sk7,app(nil,sk10))) = cons(sk7,cons(sk7,sk10))
| ~ ssList(app(nil,sk10)) ),
inference(spm,[status(thm)],[c_0_106,c_0_98]) ).
cnf(c_0_110,negated_conjecture,
( cons(sk7,app(cons(sk7,nil),sk10)) = cons(sk7,cons(sk7,sk10))
| ~ ssList(cons(sk7,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_37]),c_0_43])]) ).
cnf(c_0_111,plain,
( tl(cons(X1,X2)) = X2
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_96])]) ).
cnf(c_0_112,negated_conjecture,
cons(sk7,cons(sk7,app(nil,sk10))) = cons(sk7,cons(sk7,sk10)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_37]),c_0_46]),c_0_43])]) ).
cnf(c_0_113,negated_conjecture,
cons(sk7,app(cons(sk7,nil),sk10)) = cons(sk7,cons(sk7,sk10)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_98]),c_0_46])]) ).
cnf(c_0_114,negated_conjecture,
( tl(cons(sk7,cons(sk7,sk10))) = cons(sk7,app(nil,sk10))
| ~ ssList(cons(sk7,app(nil,sk10))) ),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_115,negated_conjecture,
( app(app(sk9,cons(sk7,nil)),app(cons(sk7,nil),sk10)) = sk3
| ~ ssList(app(sk9,cons(sk7,nil)))
| ~ ssList(cons(sk7,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_40]),c_0_43])]) ).
cnf(c_0_116,negated_conjecture,
( tl(cons(sk7,cons(sk7,sk10))) = app(cons(sk7,nil),sk10)
| ~ ssList(app(cons(sk7,nil),sk10)) ),
inference(spm,[status(thm)],[c_0_111,c_0_113]) ).
cnf(c_0_117,negated_conjecture,
( tl(cons(sk7,cons(sk7,sk10))) = cons(sk7,app(nil,sk10))
| ~ ssList(app(nil,sk10)) ),
inference(spm,[status(thm)],[c_0_114,c_0_98]) ).
cnf(c_0_118,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_119,negated_conjecture,
( app(app(sk9,cons(sk7,nil)),app(cons(sk7,nil),sk10)) = sk3
| ~ ssList(app(sk9,cons(sk7,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_98]),c_0_46])]) ).
cnf(c_0_120,negated_conjecture,
( tl(cons(sk7,cons(sk7,sk10))) = app(cons(sk7,nil),sk10)
| ~ ssList(cons(sk7,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_37]),c_0_43])]) ).
cnf(c_0_121,negated_conjecture,
tl(cons(sk7,cons(sk7,sk10))) = cons(sk7,sk10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_43])]) ).
cnf(c_0_122,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
clause181 ).
cnf(c_0_123,negated_conjecture,
( app(app(sk9,cons(sk7,nil)),app(cons(sk7,nil),sk10)) = sk3
| ~ ssList(cons(sk7,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_37]),c_0_41])]) ).
cnf(c_0_124,negated_conjecture,
( app(cons(sk7,nil),sk10) = cons(sk7,sk10)
| ~ ssList(cons(sk7,nil)) ),
inference(rw,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_125,plain,
( lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(er,[status(thm)],[c_0_122]) ).
cnf(c_0_126,negated_conjecture,
app(app(sk9,cons(sk7,nil)),app(cons(sk7,nil),sk10)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_98]),c_0_46])]) ).
cnf(c_0_127,negated_conjecture,
app(cons(sk7,nil),sk10) = cons(sk7,sk10),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_98]),c_0_46])]) ).
cnf(c_0_128,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
clause63 ).
cnf(c_0_129,plain,
( lt(X1,X2)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_125,c_0_96]),c_0_96])]) ).
cnf(c_0_130,negated_conjecture,
app(app(sk9,cons(sk7,nil)),cons(sk7,sk10)) = sk3,
inference(rw,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_131,negated_conjecture,
strictorderedP(sk3),
co1_10 ).
cnf(c_0_132,plain,
~ lt(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_128,c_0_96])]) ).
cnf(c_0_133,negated_conjecture,
$false,
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_129,c_0_130]),c_0_59]),c_0_43]),c_0_46]),c_0_41]),c_0_131])]),c_0_132]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC176-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 14:50:21 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.46/0.58 start to proof: theBenchmark
% 0.57/0.71 % Version : CSE_E---1.5
% 0.57/0.71 % Problem : theBenchmark.p
% 0.57/0.71 % Proof found
% 0.57/0.71 % SZS status Theorem for theBenchmark.p
% 0.57/0.71 % SZS output start Proof
% See solution above
% 0.57/0.72 % Total time : 0.116000 s
% 0.57/0.72 % SZS output end Proof
% 0.57/0.72 % Total time : 0.122000 s
%------------------------------------------------------------------------------