TSTP Solution File: SWC314-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC314-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 : n024.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:05 EDT 2023
% Result : Unsatisfiable 179.67s 159.69s
% Output : CNFRefutation 179.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 95
% Syntax : Number of formulae : 170 ( 41 unt; 74 typ; 0 def)
% Number of atoms : 212 ( 75 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 242 ( 126 ~; 116 |; 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 : 40 (; 40 !; 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_1692,axiom,
( ssItem(sk5)
| ( 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_1648,axiom,
ssList(sk4),
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_1699,axiom,
( ssList(sk6)
| ( nil = sk2 ) ),
file(unknown,unknown) ).
tff(f_1702,axiom,
( ( app(cons(sk5,nil),sk6) = sk2 )
| ( nil = sk2 ) ),
file(unknown,unknown) ).
tff(f_961,axiom,
! [U,V,W] :
( ( app(U,V) != W )
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| rearsegP(W,V) ),
file(unknown,unknown) ).
tff(f_334,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| ssList(app(V,U)) ),
file(unknown,unknown) ).
tff(f_1706,axiom,
( ( app(sk6,cons(sk5,nil)) != sk1 )
| ( nil = sk2 ) ),
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_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_1689,axiom,
! [A,B,C,D] :
( ~ ssList(A)
| ( sk3 = A )
| ~ ssList(B)
| ~ ssList(C)
| ( tl(sk4) != B )
| ( app(B,C) != A )
| ~ ssItem(D)
| ( cons(D,nil) != C )
| ( hd(sk4) != D )
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1710,axiom,
( ssList(sk6)
| ( nil != sk1 ) ),
file(unknown,unknown) ).
tff(f_437,axiom,
! [U,V] :
( ( cons(U,V) != nil )
| ~ ssItem(U)
| ~ ssList(V) ),
file(unknown,unknown) ).
tff(f_1714,axiom,
( ( app(cons(sk5,nil),sk6) = sk2 )
| ( nil != sk1 ) ),
file(unknown,unknown) ).
tff(f_1696,axiom,
( ssItem(sk5)
| ( nil != sk1 ) ),
file(unknown,unknown) ).
tff(c_388,plain,
( ( sk2 = nil )
| ssItem(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1692]) ).
tff(c_455,plain,
ssItem(sk5),
inference(splitLeft,[status(thm)],[c_388]) ).
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_403,plain,
( ( sk4 != nil )
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_384]) ).
tff(c_405,plain,
( ( sk2 != nil )
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_403]) ).
tff(c_458,plain,
sk2 != nil,
inference(splitLeft,[status(thm)],[c_405]) ).
tff(c_378,plain,
ssList(sk4),
inference(cnfTransformation,[status(thm)],[f_1648]) ).
tff(c_407,plain,
ssList(sk2),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_378]) ).
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_392,plain,
( ( sk2 = nil )
| ssList(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1699]) ).
tff(c_465,plain,
ssList(sk6),
inference(negUnitSimplification,[status(thm)],[c_458,c_392]) ).
tff(c_394,plain,
( ( sk2 = nil )
| ( app(cons(sk5,nil),sk6) = sk2 ) ),
inference(cnfTransformation,[status(thm)],[f_1702]) ).
tff(c_1502,plain,
app(cons(sk5,nil),sk6) = sk2,
inference(negUnitSimplification,[status(thm)],[c_458,c_394]) ).
tff(c_4317,plain,
! [U_657,V_658] :
( rearsegP(app(U_657,V_658),V_658)
| ~ ssList(app(U_657,V_658))
| ~ ssList(V_658)
| ~ ssList(U_657) ),
inference(cnfTransformation,[status(thm)],[f_961]) ).
tff(c_4403,plain,
( rearsegP(sk2,sk6)
| ~ ssList(app(cons(sk5,nil),sk6))
| ~ ssList(sk6)
| ~ ssList(cons(sk5,nil)) ),
inference(superposition,[status(thm),theory(equality)],[c_1502,c_4317]) ).
tff(c_4533,plain,
( rearsegP(sk2,sk6)
| ~ ssList(cons(sk5,nil)) ),
inference(demodulation,[status(thm),theory(equality)],[c_465,c_407,c_1502,c_4403]) ).
tff(c_11741,plain,
~ ssList(cons(sk5,nil)),
inference(splitLeft,[status(thm)],[c_4533]) ).
tff(c_11744,plain,
( ~ ssList(nil)
| ~ ssItem(sk5) ),
inference(resolution,[status(thm)],[c_172,c_11741]) ).
tff(c_11748,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_455,c_16,c_11744]) ).
tff(c_11750,plain,
ssList(cons(sk5,nil)),
inference(splitRight,[status(thm)],[c_4533]) ).
tff(c_170,plain,
! [V_81,U_80] :
( ssList(app(V_81,U_80))
| ~ ssList(V_81)
| ~ ssList(U_80) ),
inference(cnfTransformation,[status(thm)],[f_334]) ).
tff(c_396,plain,
( ( sk2 = nil )
| ( app(sk6,cons(sk5,nil)) != sk1 ) ),
inference(cnfTransformation,[status(thm)],[f_1706]) ).
tff(c_1744,plain,
app(sk6,cons(sk5,nil)) != sk1,
inference(negUnitSimplification,[status(thm)],[c_458,c_396]) ).
tff(c_3751,plain,
! [U_631,V_632] :
( ( app(cons(U_631,nil),V_632) = cons(U_631,V_632) )
| ~ ssList(V_632)
| ~ ssItem(U_631) ),
inference(cnfTransformation,[status(thm)],[f_666]) ).
tff(c_3760,plain,
( ( cons(sk5,sk6) = sk2 )
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_3751,c_1502]) ).
tff(c_3775,plain,
cons(sk5,sk6) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_455,c_465,c_3760]) ).
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_3793,plain,
( ( tl(sk2) = sk6 )
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_3775,c_192]) ).
tff(c_3806,plain,
tl(sk2) = sk6,
inference(demodulation,[status(thm),theory(equality)],[c_455,c_465,c_3793]) ).
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_3787,plain,
( ( hd(sk2) = sk5 )
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_3775,c_194]) ).
tff(c_3802,plain,
hd(sk2) = sk5,
inference(demodulation,[status(thm),theory(equality)],[c_455,c_465,c_3787]) ).
tff(c_386,plain,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4))
| ( app(tl(sk4),cons(hd(sk4),nil)) = sk3 )
| ~ ssList(app(tl(sk4),cons(hd(sk4),nil))) ),
inference(cnfTransformation,[status(thm)],[f_1689]) ).
tff(c_404,plain,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssList(tl(sk4))
| ( app(tl(sk4),cons(hd(sk4),nil)) = sk1 )
| ~ ssList(app(tl(sk4),cons(hd(sk4),nil))) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_386]) ).
tff(c_406,plain,
( ~ neq(sk2,nil)
| ~ 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))) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_380,c_380,c_380,c_380,c_380,c_380,c_380,c_404]) ).
tff(c_10723,plain,
( ~ neq(sk2,nil)
| ~ neq(nil,sk2)
| ~ ssList(cons(sk5,nil))
| ( app(sk6,cons(sk5,nil)) = sk1 )
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(demodulation,[status(thm),theory(equality)],[c_3806,c_3802,c_3806,c_3802,c_465,c_3806,c_3802,c_455,c_3802,c_406]) ).
tff(c_10724,plain,
( ~ neq(sk2,nil)
| ~ neq(nil,sk2)
| ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(negUnitSimplification,[status(thm)],[c_1744,c_10723]) ).
tff(c_10725,plain,
~ ssList(app(sk6,cons(sk5,nil))),
inference(splitLeft,[status(thm)],[c_10724]) ).
tff(c_11021,plain,
( ~ ssList(sk6)
| ~ ssList(cons(sk5,nil)) ),
inference(resolution,[status(thm)],[c_170,c_10725]) ).
tff(c_11024,plain,
~ ssList(cons(sk5,nil)),
inference(demodulation,[status(thm),theory(equality)],[c_465,c_11021]) ).
tff(c_11027,plain,
( ~ ssList(nil)
| ~ ssItem(sk5) ),
inference(resolution,[status(thm)],[c_172,c_11024]) ).
tff(c_11031,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_455,c_16,c_11027]) ).
tff(c_11032,plain,
( ~ ssList(cons(sk5,nil))
| ~ neq(nil,sk2)
| ~ neq(sk2,nil) ),
inference(splitRight,[status(thm)],[c_10724]) ).
tff(c_186713,plain,
( ~ neq(nil,sk2)
| ~ neq(sk2,nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_11750,c_11032]) ).
tff(c_186714,plain,
~ neq(sk2,nil),
inference(splitLeft,[status(thm)],[c_186713]) ).
tff(c_186717,plain,
( ( sk2 = nil )
| ~ ssList(sk2)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_200,c_186714]) ).
tff(c_186723,plain,
sk2 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_407,c_186717]) ).
tff(c_186725,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_458,c_186723]) ).
tff(c_186726,plain,
~ neq(nil,sk2),
inference(splitRight,[status(thm)],[c_186713]) ).
tff(c_186730,plain,
( ( sk2 = nil )
| ~ ssList(nil)
| ~ ssList(sk2) ),
inference(resolution,[status(thm)],[c_200,c_186726]) ).
tff(c_186736,plain,
sk2 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_407,c_16,c_186730]) ).
tff(c_186738,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_458,c_186736]) ).
tff(c_186739,plain,
sk1 = nil,
inference(splitRight,[status(thm)],[c_405]) ).
tff(c_398,plain,
( ( sk1 != nil )
| ssList(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1710]) ).
tff(c_186764,plain,
ssList(sk6),
inference(demodulation,[status(thm),theory(equality)],[c_186739,c_398]) ).
tff(c_187835,plain,
! [V_7313,U_7314] :
( ~ ssList(V_7313)
| ~ ssItem(U_7314)
| ( cons(U_7314,V_7313) != nil ) ),
inference(cnfTransformation,[status(thm)],[f_437]) ).
tff(c_188312,plain,
! [U_7343] :
( ~ ssItem(U_7343)
| ( cons(U_7343,sk6) != nil ) ),
inference(resolution,[status(thm)],[c_186764,c_187835]) ).
tff(c_188371,plain,
cons(sk5,sk6) != nil,
inference(resolution,[status(thm)],[c_455,c_188312]) ).
tff(c_189856,plain,
! [U_7513,V_7514] :
( ( app(cons(U_7513,nil),V_7514) = cons(U_7513,V_7514) )
| ~ ssList(V_7514)
| ~ ssItem(U_7513) ),
inference(cnfTransformation,[status(thm)],[f_666]) ).
tff(c_186740,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_405]) ).
tff(c_400,plain,
( ( sk1 != nil )
| ( app(cons(sk5,nil),sk6) = sk2 ) ),
inference(cnfTransformation,[status(thm)],[f_1714]) ).
tff(c_187385,plain,
app(cons(sk5,nil),sk6) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_186740,c_186739,c_400]) ).
tff(c_189868,plain,
( ( cons(sk5,sk6) = nil )
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_189856,c_187385]) ).
tff(c_189880,plain,
cons(sk5,sk6) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_455,c_186764,c_189868]) ).
tff(c_189882,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_188371,c_189880]) ).
tff(c_189884,plain,
~ ssItem(sk5),
inference(splitRight,[status(thm)],[c_388]) ).
tff(c_189883,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_388]) ).
tff(c_189901,plain,
sk1 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_189883,c_405]) ).
tff(c_390,plain,
( ( sk1 != nil )
| ssItem(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1696]) ).
tff(c_189917,plain,
ssItem(sk5),
inference(demodulation,[status(thm),theory(equality)],[c_189901,c_390]) ).
tff(c_189918,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_189884,c_189917]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWC314-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/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.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 21:36:45 EDT 2023
% 0.15/0.36 % CPUTime :
% 179.67/159.69 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 179.76/159.70
% 179.76/159.70 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 179.76/159.73
% 179.76/159.73 Inference rules
% 179.76/159.73 ----------------------
% 179.76/159.73 #Ref : 51
% 179.76/159.73 #Sup : 47566
% 179.76/159.73 #Fact : 0
% 179.76/159.73 #Define : 0
% 179.76/159.73 #Split : 63
% 179.76/159.73 #Chain : 0
% 179.76/159.73 #Close : 0
% 179.76/159.73
% 179.76/159.73 Ordering : KBO
% 179.76/159.73
% 179.76/159.73 Simplification rules
% 179.76/159.73 ----------------------
% 179.76/159.73 #Subsume : 9505
% 179.76/159.73 #Demod : 36731
% 179.76/159.73 #Tautology : 5716
% 179.76/159.73 #SimpNegUnit : 1124
% 179.76/159.73 #BackRed : 178
% 179.76/159.73
% 179.76/159.73 #Partial instantiations: 0
% 179.76/159.73 #Strategies tried : 1
% 179.76/159.73
% 179.76/159.73 Timing (in seconds)
% 179.76/159.73 ----------------------
% 179.76/159.74 Preprocessing : 0.86
% 179.76/159.74 Parsing : 0.44
% 179.76/159.74 CNF conversion : 0.06
% 179.76/159.74 Main loop : 157.71
% 179.76/159.74 Inferencing : 17.57
% 179.76/159.74 Reduction : 72.62
% 179.76/159.74 Demodulation : 49.91
% 179.76/159.74 BG Simplification : 0.38
% 179.76/159.74 Subsumption : 53.61
% 179.76/159.74 Abstraction : 0.97
% 179.76/159.74 MUC search : 0.00
% 179.76/159.74 Cooper : 0.00
% 179.76/159.74 Total : 158.63
% 179.76/159.74 Index Insertion : 0.00
% 179.76/159.74 Index Deletion : 0.00
% 179.76/159.74 Index Matching : 0.00
% 179.76/159.74 BG Taut test : 0.00
%------------------------------------------------------------------------------