TSTP Solution File: SWC310-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC310-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n014.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:03 EDT 2023
% Result : Unsatisfiable 15.69s 5.45s
% Output : CNFRefutation 15.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 93
% Syntax : Number of formulae : 147 ( 31 unt; 74 typ; 0 def)
% Number of atoms : 149 ( 54 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 156 ( 80 ~; 76 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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 : 27 (; 27 !; 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_56,axiom,
ssList(nil),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1654,axiom,
( ( nil = sk3 )
| ( nil != sk4 ) ),
file(unknown,unknown) ).
tff(f_1648,axiom,
ssList(sk4),
file(unknown,unknown) ).
tff(f_456,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ),
file(unknown,unknown) ).
tff(f_1673,axiom,
( ( nil = sk2 )
| neq(sk2,nil) ),
file(unknown,unknown) ).
tff(f_1658,axiom,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_342,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
file(unknown,unknown) ).
tff(f_1647,axiom,
ssList(sk3),
file(unknown,unknown) ).
tff(f_1670,axiom,
( ( app(sk6,cons(sk5,nil)) = sk3 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1662,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_1666,axiom,
( ( app(cons(sk5,nil),sk6) = sk4 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_420,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ( tl(cons(U,V)) = V ) ),
file(unknown,unknown) ).
tff(f_428,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) ),
file(unknown,unknown) ).
tff(f_1708,axiom,
! [A,B,C,D] :
( ( nil = sk2 )
| ~ ssList(A)
| ( sk1 != A )
| ~ ssList(B)
| ~ ssList(C)
| ( tl(sk2) != B )
| ( app(B,C) != A )
| ~ ssItem(D)
| ( cons(D,nil) != C )
| ( hd(sk2) != D )
| ~ neq(nil,sk2)
| ~ neq(nil,sk2) ),
file(unknown,unknown) ).
tff(f_1712,axiom,
( ( nil != sk1 )
| neq(sk2,nil) ),
file(unknown,unknown) ).
tff(f_613,axiom,
! [U,V] :
( ( U != V )
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) ),
file(unknown,unknown) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_384,plain,
( ( sk4 != nil )
| ( sk3 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1654]) ).
tff(c_401,plain,
( ( sk4 != nil )
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_384]) ).
tff(c_403,plain,
( ( sk2 != nil )
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_401]) ).
tff(c_460,plain,
sk2 != nil,
inference(splitLeft,[status(thm)],[c_403]) ).
tff(c_378,plain,
ssList(sk4),
inference(cnfTransformation,[status(thm)],[f_1648]) ).
tff(c_408,plain,
ssList(sk2),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_378]) ).
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_394,plain,
( neq(sk2,nil)
| ( sk2 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1673]) ).
tff(c_470,plain,
neq(sk2,nil),
inference(negUnitSimplification,[status(thm)],[c_460,c_394]) ).
tff(c_386,plain,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1658]) ).
tff(c_405,plain,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_386]) ).
tff(c_474,plain,
ssItem(sk5),
inference(demodulation,[status(thm),theory(equality)],[c_470,c_405]) ).
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_376,plain,
ssList(sk3),
inference(cnfTransformation,[status(thm)],[f_1647]) ).
tff(c_409,plain,
ssList(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_376]) ).
tff(c_392,plain,
( ~ neq(sk4,nil)
| ( app(sk6,cons(sk5,nil)) = sk3 ) ),
inference(cnfTransformation,[status(thm)],[f_1670]) ).
tff(c_402,plain,
( ~ neq(sk4,nil)
| ( app(sk6,cons(sk5,nil)) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_392]) ).
tff(c_407,plain,
( ~ neq(sk2,nil)
| ( app(sk6,cons(sk5,nil)) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_402]) ).
tff(c_2157,plain,
app(sk6,cons(sk5,nil)) = sk1,
inference(demodulation,[status(thm),theory(equality)],[c_470,c_407]) ).
tff(c_388,plain,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1662]) ).
tff(c_406,plain,
( ~ neq(sk2,nil)
| ssList(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_388]) ).
tff(c_479,plain,
ssList(sk6),
inference(demodulation,[status(thm),theory(equality)],[c_470,c_406]) ).
tff(c_2879,plain,
! [U_606,V_607] :
( ( app(cons(U_606,nil),V_607) = cons(U_606,V_607) )
| ~ ssList(V_607)
| ~ ssItem(U_606) ),
inference(cnfTransformation,[status(thm)],[f_666]) ).
tff(c_390,plain,
( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk6) = sk4 ) ),
inference(cnfTransformation,[status(thm)],[f_1666]) ).
tff(c_404,plain,
( ~ neq(sk2,nil)
| ( app(cons(sk5,nil),sk6) = sk2 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_390]) ).
tff(c_2137,plain,
app(cons(sk5,nil),sk6) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_470,c_404]) ).
tff(c_2885,plain,
( ( cons(sk5,sk6) = sk2 )
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_2879,c_2137]) ).
tff(c_2900,plain,
cons(sk5,sk6) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_474,c_479,c_2885]) ).
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_2915,plain,
( ( tl(sk2) = sk6 )
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_2900,c_192]) ).
tff(c_2929,plain,
tl(sk2) = sk6,
inference(demodulation,[status(thm),theory(equality)],[c_474,c_479,c_2915]) ).
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_2912,plain,
( ( hd(sk2) = sk5 )
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_2900,c_194]) ).
tff(c_2927,plain,
hd(sk2) = sk5,
inference(demodulation,[status(thm),theory(equality)],[c_474,c_479,c_2912]) ).
tff(c_396,plain,
( ~ neq(nil,sk2)
| ~ ssItem(hd(sk2))
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2))
| ( app(tl(sk2),cons(hd(sk2),nil)) != sk1 )
| ~ ssList(app(tl(sk2),cons(hd(sk2),nil)))
| ( sk2 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1708]) ).
tff(c_10258,plain,
( ~ neq(nil,sk2)
| ~ ssList(cons(sk5,nil))
| ( sk2 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_409,c_2157,c_2929,c_2927,c_2157,c_2929,c_2927,c_479,c_2929,c_2927,c_474,c_2927,c_396]) ).
tff(c_10259,plain,
( ~ neq(nil,sk2)
| ~ ssList(cons(sk5,nil)) ),
inference(negUnitSimplification,[status(thm)],[c_460,c_10258]) ).
tff(c_10260,plain,
~ ssList(cons(sk5,nil)),
inference(splitLeft,[status(thm)],[c_10259]) ).
tff(c_10263,plain,
( ~ ssList(nil)
| ~ ssItem(sk5) ),
inference(resolution,[status(thm)],[c_172,c_10260]) ).
tff(c_10267,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_474,c_16,c_10263]) ).
tff(c_10268,plain,
~ neq(nil,sk2),
inference(splitRight,[status(thm)],[c_10259]) ).
tff(c_10275,plain,
( ( sk2 = nil )
| ~ ssList(nil)
| ~ ssList(sk2) ),
inference(resolution,[status(thm)],[c_200,c_10268]) ).
tff(c_10281,plain,
sk2 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_408,c_16,c_10275]) ).
tff(c_10283,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_460,c_10281]) ).
tff(c_10284,plain,
sk1 = nil,
inference(splitRight,[status(thm)],[c_403]) ).
tff(c_10285,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_403]) ).
tff(c_398,plain,
( neq(sk2,nil)
| ( sk1 != nil ) ),
inference(cnfTransformation,[status(thm)],[f_1712]) ).
tff(c_10317,plain,
neq(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_10284,c_10285,c_398]) ).
tff(c_10322,plain,
! [V_941] :
( ~ ssList(V_941)
| ~ neq(V_941,V_941) ),
inference(cnfTransformation,[status(thm)],[f_613]) ).
tff(c_10325,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_10317,c_10322]) ).
tff(c_10329,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_10325]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC310-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34 % Computer : n014.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 : Thu Aug 3 21:11:48 EDT 2023
% 0.13/0.34 % CPUTime :
% 15.69/5.45 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.84/5.47
% 15.84/5.47 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 15.84/5.50
% 15.84/5.50 Inference rules
% 15.84/5.50 ----------------------
% 15.84/5.50 #Ref : 0
% 15.84/5.50 #Sup : 2165
% 15.84/5.50 #Fact : 0
% 15.84/5.50 #Define : 0
% 15.84/5.50 #Split : 13
% 15.84/5.50 #Chain : 0
% 15.84/5.50 #Close : 0
% 15.84/5.50
% 15.84/5.50 Ordering : KBO
% 15.84/5.50
% 15.84/5.50 Simplification rules
% 15.84/5.50 ----------------------
% 15.84/5.50 #Subsume : 161
% 15.84/5.50 #Demod : 2346
% 15.84/5.50 #Tautology : 582
% 15.84/5.50 #SimpNegUnit : 19
% 15.84/5.50 #BackRed : 4
% 15.84/5.50
% 15.84/5.50 #Partial instantiations: 0
% 15.84/5.50 #Strategies tried : 1
% 15.84/5.50
% 15.84/5.50 Timing (in seconds)
% 15.84/5.50 ----------------------
% 15.84/5.50 Preprocessing : 0.90
% 15.84/5.50 Parsing : 0.46
% 15.84/5.50 CNF conversion : 0.06
% 15.84/5.50 Main loop : 3.41
% 15.84/5.50 Inferencing : 0.84
% 15.84/5.50 Reduction : 1.62
% 15.84/5.50 Demodulation : 1.24
% 15.84/5.51 BG Simplification : 0.10
% 15.84/5.51 Subsumption : 0.64
% 15.84/5.51 Abstraction : 0.07
% 15.84/5.51 MUC search : 0.00
% 15.84/5.51 Cooper : 0.00
% 15.84/5.51 Total : 4.37
% 15.84/5.51 Index Insertion : 0.00
% 15.84/5.51 Index Deletion : 0.00
% 15.84/5.51 Index Matching : 0.00
% 15.84/5.51 BG Taut test : 0.00
%------------------------------------------------------------------------------