TSTP Solution File: SWC315-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWC315-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 : n008.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:36 EDT 2023
% Result : Unsatisfiable 0.18s 0.63s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 97
% Syntax : Number of formulae : 146 ( 16 unt; 76 typ; 0 def)
% Number of atoms : 136 ( 81 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 110 ( 44 ~; 66 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 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 : 20 ( 0 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_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_18,negated_conjecture,
( app(cons(sk7,nil),sk8) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_17,negated_conjecture,
( ssList(sk8)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_16,negated_conjecture,
( ssItem(sk7)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_11,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk2
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_10,negated_conjecture,
( ssList(sk6)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
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_19,negated_conjecture,
( app(sk8,cons(sk7,nil)) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(co1_12,negated_conjecture,
( nil = sk2
| app(sk6,cons(sk5,nil)) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_7,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_14,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_13,negated_conjecture,
( ssList(sk6)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(c_0_21,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_22,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_23,negated_conjecture,
( app(cons(sk7,nil),sk8) = sk4
| ~ neq(sk4,nil) ),
co1_18 ).
cnf(c_0_24,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_25,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,axiom,
ssList(nil),
clause8 ).
cnf(c_0_27,negated_conjecture,
( ssList(sk8)
| ~ neq(sk4,nil) ),
co1_17 ).
cnf(c_0_28,negated_conjecture,
( ssItem(sk7)
| ~ neq(sk4,nil) ),
co1_16 ).
cnf(c_0_29,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk2
| nil = sk2 ),
co1_11 ).
cnf(c_0_30,negated_conjecture,
( ssList(sk6)
| nil = sk2 ),
co1_10 ).
cnf(c_0_31,negated_conjecture,
( ssItem(sk5)
| nil = sk2 ),
co1_8 ).
cnf(c_0_32,negated_conjecture,
( app(cons(sk7,nil),sk8) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_33,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_34,negated_conjecture,
( sk4 = nil
| ssList(sk8) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_35,negated_conjecture,
( sk4 = nil
| ssItem(sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_36,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk4
| sk4 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_22]),c_0_22]) ).
cnf(c_0_37,negated_conjecture,
( sk4 = nil
| ssList(sk6) ),
inference(rw,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_38,negated_conjecture,
( sk4 = nil
| ssItem(sk5) ),
inference(rw,[status(thm)],[c_0_31,c_0_22]) ).
cnf(c_0_39,negated_conjecture,
( app(sk8,cons(sk7,nil)) = sk3
| ~ neq(sk4,nil) ),
co1_19 ).
cnf(c_0_40,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_41,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_42,negated_conjecture,
( cons(sk7,sk8) = sk4
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]) ).
cnf(c_0_43,negated_conjecture,
( cons(sk5,sk6) = sk4
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_33]),c_0_37]),c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( app(sk8,cons(sk7,nil)) = sk1
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( tl(sk4) = sk8
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_34]),c_0_35]) ).
cnf(c_0_46,negated_conjecture,
( tl(sk4) = sk6
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_43]),c_0_37]),c_0_38]) ).
cnf(c_0_47,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_48,negated_conjecture,
( app(sk8,cons(sk7,nil)) = sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_24]),c_0_25]),c_0_26])]) ).
cnf(c_0_49,negated_conjecture,
( sk4 = nil
| sk8 = sk6 ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( hd(sk4) = sk7
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_42]),c_0_34]),c_0_35]) ).
cnf(c_0_51,negated_conjecture,
( hd(sk4) = sk5
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_43]),c_0_37]),c_0_38]) ).
cnf(c_0_52,negated_conjecture,
( nil = sk2
| app(sk6,cons(sk5,nil)) != sk1 ),
co1_12 ).
cnf(c_0_53,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_7 ).
cnf(c_0_54,negated_conjecture,
( app(sk6,cons(sk7,nil)) = sk1
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,negated_conjecture,
( sk4 = nil
| sk7 = sk5 ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
( sk4 = nil
| app(sk6,cons(sk5,nil)) != sk1 ),
inference(rw,[status(thm)],[c_0_52,c_0_22]) ).
cnf(c_0_57,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk2
| nil != sk1 ),
co1_14 ).
cnf(c_0_58,negated_conjecture,
( sk1 = nil
| sk4 != nil ),
inference(rw,[status(thm)],[c_0_53,c_0_40]) ).
cnf(c_0_59,negated_conjecture,
sk4 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk4
| sk1 != nil ),
inference(rw,[status(thm)],[c_0_57,c_0_22]) ).
cnf(c_0_61,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).
cnf(c_0_62,negated_conjecture,
( ssItem(sk5)
| nil != sk1 ),
co1_9 ).
cnf(c_0_63,negated_conjecture,
( ssList(sk6)
| nil != sk1 ),
co1_13 ).
cnf(c_0_64,negated_conjecture,
app(cons(sk5,nil),sk6) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_59]),c_0_61])]) ).
cnf(c_0_65,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_61])]) ).
cnf(c_0_66,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_61])]) ).
cnf(c_0_67,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_68,negated_conjecture,
cons(sk5,sk6) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_64]),c_0_65]),c_0_66])]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_65]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC315-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.11/0.33 % Computer : n008.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Aug 28 16:58:47 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.18/0.58 start to proof: theBenchmark
% 0.18/0.63 % Version : CSE_E---1.5
% 0.18/0.63 % Problem : theBenchmark.p
% 0.18/0.63 % Proof found
% 0.18/0.63 % SZS status Theorem for theBenchmark.p
% 0.18/0.63 % SZS output start Proof
% See solution above
% 0.18/0.64 % Total time : 0.043000 s
% 0.18/0.64 % SZS output end Proof
% 0.18/0.64 % Total time : 0.048000 s
%------------------------------------------------------------------------------