TSTP Solution File: SWC029-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC029-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 : n017.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:00:50 EDT 2023
% Result : Unsatisfiable 14.43s 4.88s
% Output : CNFRefutation 14.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 87
% Syntax : Number of formulae : 125 ( 25 unt; 74 typ; 0 def)
% Number of atoms : 92 ( 35 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 86 ( 45 ~; 41 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 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 : 55 ( 55 usr; 9 con; 0-2 aty)
% Number of variables : 13 (; 13 !; 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_1673,axiom,
( ( nil = sk2 )
| ( nil = sk1 ) ),
file(unknown,unknown) ).
tff(f_1686,axiom,
( ( nil != sk1 )
| ( nil != sk2 ) ),
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_56,axiom,
ssList(nil),
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_1658,axiom,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1662,axiom,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1670,axiom,
( ( app(sk6,cons(sk5,nil)) = sk3 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1405,axiom,
! [U,V,W,X] :
( ( app(U,cons(V,W)) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(V)
| ~ ssList(X)
| memberP(X,V) ),
file(unknown,unknown) ).
tff(f_233,axiom,
! [U] :
( ~ memberP(nil,U)
| ~ ssItem(U) ),
file(unknown,unknown) ).
tff(c_394,plain,
( ( sk1 = nil )
| ( sk2 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1673]) ).
tff(c_460,plain,
sk2 = nil,
inference(splitLeft,[status(thm)],[c_394]) ).
tff(c_400,plain,
( ( sk2 != nil )
| ( sk1 != nil ) ),
inference(cnfTransformation,[status(thm)],[f_1686]) ).
tff(c_475,plain,
sk1 != nil,
inference(demodulation,[status(thm),theory(equality)],[c_460,c_400]) ).
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_406,plain,
( ( sk2 != nil )
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_401]) ).
tff(c_477,plain,
sk1 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_460,c_406]) ).
tff(c_478,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_475,c_477]) ).
tff(c_480,plain,
sk2 != nil,
inference(splitRight,[status(thm)],[c_394]) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
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_1858,plain,
! [V_504,U_505] :
( ( V_504 = U_505 )
| neq(V_504,U_505)
| ~ ssList(V_504)
| ~ ssList(U_505) ),
inference(cnfTransformation,[status(thm)],[f_456]) ).
tff(c_386,plain,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1658]) ).
tff(c_404,plain,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_386]) ).
tff(c_508,plain,
~ neq(sk2,nil),
inference(splitLeft,[status(thm)],[c_404]) ).
tff(c_1861,plain,
( ( sk2 = nil )
| ~ ssList(sk2)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_1858,c_508]) ).
tff(c_1872,plain,
sk2 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_408,c_1861]) ).
tff(c_1874,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_480,c_1872]) ).
tff(c_1875,plain,
ssItem(sk5),
inference(splitRight,[status(thm)],[c_404]) ).
tff(c_1876,plain,
neq(sk2,nil),
inference(splitRight,[status(thm)],[c_404]) ).
tff(c_388,plain,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1662]) ).
tff(c_403,plain,
( ~ neq(sk2,nil)
| ssList(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_388]) ).
tff(c_1878,plain,
ssList(sk6),
inference(demodulation,[status(thm),theory(equality)],[c_1876,c_403]) ).
tff(c_479,plain,
sk1 = nil,
inference(splitRight,[status(thm)],[c_394]) ).
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_3577,plain,
app(sk6,cons(sk5,nil)) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_479,c_1876,c_407]) ).
tff(c_10385,plain,
! [U_1011,V_1012,W_1013] :
( memberP(app(U_1011,cons(V_1012,W_1013)),V_1012)
| ~ ssList(app(U_1011,cons(V_1012,W_1013)))
| ~ ssItem(V_1012)
| ~ ssList(U_1011)
| ~ ssList(W_1013) ),
inference(cnfTransformation,[status(thm)],[f_1405]) ).
tff(c_10425,plain,
( memberP(nil,sk5)
| ~ ssList(app(sk6,cons(sk5,nil)))
| ~ ssItem(sk5)
| ~ ssList(sk6)
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_3577,c_10385]) ).
tff(c_10441,plain,
memberP(nil,sk5),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_1878,c_1875,c_16,c_3577,c_10425]) ).
tff(c_142,plain,
! [U_65] :
( ~ ssItem(U_65)
| ~ memberP(nil,U_65) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_10446,plain,
~ ssItem(sk5),
inference(resolution,[status(thm)],[c_10441,c_142]) ).
tff(c_10450,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1875,c_10446]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC029-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.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 20:49:06 EDT 2023
% 0.14/0.36 % CPUTime :
% 14.43/4.88 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.43/4.89
% 14.43/4.89 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 14.51/4.92
% 14.51/4.92 Inference rules
% 14.51/4.92 ----------------------
% 14.51/4.92 #Ref : 0
% 14.51/4.92 #Sup : 2194
% 14.51/4.92 #Fact : 0
% 14.51/4.92 #Define : 0
% 14.51/4.92 #Split : 14
% 14.51/4.92 #Chain : 0
% 14.51/4.92 #Close : 0
% 14.51/4.92
% 14.51/4.92 Ordering : KBO
% 14.51/4.92
% 14.51/4.92 Simplification rules
% 14.51/4.92 ----------------------
% 14.51/4.92 #Subsume : 138
% 14.51/4.92 #Demod : 2109
% 14.51/4.92 #Tautology : 628
% 14.51/4.92 #SimpNegUnit : 18
% 14.51/4.92 #BackRed : 6
% 14.51/4.92
% 14.51/4.92 #Partial instantiations: 0
% 14.51/4.92 #Strategies tried : 1
% 14.51/4.92
% 14.51/4.92 Timing (in seconds)
% 14.51/4.92 ----------------------
% 14.51/4.93 Preprocessing : 0.85
% 14.51/4.93 Parsing : 0.43
% 14.51/4.93 CNF conversion : 0.06
% 14.51/4.93 Main loop : 2.99
% 14.51/4.93 Inferencing : 0.81
% 14.51/4.93 Reduction : 1.36
% 14.51/4.93 Demodulation : 1.03
% 14.51/4.93 BG Simplification : 0.09
% 14.51/4.93 Subsumption : 0.56
% 14.51/4.93 Abstraction : 0.07
% 14.51/4.93 MUC search : 0.00
% 14.51/4.93 Cooper : 0.00
% 14.51/4.93 Total : 3.90
% 14.51/4.93 Index Insertion : 0.00
% 14.51/4.93 Index Deletion : 0.00
% 14.51/4.93 Index Matching : 0.00
% 14.51/4.93 BG Taut test : 0.00
%------------------------------------------------------------------------------