TSTP Solution File: SWC067-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC067-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 : n013.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:01:01 EDT 2023
% Result : Unsatisfiable 19.56s 7.80s
% Output : CNFRefutation 19.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 98
% Syntax : Number of formulae : 213 ( 74 unt; 74 typ; 0 def)
% Number of atoms : 296 ( 74 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 330 ( 173 ~; 157 |; 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 : 55 (; 55 !; 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_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1647,axiom,
ssList(sk3),
file(unknown,unknown) ).
tff(f_161,axiom,
! [U] :
( ~ ssList(U)
| segmentP(U,U) ),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1700,axiom,
( ( nil = sk4 )
| ( nil != sk3 ) ),
file(unknown,unknown) ).
tff(f_456,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ),
file(unknown,unknown) ).
tff(f_1652,axiom,
ssList(sk6),
file(unknown,unknown) ).
tff(f_1651,axiom,
ssList(sk5),
file(unknown,unknown) ).
tff(f_1648,axiom,
ssList(sk4),
file(unknown,unknown) ).
tff(f_1653,axiom,
app(app(sk5,sk3),sk6) = sk4,
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_961,axiom,
! [U,V,W] :
( ( app(U,V) != W )
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| rearsegP(W,V) ),
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_250,axiom,
! [U] :
( ~ ssList(U)
| ( app(nil,U) = U ) ),
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_334,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| ssList(app(V,U)) ),
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_1051,axiom,
! [U,V,W] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ),
file(unknown,unknown) ).
tff(f_1703,axiom,
( ( nil = sk2 )
| neq(sk2,nil) ),
file(unknown,unknown) ).
tff(f_1717,axiom,
! [A] :
( ( nil = sk2 )
| ~ ssList(A)
| ~ neq(A,nil)
| ~ segmentP(sk2,A)
| ~ segmentP(sk1,A) ),
file(unknown,unknown) ).
tff(f_1721,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_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_376,plain,
ssList(sk3),
inference(cnfTransformation,[status(thm)],[f_1647]) ).
tff(c_413,plain,
ssList(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_376]) ).
tff(c_114,plain,
! [U_51] :
( segmentP(U_51,U_51)
| ~ ssList(U_51) ),
inference(cnfTransformation,[status(thm)],[f_161]) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_396,plain,
( ( sk3 != nil )
| ( sk4 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1700]) ).
tff(c_409,plain,
( ( sk1 != nil )
| ( sk4 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_396]) ).
tff(c_411,plain,
( ( sk1 != nil )
| ( sk2 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_409]) ).
tff(c_461,plain,
sk1 != nil,
inference(splitLeft,[status(thm)],[c_411]) ).
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_386,plain,
ssList(sk6),
inference(cnfTransformation,[status(thm)],[f_1652]) ).
tff(c_384,plain,
ssList(sk5),
inference(cnfTransformation,[status(thm)],[f_1651]) ).
tff(c_378,plain,
ssList(sk4),
inference(cnfTransformation,[status(thm)],[f_1648]) ).
tff(c_412,plain,
ssList(sk2),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_378]) ).
tff(c_388,plain,
app(app(sk5,sk3),sk6) = sk4,
inference(cnfTransformation,[status(thm)],[f_1653]) ).
tff(c_408,plain,
app(app(sk5,sk1),sk6) = sk4,
inference(demodulation,[status(thm),theory(equality)],[c_382,c_388]) ).
tff(c_410,plain,
app(app(sk5,sk1),sk6) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_380,c_408]) ).
tff(c_19418,plain,
! [U_1420,V_1421,W_1422] :
( segmentP(app(app(U_1420,V_1421),W_1422),V_1421)
| ~ ssList(app(app(U_1420,V_1421),W_1422))
| ~ ssList(V_1421)
| ~ ssList(U_1420)
| ~ ssList(W_1422) ),
inference(cnfTransformation,[status(thm)],[f_1371]) ).
tff(c_19624,plain,
( segmentP(sk2,sk1)
| ~ ssList(app(app(sk5,sk1),sk6))
| ~ ssList(sk1)
| ~ ssList(sk5)
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_410,c_19418]) ).
tff(c_19748,plain,
segmentP(sk2,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_384,c_413,c_412,c_410,c_19624]) ).
tff(c_770,plain,
! [U_405] :
( ( app(U_405,nil) = U_405 )
| ~ ssList(U_405) ),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_893,plain,
app(sk1,nil) = sk1,
inference(resolution,[status(thm)],[c_413,c_770]) ).
tff(c_4123,plain,
! [U_662,V_663] :
( rearsegP(app(U_662,V_663),V_663)
| ~ ssList(app(U_662,V_663))
| ~ ssList(V_663)
| ~ ssList(U_662) ),
inference(cnfTransformation,[status(thm)],[f_961]) ).
tff(c_4257,plain,
( rearsegP(sk1,nil)
| ~ ssList(app(sk1,nil))
| ~ ssList(nil)
| ~ ssList(sk1) ),
inference(superposition,[status(thm),theory(equality)],[c_893,c_4123]) ).
tff(c_4365,plain,
rearsegP(sk1,nil),
inference(demodulation,[status(thm),theory(equality)],[c_413,c_16,c_413,c_893,c_4257]) ).
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_4381,plain,
( ( sk1 = nil )
| ~ ssList(sk1)
| ~ ssList(nil)
| ~ rearsegP(nil,sk1) ),
inference(resolution,[status(thm)],[c_4365,c_256]) ).
tff(c_4384,plain,
( ( sk1 = nil )
| ~ rearsegP(nil,sk1) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_413,c_4381]) ).
tff(c_4385,plain,
~ rearsegP(nil,sk1),
inference(negUnitSimplification,[status(thm)],[c_461,c_4384]) ).
tff(c_501,plain,
! [U_402] :
( ( app(nil,U_402) = U_402 )
| ~ ssList(U_402) ),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_622,plain,
app(nil,nil) = nil,
inference(resolution,[status(thm)],[c_16,c_501]) ).
tff(c_3757,plain,
! [U_653,V_654] :
( frontsegP(app(U_653,V_654),U_653)
| ~ ssList(app(U_653,V_654))
| ~ ssList(U_653)
| ~ ssList(V_654) ),
inference(cnfTransformation,[status(thm)],[f_975]) ).
tff(c_3906,plain,
( frontsegP(nil,nil)
| ~ ssList(app(nil,nil))
| ~ ssList(nil)
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_622,c_3757]) ).
tff(c_4006,plain,
frontsegP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_16,c_16,c_622,c_3906]) ).
tff(c_895,plain,
app(sk6,nil) = sk6,
inference(resolution,[status(thm)],[c_386,c_770]) ).
tff(c_4263,plain,
( rearsegP(sk6,nil)
| ~ ssList(app(sk6,nil))
| ~ ssList(nil)
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_895,c_4123]) ).
tff(c_4369,plain,
rearsegP(sk6,nil),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_16,c_386,c_895,c_4263]) ).
tff(c_4392,plain,
( ( sk6 = nil )
| ~ ssList(sk6)
| ~ ssList(nil)
| ~ rearsegP(nil,sk6) ),
inference(resolution,[status(thm)],[c_4369,c_256]) ).
tff(c_4395,plain,
( ( sk6 = nil )
| ~ rearsegP(nil,sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_386,c_4392]) ).
tff(c_7276,plain,
~ rearsegP(nil,sk6),
inference(splitLeft,[status(thm)],[c_4395]) ).
tff(c_623,plain,
app(nil,sk1) = sk1,
inference(resolution,[status(thm)],[c_413,c_501]) ).
tff(c_4275,plain,
( rearsegP(nil,nil)
| ~ ssList(app(nil,nil))
| ~ ssList(nil)
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_622,c_4123]) ).
tff(c_4377,plain,
rearsegP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_16,c_16,c_622,c_4275]) ).
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_624,plain,
app(nil,sk5) = sk5,
inference(resolution,[status(thm)],[c_384,c_501]) ).
tff(c_3900,plain,
( frontsegP(sk5,nil)
| ~ ssList(app(nil,sk5))
| ~ ssList(nil)
| ~ ssList(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_624,c_3757]) ).
tff(c_4002,plain,
frontsegP(sk5,nil),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_16,c_384,c_624,c_3900]) ).
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_4033,plain,
( ( sk5 = nil )
| ~ ssList(sk5)
| ~ ssList(nil)
| ~ frontsegP(nil,sk5) ),
inference(resolution,[status(thm)],[c_4002,c_258]) ).
tff(c_4036,plain,
( ( sk5 = nil )
| ~ frontsegP(nil,sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_384,c_4033]) ).
tff(c_7299,plain,
~ frontsegP(nil,sk5),
inference(splitLeft,[status(thm)],[c_4036]) ).
tff(c_6744,plain,
! [W_789,V_790,U_791] :
( ( app(app(W_789,V_790),U_791) = app(W_789,app(V_790,U_791)) )
| ~ ssList(W_789)
| ~ ssList(V_790)
| ~ ssList(U_791) ),
inference(cnfTransformation,[status(thm)],[f_1051]) ).
tff(c_398,plain,
( neq(sk2,nil)
| ( sk2 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1703]) ).
tff(c_478,plain,
sk2 = nil,
inference(splitLeft,[status(thm)],[c_398]) ).
tff(c_492,plain,
app(app(sk5,sk1),sk6) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_478,c_410]) ).
tff(c_6781,plain,
( ( app(sk5,app(sk1,sk6)) = nil )
| ~ ssList(sk5)
| ~ ssList(sk1)
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_6744,c_492]) ).
tff(c_6958,plain,
app(sk5,app(sk1,sk6)) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_386,c_413,c_384,c_6781]) ).
tff(c_288,plain,
! [U_192,V_193] :
( frontsegP(app(U_192,V_193),U_192)
| ~ ssList(app(U_192,V_193))
| ~ ssList(U_192)
| ~ ssList(V_193) ),
inference(cnfTransformation,[status(thm)],[f_975]) ).
tff(c_8177,plain,
( frontsegP(nil,sk5)
| ~ ssList(app(sk5,app(sk1,sk6)))
| ~ ssList(sk5)
| ~ ssList(app(sk1,sk6)) ),
inference(superposition,[status(thm),theory(equality)],[c_6958,c_288]) ).
tff(c_8201,plain,
( frontsegP(nil,sk5)
| ~ ssList(app(sk1,sk6)) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_16,c_6958,c_8177]) ).
tff(c_8202,plain,
~ ssList(app(sk1,sk6)),
inference(negUnitSimplification,[status(thm)],[c_7299,c_8201]) ).
tff(c_8210,plain,
( ~ ssList(sk1)
| ~ ssList(sk6) ),
inference(resolution,[status(thm)],[c_170,c_8202]) ).
tff(c_8214,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_386,c_413,c_8210]) ).
tff(c_8215,plain,
sk5 = nil,
inference(splitRight,[status(thm)],[c_4036]) ).
tff(c_894,plain,
app(sk5,nil) = sk5,
inference(resolution,[status(thm)],[c_384,c_770]) ).
tff(c_4260,plain,
( rearsegP(sk5,nil)
| ~ ssList(app(sk5,nil))
| ~ ssList(nil)
| ~ ssList(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_894,c_4123]) ).
tff(c_4367,plain,
rearsegP(sk5,nil),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_16,c_384,c_894,c_4260]) ).
tff(c_4387,plain,
( ( sk5 = nil )
| ~ ssList(sk5)
| ~ ssList(nil)
| ~ rearsegP(nil,sk5) ),
inference(resolution,[status(thm)],[c_4367,c_256]) ).
tff(c_4390,plain,
( ( sk5 = nil )
| ~ rearsegP(nil,sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_384,c_4387]) ).
tff(c_7277,plain,
~ rearsegP(nil,sk5),
inference(splitLeft,[status(thm)],[c_4390]) ).
tff(c_8217,plain,
~ rearsegP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_8215,c_7277]) ).
tff(c_8267,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4377,c_8217]) ).
tff(c_8268,plain,
sk5 = nil,
inference(splitRight,[status(thm)],[c_4390]) ).
tff(c_8336,plain,
app(app(nil,sk1),sk6) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_8268,c_492]) ).
tff(c_8345,plain,
app(sk1,sk6) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_623,c_8336]) ).
tff(c_286,plain,
! [U_189,V_190] :
( rearsegP(app(U_189,V_190),V_190)
| ~ ssList(app(U_189,V_190))
| ~ ssList(V_190)
| ~ ssList(U_189) ),
inference(cnfTransformation,[status(thm)],[f_961]) ).
tff(c_8370,plain,
( rearsegP(nil,sk6)
| ~ ssList(app(sk1,sk6))
| ~ ssList(sk6)
| ~ ssList(sk1) ),
inference(superposition,[status(thm),theory(equality)],[c_8345,c_286]) ).
tff(c_8393,plain,
rearsegP(nil,sk6),
inference(demodulation,[status(thm),theory(equality)],[c_413,c_386,c_16,c_8345,c_8370]) ).
tff(c_8395,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_7276,c_8393]) ).
tff(c_8396,plain,
sk6 = nil,
inference(splitRight,[status(thm)],[c_4395]) ).
tff(c_625,plain,
app(nil,sk6) = sk6,
inference(resolution,[status(thm)],[c_386,c_501]) ).
tff(c_3897,plain,
( frontsegP(sk6,nil)
| ~ ssList(app(nil,sk6))
| ~ ssList(nil)
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_625,c_3757]) ).
tff(c_4000,plain,
frontsegP(sk6,nil),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_16,c_386,c_625,c_3897]) ).
tff(c_4028,plain,
( ( sk6 = nil )
| ~ ssList(sk6)
| ~ ssList(nil)
| ~ frontsegP(nil,sk6) ),
inference(resolution,[status(thm)],[c_4000,c_258]) ).
tff(c_4031,plain,
( ( sk6 = nil )
| ~ frontsegP(nil,sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_386,c_4028]) ).
tff(c_7275,plain,
~ frontsegP(nil,sk6),
inference(splitLeft,[status(thm)],[c_4031]) ).
tff(c_8398,plain,
~ frontsegP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_8396,c_7275]) ).
tff(c_8448,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4006,c_8398]) ).
tff(c_8449,plain,
sk6 = nil,
inference(splitRight,[status(thm)],[c_4031]) ).
tff(c_6953,plain,
( ( app(sk5,app(sk1,sk6)) = nil )
| ~ ssList(sk5)
| ~ ssList(sk1)
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_492,c_6744]) ).
tff(c_7065,plain,
app(sk5,app(sk1,sk6)) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_386,c_413,c_384,c_6953]) ).
tff(c_10415,plain,
app(sk5,sk1) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_893,c_8449,c_7065]) ).
tff(c_10443,plain,
( rearsegP(nil,sk1)
| ~ ssList(app(sk5,sk1))
| ~ ssList(sk1)
| ~ ssList(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_10415,c_286]) ).
tff(c_10472,plain,
rearsegP(nil,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_413,c_16,c_10415,c_10443]) ).
tff(c_10474,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4385,c_10472]) ).
tff(c_10476,plain,
sk2 != nil,
inference(splitRight,[status(thm)],[c_398]) ).
tff(c_400,plain,
! [A_335] :
( ~ segmentP(sk1,A_335)
| ~ segmentP(sk2,A_335)
| ~ neq(A_335,nil)
| ~ ssList(A_335)
| ( sk2 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1717]) ).
tff(c_13415,plain,
! [A_335] :
( ~ segmentP(sk1,A_335)
| ~ segmentP(sk2,A_335)
| ~ neq(A_335,nil)
| ~ ssList(A_335) ),
inference(negUnitSimplification,[status(thm)],[c_10476,c_400]) ).
tff(c_19753,plain,
( ~ segmentP(sk1,sk1)
| ~ neq(sk1,nil)
| ~ ssList(sk1) ),
inference(resolution,[status(thm)],[c_19748,c_13415]) ).
tff(c_19761,plain,
( ~ segmentP(sk1,sk1)
| ~ neq(sk1,nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_413,c_19753]) ).
tff(c_21341,plain,
~ neq(sk1,nil),
inference(splitLeft,[status(thm)],[c_19761]) ).
tff(c_21344,plain,
( ( sk1 = nil )
| ~ ssList(sk1)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_200,c_21341]) ).
tff(c_21350,plain,
sk1 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_413,c_21344]) ).
tff(c_21352,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_461,c_21350]) ).
tff(c_21353,plain,
~ segmentP(sk1,sk1),
inference(splitRight,[status(thm)],[c_19761]) ).
tff(c_21357,plain,
~ ssList(sk1),
inference(resolution,[status(thm)],[c_114,c_21353]) ).
tff(c_21361,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_413,c_21357]) ).
tff(c_21363,plain,
sk1 = nil,
inference(splitRight,[status(thm)],[c_411]) ).
tff(c_21362,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_411]) ).
tff(c_402,plain,
( neq(sk2,nil)
| ( sk1 != nil ) ),
inference(cnfTransformation,[status(thm)],[f_1721]) ).
tff(c_21402,plain,
neq(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_21363,c_21362,c_402]) ).
tff(c_21405,plain,
! [V_1607] :
( ~ ssList(V_1607)
| ~ neq(V_1607,V_1607) ),
inference(cnfTransformation,[status(thm)],[f_613]) ).
tff(c_21408,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_21402,c_21405]) ).
tff(c_21412,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_21408]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC067-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 : n013.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 21:16:33 EDT 2023
% 0.14/0.36 % CPUTime :
% 19.56/7.80 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 19.56/7.82
% 19.56/7.82 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 19.85/7.86
% 19.85/7.86 Inference rules
% 19.85/7.86 ----------------------
% 19.85/7.86 #Ref : 0
% 19.85/7.86 #Sup : 4562
% 19.85/7.86 #Fact : 0
% 19.85/7.86 #Define : 0
% 19.85/7.86 #Split : 30
% 19.85/7.86 #Chain : 0
% 19.85/7.86 #Close : 0
% 19.85/7.86
% 19.85/7.86 Ordering : KBO
% 19.85/7.86
% 19.85/7.86 Simplification rules
% 19.85/7.86 ----------------------
% 19.85/7.86 #Subsume : 374
% 19.85/7.86 #Demod : 5100
% 19.85/7.86 #Tautology : 1185
% 19.85/7.86 #SimpNegUnit : 20
% 19.85/7.86 #BackRed : 197
% 19.85/7.86
% 19.85/7.86 #Partial instantiations: 0
% 19.85/7.86 #Strategies tried : 1
% 19.85/7.86
% 19.85/7.86 Timing (in seconds)
% 19.85/7.86 ----------------------
% 19.85/7.87 Preprocessing : 0.90
% 19.85/7.87 Parsing : 0.46
% 19.85/7.87 CNF conversion : 0.07
% 19.85/7.87 Main loop : 5.83
% 19.85/7.87 Inferencing : 1.32
% 19.85/7.87 Reduction : 2.87
% 19.85/7.87 Demodulation : 2.20
% 19.85/7.87 BG Simplification : 0.11
% 19.85/7.87 Subsumption : 1.16
% 19.85/7.87 Abstraction : 0.10
% 19.85/7.87 MUC search : 0.00
% 19.85/7.87 Cooper : 0.00
% 19.85/7.87 Total : 6.81
% 19.85/7.87 Index Insertion : 0.00
% 19.85/7.87 Index Deletion : 0.00
% 19.85/7.87 Index Matching : 0.00
% 19.85/7.87 BG Taut test : 0.00
%------------------------------------------------------------------------------