TSTP Solution File: SWC316-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC316-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n005.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 Aug 22 11:02:06 EDT 2023
% Result : Unsatisfiable 14.56s 5.22s
% Output : CNFRefutation 14.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 91
% Syntax : Number of formulae : 143 ( 30 unt; 74 typ; 0 def)
% Number of atoms : 156 ( 44 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 186 ( 99 ~; 87 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 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 : 55 ( 55 usr; 9 con; 0-2 aty)
% Number of variables : 29 (; 29 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ segmentP > rearsegP > neq > memberP > lt > leq > gt > geq > frontsegP > totalorderedP > totalorderP > strictorderedP > strictorderP > ssList > ssItem > singletonP > equalelemsP > duplicatefreeP > cyclefreeP > skaf48 > skaf47 > skaf46 > skaf45 > skaf43 > skaf42 > cons > app > #nlpp > tl > skaf83 > skaf82 > skaf81 > skaf80 > skaf79 > skaf78 > skaf77 > skaf76 > skaf75 > skaf74 > skaf73 > skaf72 > skaf71 > skaf70 > skaf69 > skaf68 > skaf67 > skaf66 > skaf65 > skaf64 > skaf63 > skaf62 > skaf61 > skaf60 > skaf59 > skaf58 > skaf57 > skaf56 > skaf55 > skaf54 > skaf53 > skaf52 > skaf51 > skaf50 > skaf49 > skaf44 > hd > skac3 > skac2 > sk6 > sk5 > sk4 > sk3 > sk2 > sk1 > nil
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(skaf56,type,
skaf56: $i > $i ).
tff(segmentP,type,
segmentP: ( $i * $i ) > $o ).
tff(totalorderedP,type,
totalorderedP: $i > $o ).
tff(equalelemsP,type,
equalelemsP: $i > $o ).
tff(skaf74,type,
skaf74: $i > $i ).
tff(skaf61,type,
skaf61: $i > $i ).
tff(skaf51,type,
skaf51: $i > $i ).
tff(skaf83,type,
skaf83: $i > $i ).
tff(skac2,type,
skac2: $i ).
tff(skaf63,type,
skaf63: $i > $i ).
tff(skaf62,type,
skaf62: $i > $i ).
tff(sk2,type,
sk2: $i ).
tff(skaf52,type,
skaf52: $i > $i ).
tff(skaf50,type,
skaf50: $i > $i ).
tff(skaf42,type,
skaf42: ( $i * $i ) > $i ).
tff(skaf44,type,
skaf44: $i > $i ).
tff(singletonP,type,
singletonP: $i > $o ).
tff(skaf67,type,
skaf67: $i > $i ).
tff(skaf75,type,
skaf75: $i > $i ).
tff(sk1,type,
sk1: $i ).
tff(skaf58,type,
skaf58: $i > $i ).
tff(skaf46,type,
skaf46: ( $i * $i ) > $i ).
tff(frontsegP,type,
frontsegP: ( $i * $i ) > $o ).
tff(skaf70,type,
skaf70: $i > $i ).
tff(totalorderP,type,
totalorderP: $i > $o ).
tff(ssItem,type,
ssItem: $i > $o ).
tff(sk6,type,
sk6: $i ).
tff(skaf82,type,
skaf82: $i > $i ).
tff(skaf47,type,
skaf47: ( $i * $i ) > $i ).
tff(skaf76,type,
skaf76: $i > $i ).
tff(skac3,type,
skac3: $i ).
tff(skaf80,type,
skaf80: $i > $i ).
tff(skaf59,type,
skaf59: $i > $i ).
tff(skaf53,type,
skaf53: $i > $i ).
tff(skaf45,type,
skaf45: ( $i * $i ) > $i ).
tff(hd,type,
hd: $i > $i ).
tff(app,type,
app: ( $i * $i ) > $i ).
tff(skaf72,type,
skaf72: $i > $i ).
tff(duplicatefreeP,type,
duplicatefreeP: $i > $o ).
tff(skaf64,type,
skaf64: $i > $i ).
tff(sk4,type,
sk4: $i ).
tff(gt,type,
gt: ( $i * $i ) > $o ).
tff(skaf71,type,
skaf71: $i > $i ).
tff(skaf78,type,
skaf78: $i > $i ).
tff(sk5,type,
sk5: $i ).
tff(skaf79,type,
skaf79: $i > $i ).
tff(rearsegP,type,
rearsegP: ( $i * $i ) > $o ).
tff(memberP,type,
memberP: ( $i * $i ) > $o ).
tff(skaf73,type,
skaf73: $i > $i ).
tff(ssList,type,
ssList: $i > $o ).
tff(cons,type,
cons: ( $i * $i ) > $i ).
tff(skaf54,type,
skaf54: $i > $i ).
tff(skaf77,type,
skaf77: $i > $i ).
tff(sk3,type,
sk3: $i ).
tff(skaf66,type,
skaf66: $i > $i ).
tff(strictorderP,type,
strictorderP: $i > $o ).
tff(skaf81,type,
skaf81: $i > $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
tff(skaf60,type,
skaf60: $i > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(lt,type,
lt: ( $i * $i ) > $o ).
tff(skaf69,type,
skaf69: $i > $i ).
tff(tl,type,
tl: $i > $i ).
tff(neq,type,
neq: ( $i * $i ) > $o ).
tff(skaf43,type,
skaf43: ( $i * $i ) > $i ).
tff(skaf48,type,
skaf48: ( $i * $i ) > $i ).
tff(skaf65,type,
skaf65: $i > $i ).
tff(skaf57,type,
skaf57: $i > $i ).
tff(nil,type,
nil: $i ).
tff(skaf49,type,
skaf49: $i > $i ).
tff(skaf55,type,
skaf55: $i > $i ).
tff(skaf68,type,
skaf68: $i > $i ).
tff(strictorderedP,type,
strictorderedP: $i > $o ).
tff(cyclefreeP,type,
cyclefreeP: $i > $o ).
tff(f_1653,axiom,
( neq(sk2,nil)
| neq(sk2,nil) ),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1711,axiom,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1715,axiom,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_666,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ( app(cons(U,nil),V) = cons(U,V) ) ),
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1719,axiom,
( ( app(cons(sk5,nil),sk6) = sk3 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_437,axiom,
! [U,V] :
( ( cons(U,V) != nil )
| ~ ssItem(U)
| ~ ssList(V) ),
file(unknown,unknown) ).
tff(f_1647,axiom,
ssList(sk3),
file(unknown,unknown) ).
tff(f_56,axiom,
ssList(nil),
file(unknown,unknown) ).
tff(f_456,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ),
file(unknown,unknown) ).
tff(f_342,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
file(unknown,unknown) ).
tff(f_1648,axiom,
ssList(sk4),
file(unknown,unknown) ).
tff(f_1723,axiom,
( ( app(sk6,cons(sk5,nil)) = sk4 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_428,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) ),
file(unknown,unknown) ).
tff(f_420,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ( tl(cons(U,V)) = V ) ),
file(unknown,unknown) ).
tff(f_1762,axiom,
! [A,B,C,D] :
( ~ ssList(A)
| ( sk2 != A )
| ~ ssList(B)
| ~ ssList(C)
| ( tl(sk1) != B )
| ( app(B,C) != A )
| ~ ssItem(D)
| ( cons(D,nil) != C )
| ( hd(sk1) != D )
| ~ neq(nil,sk1)
| ~ neq(nil,sk1)
| ~ neq(sk1,nil)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(c_384,plain,
neq(sk2,nil),
inference(cnfTransformation,[status(thm)],[f_1653]) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_398,plain,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1711]) ).
tff(c_414,plain,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_398]) ).
tff(c_420,plain,
ssItem(sk5),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_414]) ).
tff(c_400,plain,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1715]) ).
tff(c_417,plain,
( ~ neq(sk2,nil)
| ssList(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_400]) ).
tff(c_426,plain,
ssList(sk6),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_417]) ).
tff(c_3476,plain,
! [U_640,V_641] :
( ( app(cons(U_640,nil),V_641) = cons(U_640,V_641) )
| ~ ssList(V_641)
| ~ ssItem(U_640) ),
inference(cnfTransformation,[status(thm)],[f_666]) ).
tff(c_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_402,plain,
( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk6) = sk3 ) ),
inference(cnfTransformation,[status(thm)],[f_1719]) ).
tff(c_413,plain,
( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk6) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_402]) ).
tff(c_418,plain,
( ~ neq(sk2,nil)
| ( app(cons(sk5,nil),sk6) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_413]) ).
tff(c_428,plain,
app(cons(sk5,nil),sk6) = sk1,
inference(demodulation,[status(thm),theory(equality)],[c_384,c_418]) ).
tff(c_3488,plain,
( ( cons(sk5,sk6) = sk1 )
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_3476,c_428]) ).
tff(c_3500,plain,
cons(sk5,sk6) = sk1,
inference(demodulation,[status(thm),theory(equality)],[c_420,c_426,c_3488]) ).
tff(c_1161,plain,
! [V_460,U_461] :
( ~ ssList(V_460)
| ~ ssItem(U_461)
| ( cons(U_461,V_460) != nil ) ),
inference(cnfTransformation,[status(thm)],[f_437]) ).
tff(c_2116,plain,
! [U_526] :
( ~ ssItem(U_526)
| ( cons(U_526,sk6) != nil ) ),
inference(resolution,[status(thm)],[c_426,c_1161]) ).
tff(c_2192,plain,
cons(sk5,sk6) != nil,
inference(resolution,[status(thm)],[c_420,c_2116]) ).
tff(c_3506,plain,
sk1 != nil,
inference(demodulation,[status(thm),theory(equality)],[c_3500,c_2192]) ).
tff(c_376,plain,
ssList(sk3),
inference(cnfTransformation,[status(thm)],[f_1647]) ).
tff(c_430,plain,
ssList(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_376]) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_200,plain,
! [V_102,U_101] :
( ( V_102 = U_101 )
| neq(V_102,U_101)
| ~ ssList(V_102)
| ~ ssList(U_101) ),
inference(cnfTransformation,[status(thm)],[f_456]) ).
tff(c_172,plain,
! [U_82,V_83] :
( ssList(cons(U_82,V_83))
| ~ ssList(V_83)
| ~ ssItem(U_82) ),
inference(cnfTransformation,[status(thm)],[f_342]) ).
tff(c_378,plain,
ssList(sk4),
inference(cnfTransformation,[status(thm)],[f_1648]) ).
tff(c_429,plain,
ssList(sk2),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_378]) ).
tff(c_404,plain,
( ~ neq(sk4,nil)
| ( app(sk6,cons(sk5,nil)) = sk4 ) ),
inference(cnfTransformation,[status(thm)],[f_1723]) ).
tff(c_416,plain,
( ~ neq(sk2,nil)
| ( app(sk6,cons(sk5,nil)) = sk2 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_404]) ).
tff(c_424,plain,
app(sk6,cons(sk5,nil)) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_384,c_416]) ).
tff(c_194,plain,
! [U_95,V_96] :
( ( hd(cons(U_95,V_96)) = U_95 )
| ~ ssList(V_96)
| ~ ssItem(U_95) ),
inference(cnfTransformation,[status(thm)],[f_428]) ).
tff(c_3519,plain,
( ( hd(sk1) = sk5 )
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_3500,c_194]) ).
tff(c_3532,plain,
hd(sk1) = sk5,
inference(demodulation,[status(thm),theory(equality)],[c_420,c_426,c_3519]) ).
tff(c_192,plain,
! [U_93,V_94] :
( ( tl(cons(U_93,V_94)) = V_94 )
| ~ ssList(V_94)
| ~ ssItem(U_93) ),
inference(cnfTransformation,[status(thm)],[f_420]) ).
tff(c_3513,plain,
( ( tl(sk1) = sk6 )
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_3500,c_192]) ).
tff(c_3528,plain,
tl(sk1) = sk6,
inference(demodulation,[status(thm),theory(equality)],[c_420,c_426,c_3513]) ).
tff(c_406,plain,
( ~ neq(sk4,nil)
| ~ neq(sk1,nil)
| ~ neq(nil,sk1)
| ~ ssItem(hd(sk1))
| ~ ssList(cons(hd(sk1),nil))
| ~ ssList(tl(sk1))
| ( app(tl(sk1),cons(hd(sk1),nil)) != sk2 )
| ~ ssList(app(tl(sk1),cons(hd(sk1),nil))) ),
inference(cnfTransformation,[status(thm)],[f_1762]) ).
tff(c_415,plain,
( ~ neq(sk2,nil)
| ~ neq(sk1,nil)
| ~ neq(nil,sk1)
| ~ ssItem(hd(sk1))
| ~ ssList(cons(hd(sk1),nil))
| ~ ssList(tl(sk1))
| ( app(tl(sk1),cons(hd(sk1),nil)) != sk2 )
| ~ ssList(app(tl(sk1),cons(hd(sk1),nil))) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_406]) ).
tff(c_422,plain,
( ~ neq(sk1,nil)
| ~ neq(nil,sk1)
| ~ ssItem(hd(sk1))
| ~ ssList(cons(hd(sk1),nil))
| ~ ssList(tl(sk1))
| ( app(tl(sk1),cons(hd(sk1),nil)) != sk2 )
| ~ ssList(app(tl(sk1),cons(hd(sk1),nil))) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_415]) ).
tff(c_10429,plain,
( ~ neq(sk1,nil)
| ~ neq(nil,sk1)
| ~ ssList(cons(sk5,nil)) ),
inference(demodulation,[status(thm),theory(equality)],[c_429,c_424,c_3532,c_3528,c_424,c_3532,c_3528,c_426,c_3528,c_3532,c_420,c_3532,c_422]) ).
tff(c_10430,plain,
~ ssList(cons(sk5,nil)),
inference(splitLeft,[status(thm)],[c_10429]) ).
tff(c_10433,plain,
( ~ ssList(nil)
| ~ ssItem(sk5) ),
inference(resolution,[status(thm)],[c_172,c_10430]) ).
tff(c_10437,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_420,c_16,c_10433]) ).
tff(c_10438,plain,
( ~ neq(nil,sk1)
| ~ neq(sk1,nil) ),
inference(splitRight,[status(thm)],[c_10429]) ).
tff(c_10633,plain,
~ neq(sk1,nil),
inference(splitLeft,[status(thm)],[c_10438]) ).
tff(c_10639,plain,
( ( sk1 = nil )
| ~ ssList(sk1)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_200,c_10633]) ).
tff(c_10645,plain,
sk1 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_430,c_10639]) ).
tff(c_10647,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_3506,c_10645]) ).
tff(c_10648,plain,
~ neq(nil,sk1),
inference(splitRight,[status(thm)],[c_10438]) ).
tff(c_10655,plain,
( ( sk1 = nil )
| ~ ssList(nil)
| ~ ssList(sk1) ),
inference(resolution,[status(thm)],[c_200,c_10648]) ).
tff(c_10661,plain,
sk1 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_430,c_16,c_10655]) ).
tff(c_10663,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_3506,c_10661]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC316-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n005.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 : Thu Aug 3 21:24:27 EDT 2023
% 0.13/0.35 % CPUTime :
% 14.56/5.22 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.56/5.23
% 14.56/5.23 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 14.91/5.26
% 14.91/5.26 Inference rules
% 14.91/5.26 ----------------------
% 14.91/5.26 #Ref : 0
% 14.91/5.26 #Sup : 2234
% 14.91/5.26 #Fact : 0
% 14.91/5.26 #Define : 0
% 14.91/5.26 #Split : 15
% 14.91/5.26 #Chain : 0
% 14.91/5.26 #Close : 0
% 14.91/5.26
% 14.91/5.26 Ordering : KBO
% 14.91/5.26
% 14.91/5.26 Simplification rules
% 14.91/5.26 ----------------------
% 14.91/5.26 #Subsume : 167
% 14.91/5.26 #Demod : 2454
% 14.91/5.26 #Tautology : 578
% 14.91/5.26 #SimpNegUnit : 19
% 14.91/5.26 #BackRed : 1
% 14.91/5.26
% 14.91/5.26 #Partial instantiations: 0
% 14.91/5.26 #Strategies tried : 1
% 14.91/5.26
% 14.91/5.26 Timing (in seconds)
% 14.91/5.26 ----------------------
% 14.91/5.27 Preprocessing : 0.86
% 14.91/5.27 Parsing : 0.44
% 14.91/5.27 CNF conversion : 0.07
% 14.91/5.27 Main loop : 3.33
% 14.91/5.27 Inferencing : 0.75
% 14.91/5.27 Reduction : 1.59
% 14.91/5.27 Demodulation : 1.21
% 14.91/5.27 BG Simplification : 0.09
% 14.91/5.27 Subsumption : 0.68
% 14.91/5.27 Abstraction : 0.07
% 14.91/5.27 MUC search : 0.00
% 14.91/5.27 Cooper : 0.00
% 14.91/5.27 Total : 4.25
% 14.91/5.27 Index Insertion : 0.00
% 14.91/5.27 Index Deletion : 0.00
% 14.91/5.27 Index Matching : 0.00
% 14.91/5.27 BG Taut test : 0.00
%------------------------------------------------------------------------------