TSTP Solution File: SWC112-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC112-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 : n010.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:13 EDT 2023
% Result : Unsatisfiable 19.48s 7.79s
% Output : CNFRefutation 19.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 98
% Syntax : Number of formulae : 182 ( 55 unt; 74 typ; 0 def)
% Number of atoms : 234 ( 64 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 260 ( 134 ~; 126 |; 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_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1700,axiom,
( ( nil = sk4 )
| ( nil != sk3 ) ),
file(unknown,unknown) ).
tff(f_1647,axiom,
ssList(sk3),
file(unknown,unknown) ).
tff(f_456,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ),
file(unknown,unknown) ).
tff(f_1651,axiom,
ssList(sk5),
file(unknown,unknown) ).
tff(f_1652,axiom,
ssList(sk6),
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_334,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| ssList(app(V,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_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_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_294,axiom,
! [U] :
( ~ segmentP(nil,U)
| ~ ssList(U)
| ( nil = U ) ),
file(unknown,unknown) ).
tff(f_1710,axiom,
( ( nil = sk2 )
| ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file(unknown,unknown) ).
tff(f_1648,axiom,
ssList(sk4),
file(unknown,unknown) ).
tff(f_1714,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_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_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_13139,plain,
! [V_1133,U_1134] :
( ( V_1133 = U_1134 )
| neq(V_1133,U_1134)
| ~ ssList(V_1133)
| ~ ssList(U_1134) ),
inference(cnfTransformation,[status(thm)],[f_456]) ).
tff(c_384,plain,
ssList(sk5),
inference(cnfTransformation,[status(thm)],[f_1651]) ).
tff(c_386,plain,
ssList(sk6),
inference(cnfTransformation,[status(thm)],[f_1652]) ).
tff(c_770,plain,
! [U_403] :
( ( app(U_403,nil) = U_403 )
| ~ ssList(U_403) ),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_895,plain,
app(sk6,nil) = sk6,
inference(resolution,[status(thm)],[c_386,c_770]) ).
tff(c_4053,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_4181,plain,
( rearsegP(sk6,nil)
| ~ ssList(app(sk6,nil))
| ~ ssList(nil)
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_895,c_4053]) ).
tff(c_4279,plain,
rearsegP(sk6,nil),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_16,c_386,c_895,c_4181]) ).
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_4404,plain,
( ( sk6 = nil )
| ~ ssList(sk6)
| ~ ssList(nil)
| ~ rearsegP(nil,sk6) ),
inference(resolution,[status(thm)],[c_4279,c_256]) ).
tff(c_4407,plain,
( ( sk6 = nil )
| ~ rearsegP(nil,sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_386,c_4404]) ).
tff(c_7101,plain,
~ rearsegP(nil,sk6),
inference(splitLeft,[status(thm)],[c_4407]) ).
tff(c_501,plain,
! [U_400] :
( ( app(nil,U_400) = U_400 )
| ~ ssList(U_400) ),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_623,plain,
app(nil,sk1) = sk1,
inference(resolution,[status(thm)],[c_413,c_501]) ).
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_3788,plain,
! [U_660,V_661] :
( frontsegP(app(U_660,V_661),U_660)
| ~ ssList(app(U_660,V_661))
| ~ ssList(U_660)
| ~ ssList(V_661) ),
inference(cnfTransformation,[status(thm)],[f_975]) ).
tff(c_3922,plain,
( frontsegP(sk5,nil)
| ~ ssList(app(nil,sk5))
| ~ ssList(nil)
| ~ ssList(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_624,c_3788]) ).
tff(c_4018,plain,
frontsegP(sk5,nil),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_16,c_384,c_624,c_3922]) ).
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_4049,plain,
( ( sk5 = nil )
| ~ ssList(sk5)
| ~ ssList(nil)
| ~ frontsegP(nil,sk5) ),
inference(resolution,[status(thm)],[c_4018,c_258]) ).
tff(c_4052,plain,
( ( sk5 = nil )
| ~ frontsegP(nil,sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_384,c_4049]) ).
tff(c_7205,plain,
~ frontsegP(nil,sk5),
inference(splitLeft,[status(thm)],[c_4052]) ).
tff(c_7388,plain,
! [W_826,V_827,U_828] :
( ( app(app(W_826,V_827),U_828) = app(W_826,app(V_827,U_828)) )
| ~ ssList(W_826)
| ~ ssList(V_827)
| ~ ssList(U_828) ),
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_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_492,plain,
app(app(sk5,sk1),sk6) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_478,c_410]) ).
tff(c_7428,plain,
( ( app(sk5,app(sk1,sk6)) = nil )
| ~ ssList(sk5)
| ~ ssList(sk1)
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_7388,c_492]) ).
tff(c_7599,plain,
app(sk5,app(sk1,sk6)) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_386,c_413,c_384,c_7428]) ).
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_8166,plain,
( frontsegP(nil,sk5)
| ~ ssList(app(sk5,app(sk1,sk6)))
| ~ ssList(sk5)
| ~ ssList(app(sk1,sk6)) ),
inference(superposition,[status(thm),theory(equality)],[c_7599,c_288]) ).
tff(c_8190,plain,
( frontsegP(nil,sk5)
| ~ ssList(app(sk1,sk6)) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_16,c_7599,c_8166]) ).
tff(c_8191,plain,
~ ssList(app(sk1,sk6)),
inference(negUnitSimplification,[status(thm)],[c_7205,c_8190]) ).
tff(c_8199,plain,
( ~ ssList(sk1)
| ~ ssList(sk6) ),
inference(resolution,[status(thm)],[c_170,c_8191]) ).
tff(c_8203,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_386,c_413,c_8199]) ).
tff(c_8204,plain,
sk5 = nil,
inference(splitRight,[status(thm)],[c_4052]) ).
tff(c_8251,plain,
app(app(nil,sk1),sk6) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_8204,c_492]) ).
tff(c_8260,plain,
app(sk1,sk6) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_623,c_8251]) ).
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_8306,plain,
( rearsegP(nil,sk6)
| ~ ssList(app(sk1,sk6))
| ~ ssList(sk6)
| ~ ssList(sk1) ),
inference(superposition,[status(thm),theory(equality)],[c_8260,c_286]) ).
tff(c_8329,plain,
rearsegP(nil,sk6),
inference(demodulation,[status(thm),theory(equality)],[c_413,c_386,c_16,c_8260,c_8306]) ).
tff(c_8331,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_7101,c_8329]) ).
tff(c_8332,plain,
sk6 = nil,
inference(splitRight,[status(thm)],[c_4407]) ).
tff(c_8379,plain,
app(app(sk5,sk1),nil) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_8332,c_492]) ).
tff(c_346,plain,
! [U_265,V_266,W_267] :
( segmentP(app(app(U_265,V_266),W_267),V_266)
| ~ ssList(app(app(U_265,V_266),W_267))
| ~ ssList(V_266)
| ~ ssList(U_265)
| ~ ssList(W_267) ),
inference(cnfTransformation,[status(thm)],[f_1371]) ).
tff(c_11403,plain,
( segmentP(nil,sk1)
| ~ ssList(app(app(sk5,sk1),nil))
| ~ ssList(sk1)
| ~ ssList(sk5)
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_8379,c_346]) ).
tff(c_11454,plain,
segmentP(nil,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_384,c_413,c_16,c_8379,c_11403]) ).
tff(c_160,plain,
! [U_75] :
( ( nil = U_75 )
| ~ ssList(U_75)
| ~ segmentP(nil,U_75) ),
inference(cnfTransformation,[status(thm)],[f_294]) ).
tff(c_11611,plain,
( ( sk1 = nil )
| ~ ssList(sk1) ),
inference(resolution,[status(thm)],[c_11454,c_160]) ).
tff(c_11621,plain,
sk1 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_413,c_11611]) ).
tff(c_11623,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_461,c_11621]) ).
tff(c_11625,plain,
sk2 != nil,
inference(splitRight,[status(thm)],[c_398]) ).
tff(c_400,plain,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| ( sk2 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1710]) ).
tff(c_12788,plain,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(negUnitSimplification,[status(thm)],[c_11625,c_400]) ).
tff(c_12789,plain,
~ neq(sk1,nil),
inference(splitLeft,[status(thm)],[c_12788]) ).
tff(c_13142,plain,
( ( sk1 = nil )
| ~ ssList(sk1)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_13139,c_12789]) ).
tff(c_13153,plain,
sk1 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_413,c_13142]) ).
tff(c_13155,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_461,c_13153]) ).
tff(c_13156,plain,
~ segmentP(sk2,sk1),
inference(splitRight,[status(thm)],[c_12788]) ).
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_21458,plain,
! [U_1570,V_1571,W_1572] :
( segmentP(app(app(U_1570,V_1571),W_1572),V_1571)
| ~ ssList(app(app(U_1570,V_1571),W_1572))
| ~ ssList(V_1571)
| ~ ssList(U_1570)
| ~ ssList(W_1572) ),
inference(cnfTransformation,[status(thm)],[f_1371]) ).
tff(c_21688,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_21458]) ).
tff(c_21822,plain,
segmentP(sk2,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_384,c_413,c_412,c_410,c_21688]) ).
tff(c_21824,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_13156,c_21822]) ).
tff(c_21826,plain,
sk1 = nil,
inference(splitRight,[status(thm)],[c_411]) ).
tff(c_21825,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_411]) ).
tff(c_402,plain,
( neq(sk2,nil)
| ( sk1 != nil ) ),
inference(cnfTransformation,[status(thm)],[f_1714]) ).
tff(c_21861,plain,
neq(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_21826,c_21825,c_402]) ).
tff(c_21869,plain,
! [V_1593] :
( ~ ssList(V_1593)
| ~ neq(V_1593,V_1593) ),
inference(cnfTransformation,[status(thm)],[f_613]) ).
tff(c_21872,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_21861,c_21869]) ).
tff(c_21876,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_21872]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC112-1 : TPTP v8.1.2. Released v2.4.0.
% 0.15/0.14 % 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.15/0.35 % Computer : n010.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 21:33:58 EDT 2023
% 0.15/0.36 % CPUTime :
% 19.48/7.79 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 19.48/7.81
% 19.48/7.81 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 19.67/7.85
% 19.67/7.85 Inference rules
% 19.67/7.85 ----------------------
% 19.67/7.85 #Ref : 0
% 19.67/7.85 #Sup : 4693
% 19.67/7.85 #Fact : 0
% 19.67/7.85 #Define : 0
% 19.67/7.85 #Split : 32
% 19.67/7.85 #Chain : 0
% 19.67/7.85 #Close : 0
% 19.67/7.85
% 19.67/7.85 Ordering : KBO
% 19.67/7.85
% 19.67/7.85 Simplification rules
% 19.67/7.85 ----------------------
% 19.67/7.85 #Subsume : 409
% 19.67/7.85 #Demod : 5082
% 19.67/7.85 #Tautology : 1240
% 19.67/7.85 #SimpNegUnit : 23
% 19.67/7.85 #BackRed : 101
% 19.67/7.85
% 19.67/7.85 #Partial instantiations: 0
% 19.67/7.85 #Strategies tried : 1
% 19.67/7.85
% 19.67/7.85 Timing (in seconds)
% 19.67/7.85 ----------------------
% 19.67/7.85 Preprocessing : 0.92
% 19.67/7.85 Parsing : 0.48
% 19.67/7.85 CNF conversion : 0.07
% 19.67/7.85 Main loop : 5.75
% 19.67/7.85 Inferencing : 1.32
% 19.67/7.85 Reduction : 2.85
% 19.67/7.85 Demodulation : 2.20
% 19.67/7.85 BG Simplification : 0.11
% 19.67/7.85 Subsumption : 1.10
% 19.67/7.85 Abstraction : 0.10
% 19.67/7.85 MUC search : 0.00
% 19.67/7.85 Cooper : 0.00
% 19.67/7.85 Total : 6.74
% 19.67/7.85 Index Insertion : 0.00
% 19.67/7.85 Index Deletion : 0.00
% 19.67/7.85 Index Matching : 0.00
% 19.67/7.85 BG Taut test : 0.00
%------------------------------------------------------------------------------