TSTP Solution File: SWC354-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC354-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 : n004.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:16 EDT 2023
% Result : Unsatisfiable 265.16s 242.37s
% Output : CNFRefutation 265.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 96
% Syntax : Number of formulae : 198 ( 60 unt; 72 typ; 0 def)
% Number of atoms : 280 ( 79 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 314 ( 160 ~; 154 |; 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 : 53 ( 53 usr; 7 con; 0-2 aty)
% Number of variables : 66 (; 66 !; 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 > 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(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(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_250,axiom,
! [U] :
( ~ ssList(U)
| ( app(nil,U) = U ) ),
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_1653,axiom,
( neq(sk2,nil)
| neq(sk2,nil) ),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1705,axiom,
( ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_64,axiom,
! [U] : ssList(skaf82(U)),
file(unknown,unknown) ).
tff(f_1648,axiom,
ssList(sk4),
file(unknown,unknown) ).
tff(f_975,axiom,
! [U,V,W] :
( ( app(U,V) != W )
| ~ ssList(V)
| ~ ssList(U)
| ~ ssList(W)
| frontsegP(W,U) ),
file(unknown,unknown) ).
tff(f_278,axiom,
! [U] :
( ~ ssList(U)
| ssItem(hd(U))
| ( nil = U ) ),
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_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1700,axiom,
! [A,B] :
( ~ ssList(A)
| ( sk3 = A )
| ~ ssItem(B)
| ( cons(B,nil) != A )
| ( hd(sk4) != B )
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_784,axiom,
! [U,V] :
( ~ frontsegP(U,V)
| ~ frontsegP(V,U)
| ~ ssList(U)
| ~ ssList(V)
| ( V = U ) ),
file(unknown,unknown) ).
tff(f_428,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ( hd(cons(U,V)) = U ) ),
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_62,axiom,
! [U] : ssItem(skaf83(U)),
file(unknown,unknown) ).
tff(f_543,axiom,
! [U] :
( ~ ssList(U)
| ( cons(skaf83(U),skaf82(U)) = U )
| ( nil = U ) ),
file(unknown,unknown) ).
tff(f_1647,axiom,
ssList(sk3),
file(unknown,unknown) ).
tff(f_1371,axiom,
! [U,V,W,X] :
( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(X)
| segmentP(X,V) ),
file(unknown,unknown) ).
tff(f_245,axiom,
! [U] :
( ~ ssList(U)
| ( app(U,nil) = U ) ),
file(unknown,unknown) ).
tff(f_770,axiom,
! [U,V] :
( ~ rearsegP(U,V)
| ~ rearsegP(V,U)
| ~ ssList(U)
| ~ ssList(V)
| ( V = U ) ),
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_472,plain,
! [U_392] :
( ( app(nil,U_392) = U_392 )
| ~ ssList(U_392) ),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_592,plain,
app(nil,nil) = nil,
inference(resolution,[status(thm)],[c_16,c_472]) ).
tff(c_10024,plain,
! [U_1005,V_1006] :
( rearsegP(app(U_1005,V_1006),V_1006)
| ~ ssList(app(U_1005,V_1006))
| ~ ssList(V_1006)
| ~ ssList(U_1005) ),
inference(cnfTransformation,[status(thm)],[f_961]) ).
tff(c_10167,plain,
( rearsegP(nil,nil)
| ~ ssList(app(nil,nil))
| ~ ssList(nil)
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_592,c_10024]) ).
tff(c_10266,plain,
rearsegP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_16,c_16,c_592,c_10167]) ).
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_394,plain,
( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1) ),
inference(cnfTransformation,[status(thm)],[f_1705]) ).
tff(c_399,plain,
( ~ neq(sk2,nil)
| ~ segmentP(sk2,sk1) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_394]) ).
tff(c_402,plain,
~ segmentP(sk2,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_399]) ).
tff(c_26,plain,
! [U_2] : ssList(skaf82(U_2)),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_378,plain,
ssList(sk4),
inference(cnfTransformation,[status(thm)],[f_1648]) ).
tff(c_405,plain,
ssList(sk2),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_378]) ).
tff(c_9705,plain,
! [U_998,V_999] :
( frontsegP(app(U_998,V_999),U_998)
| ~ ssList(app(U_998,V_999))
| ~ ssList(U_998)
| ~ ssList(V_999) ),
inference(cnfTransformation,[status(thm)],[f_975]) ).
tff(c_9845,plain,
( frontsegP(nil,nil)
| ~ ssList(app(nil,nil))
| ~ ssList(nil)
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_592,c_9705]) ).
tff(c_9942,plain,
frontsegP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_16,c_16,c_592,c_9845]) ).
tff(c_156,plain,
! [U_73] :
( ( nil = U_73 )
| ssItem(hd(U_73))
| ~ ssList(U_73) ),
inference(cnfTransformation,[status(thm)],[f_278]) ).
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_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_392,plain,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ( cons(hd(sk4),nil) = sk3 )
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cnfTransformation,[status(thm)],[f_1700]) ).
tff(c_398,plain,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ( cons(hd(sk4),nil) = sk1 )
| ~ ssList(cons(hd(sk4),nil)) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_392]) ).
tff(c_400,plain,
( ~ neq(sk2,nil)
| ~ neq(nil,sk2)
| ~ ssItem(hd(sk2))
| ( cons(hd(sk2),nil) = sk1 )
| ~ ssList(cons(hd(sk2),nil)) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_380,c_380,c_380,c_398]) ).
tff(c_404,plain,
( ~ neq(nil,sk2)
| ~ ssItem(hd(sk2))
| ( cons(hd(sk2),nil) = sk1 )
| ~ ssList(cons(hd(sk2),nil)) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_400]) ).
tff(c_13118,plain,
~ ssList(cons(hd(sk2),nil)),
inference(splitLeft,[status(thm)],[c_404]) ).
tff(c_13121,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sk2)) ),
inference(resolution,[status(thm)],[c_172,c_13118]) ).
tff(c_13124,plain,
~ ssItem(hd(sk2)),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_13121]) ).
tff(c_13127,plain,
( ( sk2 = nil )
| ~ ssList(sk2) ),
inference(resolution,[status(thm)],[c_156,c_13124]) ).
tff(c_13130,plain,
sk2 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_405,c_13127]) ).
tff(c_590,plain,
app(nil,sk2) = sk2,
inference(resolution,[status(thm)],[c_405,c_472]) ).
tff(c_9851,plain,
( frontsegP(sk2,nil)
| ~ ssList(app(nil,sk2))
| ~ ssList(nil)
| ~ ssList(sk2) ),
inference(superposition,[status(thm),theory(equality)],[c_590,c_9705]) ).
tff(c_9946,plain,
frontsegP(sk2,nil),
inference(demodulation,[status(thm),theory(equality)],[c_405,c_16,c_405,c_590,c_9851]) ).
tff(c_258,plain,
! [V_157,U_156] :
( ( V_157 = U_156 )
| ~ ssList(V_157)
| ~ ssList(U_156)
| ~ frontsegP(V_157,U_156)
| ~ frontsegP(U_156,V_157) ),
inference(cnfTransformation,[status(thm)],[f_784]) ).
tff(c_10002,plain,
( ( sk2 = nil )
| ~ ssList(sk2)
| ~ ssList(nil)
| ~ frontsegP(nil,sk2) ),
inference(resolution,[status(thm)],[c_9946,c_258]) ).
tff(c_10005,plain,
( ( sk2 = nil )
| ~ frontsegP(nil,sk2) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_405,c_10002]) ).
tff(c_13115,plain,
~ frontsegP(nil,sk2),
inference(splitLeft,[status(thm)],[c_10005]) ).
tff(c_13133,plain,
~ frontsegP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_13130,c_13115]) ).
tff(c_13186,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_9942,c_13133]) ).
tff(c_13187,plain,
( ~ ssItem(hd(sk2))
| ~ neq(nil,sk2)
| ( cons(hd(sk2),nil) = sk1 ) ),
inference(splitRight,[status(thm)],[c_404]) ).
tff(c_13337,plain,
~ neq(nil,sk2),
inference(splitLeft,[status(thm)],[c_13187]) ).
tff(c_13343,plain,
( ( sk2 = nil )
| ~ ssList(nil)
| ~ ssList(sk2) ),
inference(resolution,[status(thm)],[c_200,c_13337]) ).
tff(c_13347,plain,
sk2 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_405,c_16,c_13343]) ).
tff(c_13351,plain,
~ frontsegP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_13347,c_13115]) ).
tff(c_13404,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_9942,c_13351]) ).
tff(c_13405,plain,
( ~ ssItem(hd(sk2))
| ( cons(hd(sk2),nil) = sk1 ) ),
inference(splitRight,[status(thm)],[c_13187]) ).
tff(c_13722,plain,
~ ssItem(hd(sk2)),
inference(splitLeft,[status(thm)],[c_13405]) ).
tff(c_13725,plain,
( ( sk2 = nil )
| ~ ssList(sk2) ),
inference(resolution,[status(thm)],[c_156,c_13722]) ).
tff(c_13728,plain,
sk2 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_405,c_13725]) ).
tff(c_13733,plain,
~ frontsegP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_13728,c_13115]) ).
tff(c_13786,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_9942,c_13733]) ).
tff(c_13788,plain,
ssItem(hd(sk2)),
inference(splitRight,[status(thm)],[c_13405]) ).
tff(c_13787,plain,
cons(hd(sk2),nil) = sk1,
inference(splitRight,[status(thm)],[c_13405]) ).
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_13885,plain,
( ( hd(sk2) = hd(sk1) )
| ~ ssList(nil)
| ~ ssItem(hd(sk2)) ),
inference(superposition,[status(thm),theory(equality)],[c_13787,c_194]) ).
tff(c_13935,plain,
hd(sk2) = hd(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_13788,c_16,c_13885]) ).
tff(c_240,plain,
! [U_138,V_139] :
( ( app(cons(U_138,nil),V_139) = cons(U_138,V_139) )
| ~ ssList(V_139)
| ~ ssItem(U_138) ),
inference(cnfTransformation,[status(thm)],[f_666]) ).
tff(c_13867,plain,
! [V_139] :
( ( cons(hd(sk2),V_139) = app(sk1,V_139) )
| ~ ssList(V_139)
| ~ ssItem(hd(sk2)) ),
inference(superposition,[status(thm),theory(equality)],[c_13787,c_240]) ).
tff(c_13921,plain,
! [V_139] :
( ( cons(hd(sk2),V_139) = app(sk1,V_139) )
| ~ ssList(V_139) ),
inference(demodulation,[status(thm),theory(equality)],[c_13788,c_13867]) ).
tff(c_21024,plain,
! [V_1734] :
( ( cons(hd(sk1),V_1734) = app(sk1,V_1734) )
| ~ ssList(V_1734) ),
inference(demodulation,[status(thm),theory(equality)],[c_13935,c_13921]) ).
tff(c_24,plain,
! [U_1] : ssItem(skaf83(U_1)),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_8507,plain,
! [U_902] :
( ( nil = U_902 )
| ( cons(skaf83(U_902),skaf82(U_902)) = U_902 )
| ~ ssList(U_902) ),
inference(cnfTransformation,[status(thm)],[f_543]) ).
tff(c_8519,plain,
! [U_902] :
( ( skaf83(U_902) = hd(U_902) )
| ~ ssList(skaf82(U_902))
| ~ ssItem(skaf83(U_902))
| ( nil = U_902 )
| ~ ssList(U_902) ),
inference(superposition,[status(thm),theory(equality)],[c_8507,c_194]) ).
tff(c_17313,plain,
! [U_1365] :
( ( skaf83(U_1365) = hd(U_1365) )
| ( nil = U_1365 )
| ~ ssList(U_1365) ),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_26,c_8519]) ).
tff(c_17406,plain,
( ( skaf83(sk2) = hd(sk2) )
| ( sk2 = nil ) ),
inference(resolution,[status(thm)],[c_405,c_17313]) ).
tff(c_17444,plain,
( ( skaf83(sk2) = hd(sk1) )
| ( sk2 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_13935,c_17406]) ).
tff(c_17474,plain,
sk2 = nil,
inference(splitLeft,[status(thm)],[c_17444]) ).
tff(c_17479,plain,
~ frontsegP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_17474,c_13115]) ).
tff(c_17534,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_9942,c_17479]) ).
tff(c_17536,plain,
sk2 != nil,
inference(splitRight,[status(thm)],[c_17444]) ).
tff(c_17535,plain,
skaf83(sk2) = hd(sk1),
inference(splitRight,[status(thm)],[c_17444]) ).
tff(c_218,plain,
! [U_117] :
( ( nil = U_117 )
| ( cons(skaf83(U_117),skaf82(U_117)) = U_117 )
| ~ ssList(U_117) ),
inference(cnfTransformation,[status(thm)],[f_543]) ).
tff(c_17679,plain,
( ( sk2 = nil )
| ( cons(hd(sk1),skaf82(sk2)) = sk2 )
| ~ ssList(sk2) ),
inference(superposition,[status(thm),theory(equality)],[c_17535,c_218]) ).
tff(c_17691,plain,
( ( sk2 = nil )
| ( cons(hd(sk1),skaf82(sk2)) = sk2 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_405,c_17679]) ).
tff(c_17692,plain,
cons(hd(sk1),skaf82(sk2)) = sk2,
inference(negUnitSimplification,[status(thm)],[c_17536,c_17691]) ).
tff(c_21125,plain,
( ( app(sk1,skaf82(sk2)) = sk2 )
| ~ ssList(skaf82(sk2)) ),
inference(superposition,[status(thm),theory(equality)],[c_21024,c_17692]) ).
tff(c_21444,plain,
app(sk1,skaf82(sk2)) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_26,c_21125]) ).
tff(c_376,plain,
ssList(sk3),
inference(cnfTransformation,[status(thm)],[f_1647]) ).
tff(c_406,plain,
ssList(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_376]) ).
tff(c_591,plain,
app(nil,sk1) = sk1,
inference(resolution,[status(thm)],[c_406,c_472]) ).
tff(c_15728,plain,
! [U_1262,V_1263,W_1264] :
( segmentP(app(app(U_1262,V_1263),W_1264),V_1263)
| ~ ssList(app(app(U_1262,V_1263),W_1264))
| ~ ssList(V_1263)
| ~ ssList(U_1262)
| ~ ssList(W_1264) ),
inference(cnfTransformation,[status(thm)],[f_1371]) ).
tff(c_15934,plain,
! [W_1264] :
( segmentP(app(sk1,W_1264),sk1)
| ~ ssList(app(app(nil,sk1),W_1264))
| ~ ssList(sk1)
| ~ ssList(nil)
| ~ ssList(W_1264) ),
inference(superposition,[status(thm),theory(equality)],[c_591,c_15728]) ).
tff(c_289926,plain,
! [W_7652] :
( segmentP(app(sk1,W_7652),sk1)
| ~ ssList(app(sk1,W_7652))
| ~ ssList(W_7652) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_406,c_591,c_15934]) ).
tff(c_289954,plain,
( segmentP(sk2,sk1)
| ~ ssList(app(sk1,skaf82(sk2)))
| ~ ssList(skaf82(sk2)) ),
inference(superposition,[status(thm),theory(equality)],[c_21444,c_289926]) ).
tff(c_289981,plain,
segmentP(sk2,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_405,c_21444,c_289954]) ).
tff(c_289983,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_402,c_289981]) ).
tff(c_289984,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_10005]) ).
tff(c_742,plain,
! [U_408] :
( ( app(U_408,nil) = U_408 )
| ~ ssList(U_408) ),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_860,plain,
app(sk2,nil) = sk2,
inference(resolution,[status(thm)],[c_405,c_742]) ).
tff(c_10161,plain,
( rearsegP(sk2,nil)
| ~ ssList(app(sk2,nil))
| ~ ssList(nil)
| ~ ssList(sk2) ),
inference(superposition,[status(thm),theory(equality)],[c_860,c_10024]) ).
tff(c_10262,plain,
rearsegP(sk2,nil),
inference(demodulation,[status(thm),theory(equality)],[c_405,c_16,c_405,c_860,c_10161]) ).
tff(c_256,plain,
! [V_155,U_154] :
( ( V_155 = U_154 )
| ~ ssList(V_155)
| ~ ssList(U_154)
| ~ rearsegP(V_155,U_154)
| ~ rearsegP(U_154,V_155) ),
inference(cnfTransformation,[status(thm)],[f_770]) ).
tff(c_10272,plain,
( ( sk2 = nil )
| ~ ssList(sk2)
| ~ ssList(nil)
| ~ rearsegP(nil,sk2) ),
inference(resolution,[status(thm)],[c_10262,c_256]) ).
tff(c_10275,plain,
( ( sk2 = nil )
| ~ rearsegP(nil,sk2) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_405,c_10272]) ).
tff(c_13093,plain,
~ rearsegP(nil,sk2),
inference(splitLeft,[status(thm)],[c_10275]) ).
tff(c_289986,plain,
~ rearsegP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_289984,c_13093]) ).
tff(c_290038,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10266,c_289986]) ).
tff(c_290039,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_10275]) ).
tff(c_290108,plain,
neq(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_290039,c_384]) ).
tff(c_230,plain,
! [V_129] :
( ~ ssList(V_129)
| ~ neq(V_129,V_129) ),
inference(cnfTransformation,[status(thm)],[f_613]) ).
tff(c_290133,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_290108,c_230]) ).
tff(c_290138,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_290133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC354-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/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.34 % Computer : n004.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:26 EDT 2023
% 0.13/0.34 % CPUTime :
% 265.16/242.37 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 265.16/242.39
% 265.16/242.39 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 265.16/242.43
% 265.16/242.43 Inference rules
% 265.16/242.43 ----------------------
% 265.16/242.43 #Ref : 32
% 265.16/242.43 #Sup : 68881
% 265.16/242.43 #Fact : 0
% 265.16/242.43 #Define : 0
% 265.16/242.43 #Split : 39
% 265.16/242.43 #Chain : 0
% 265.16/242.43 #Close : 0
% 265.16/242.43
% 265.16/242.43 Ordering : KBO
% 265.16/242.43
% 265.16/242.43 Simplification rules
% 265.16/242.43 ----------------------
% 265.16/242.43 #Subsume : 14757
% 265.16/242.43 #Demod : 64235
% 265.16/242.43 #Tautology : 8367
% 265.16/242.43 #SimpNegUnit : 2007
% 265.16/242.43 #BackRed : 629
% 265.16/242.43
% 265.16/242.43 #Partial instantiations: 0
% 265.16/242.43 #Strategies tried : 1
% 265.16/242.43
% 265.16/242.43 Timing (in seconds)
% 265.16/242.43 ----------------------
% 265.16/242.44 Preprocessing : 0.95
% 265.16/242.44 Parsing : 0.51
% 265.16/242.44 CNF conversion : 0.07
% 265.16/242.44 Main loop : 240.35
% 265.16/242.44 Inferencing : 23.98
% 265.16/242.44 Reduction : 112.77
% 265.16/242.44 Demodulation : 82.63
% 265.16/242.44 BG Simplification : 0.54
% 265.16/242.44 Subsumption : 86.74
% 265.16/242.44 Abstraction : 1.37
% 265.16/242.44 MUC search : 0.00
% 265.16/242.44 Cooper : 0.00
% 265.16/242.44 Total : 241.38
% 265.16/242.44 Index Insertion : 0.00
% 265.16/242.44 Index Deletion : 0.00
% 265.16/242.44 Index Matching : 0.00
% 265.16/242.44 BG Taut test : 0.00
%------------------------------------------------------------------------------