TSTP Solution File: SWC279-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC279-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n016.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:21:19 EDT 2023
% Result : Unsatisfiable 0.55s 0.64s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 96
% Syntax : Number of formulae : 136 ( 26 unt; 76 typ; 0 def)
% Number of atoms : 149 ( 20 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 181 ( 92 ~; 89 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 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 : 57 ( 57 usr; 11 con; 0-2 aty)
% Number of variables : 74 ( 11 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 ).
cnf(co1_12,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
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_10,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_11,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_9,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(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(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(co1_7,negated_conjecture,
( leq(X1,X4)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssItem(X4)
| ~ memberP(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_8,negated_conjecture,
( leq(X4,X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssItem(X4)
| ~ memberP(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_14,negated_conjecture,
( memberP(sk6,sk8)
| memberP(sk7,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_15,negated_conjecture,
( memberP(sk6,sk8)
| ~ leq(sk5,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_16,negated_conjecture,
( memberP(sk7,sk8)
| ~ leq(sk8,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_17,negated_conjecture,
( ~ leq(sk8,sk5)
| ~ leq(sk5,sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(c_0_20,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
co1_12 ).
cnf(c_0_21,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_22,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk3,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_24,negated_conjecture,
ssList(sk6),
co1_10 ).
cnf(c_0_25,negated_conjecture,
ssList(sk7),
co1_11 ).
cnf(c_0_26,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_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_27,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_28,negated_conjecture,
ssItem(sk5),
co1_9 ).
cnf(c_0_29,axiom,
ssList(nil),
clause8 ).
cnf(c_0_30,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_31,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_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_32,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_33,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_30]) ).
cnf(c_0_34,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_31,c_0_32]),c_0_28]),c_0_25])]) ).
cnf(c_0_35,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_33,c_0_34]),c_0_28]),c_0_25]),c_0_24])]) ).
cnf(c_0_36,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_37,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_38,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk3,cons(sk5,X2)))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_40,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_37,c_0_21]) ).
cnf(c_0_41,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk5,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_42,negated_conjecture,
( ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_27]),c_0_28])]) ).
cnf(c_0_43,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_44,negated_conjecture,
( leq(X1,X4)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssItem(X4)
| ~ memberP(X3,X4) ),
co1_7 ).
cnf(c_0_45,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( leq(X4,X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk3
| ~ ssItem(X4)
| ~ memberP(X2,X4) ),
co1_8 ).
cnf(c_0_47,negated_conjecture,
( leq(X1,X2)
| app(app(X3,cons(X1,nil)),X4) != sk3
| ~ memberP(X4,X2)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
( leq(X1,X2)
| app(app(X3,cons(X2,nil)),X4) != sk3
| ~ memberP(X3,X1)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_45]),c_0_45])]) ).
cnf(c_0_49,negated_conjecture,
( leq(sk5,X1)
| ~ memberP(sk7,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_22]),c_0_25]),c_0_24])]) ).
cnf(c_0_50,negated_conjecture,
( memberP(sk6,sk8)
| memberP(sk7,sk8) ),
co1_14 ).
cnf(c_0_51,negated_conjecture,
( memberP(sk6,sk8)
| ~ leq(sk5,sk8) ),
co1_15 ).
cnf(c_0_52,negated_conjecture,
( leq(X1,sk5)
| ~ memberP(sk6,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_22]),c_0_25]),c_0_24])]) ).
cnf(c_0_53,negated_conjecture,
memberP(sk6,sk8),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_54,negated_conjecture,
( memberP(sk7,sk8)
| ~ leq(sk8,sk5) ),
co1_16 ).
cnf(c_0_55,negated_conjecture,
leq(sk8,sk5),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( ~ leq(sk8,sk5)
| ~ leq(sk5,sk8) ),
co1_17 ).
cnf(c_0_57,negated_conjecture,
memberP(sk7,sk8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_58,negated_conjecture,
~ leq(sk5,sk8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_55])]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_57]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC279-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 18:08:14 EDT 2023
% 0.22/0.35 % CPUTime :
% 0.54/0.57 start to proof: theBenchmark
% 0.55/0.64 % Version : CSE_E---1.5
% 0.55/0.64 % Problem : theBenchmark.p
% 0.55/0.64 % Proof found
% 0.55/0.64 % SZS status Theorem for theBenchmark.p
% 0.55/0.64 % SZS output start Proof
% See solution above
% 0.55/0.65 % Total time : 0.053000 s
% 0.55/0.65 % SZS output end Proof
% 0.55/0.65 % Total time : 0.059000 s
%------------------------------------------------------------------------------