TSTP Solution File: SWC118-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC118-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:01:14 EDT 2023
% Result : Unsatisfiable 18.98s 6.91s
% Output : CNFRefutation 19.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 95
% Syntax : Number of formulae : 173 ( 53 unt; 74 typ; 0 def)
% Number of atoms : 210 ( 58 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 235 ( 124 ~; 111 |; 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 : 45 (; 45 !; 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_1705,axiom,
( ( nil != sk2 )
| ( nil != sk1 ) ),
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_56,axiom,
ssList(nil),
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_1710,axiom,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
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_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_784,axiom,
! [U,V] :
( ~ frontsegP(U,V)
| ~ frontsegP(V,U)
| ~ ssList(U)
| ~ ssList(V)
| ( V = U ) ),
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_334,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| ssList(app(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_770,axiom,
! [U,V] :
( ~ rearsegP(U,V)
| ~ rearsegP(V,U)
| ~ ssList(U)
| ~ ssList(V)
| ( V = U ) ),
file(unknown,unknown) ).
tff(c_398,plain,
( ( sk1 != nil )
| ( sk2 != nil ) ),
inference(cnfTransformation,[status(thm)],[f_1705]) ).
tff(c_456,plain,
sk2 != nil,
inference(splitLeft,[status(thm)],[c_398]) ).
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_403,plain,
( ( sk1 != nil )
| ( sk4 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_396]) ).
tff(c_406,plain,
( ( sk1 != nil )
| ( sk2 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_403]) ).
tff(c_462,plain,
sk1 != nil,
inference(negUnitSimplification,[status(thm)],[c_456,c_406]) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_376,plain,
ssList(sk3),
inference(cnfTransformation,[status(thm)],[f_1647]) ).
tff(c_409,plain,
ssList(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_376]) ).
tff(c_1687,plain,
! [V_475,U_476] :
( ( V_475 = U_476 )
| neq(V_475,U_476)
| ~ ssList(V_475)
| ~ ssList(U_476) ),
inference(cnfTransformation,[status(thm)],[f_456]) ).
tff(c_400,plain,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(cnfTransformation,[status(thm)],[f_1710]) ).
tff(c_766,plain,
~ neq(sk1,nil),
inference(splitLeft,[status(thm)],[c_400]) ).
tff(c_1690,plain,
( ( sk1 = nil )
| ~ ssList(sk1)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_1687,c_766]) ).
tff(c_1701,plain,
sk1 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_409,c_1690]) ).
tff(c_1703,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_462,c_1701]) ).
tff(c_1704,plain,
~ segmentP(sk2,sk1),
inference(splitRight,[status(thm)],[c_400]) ).
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_408,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_404,plain,
app(app(sk5,sk1),sk6) = sk4,
inference(demodulation,[status(thm),theory(equality)],[c_382,c_388]) ).
tff(c_407,plain,
app(app(sk5,sk1),sk6) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_380,c_404]) ).
tff(c_10151,plain,
! [U_949,V_950,W_951] :
( segmentP(app(app(U_949,V_950),W_951),V_950)
| ~ ssList(app(app(U_949,V_950),W_951))
| ~ ssList(V_950)
| ~ ssList(U_949)
| ~ ssList(W_951) ),
inference(cnfTransformation,[status(thm)],[f_1371]) ).
tff(c_10333,plain,
( segmentP(sk2,sk1)
| ~ ssList(app(app(sk5,sk1),sk6))
| ~ ssList(sk1)
| ~ ssList(sk5)
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_407,c_10151]) ).
tff(c_10458,plain,
segmentP(sk2,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_384,c_409,c_408,c_407,c_10333]) ).
tff(c_10460,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1704,c_10458]) ).
tff(c_10461,plain,
sk1 != nil,
inference(splitRight,[status(thm)],[c_398]) ).
tff(c_12109,plain,
! [U_1110] :
( ( app(nil,U_1110) = U_1110 )
| ~ ssList(U_1110) ),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_12233,plain,
app(nil,sk1) = sk1,
inference(resolution,[status(thm)],[c_409,c_12109]) ).
tff(c_15405,plain,
! [U_1354,V_1355] :
( frontsegP(app(U_1354,V_1355),U_1354)
| ~ ssList(app(U_1354,V_1355))
| ~ ssList(U_1354)
| ~ ssList(V_1355) ),
inference(cnfTransformation,[status(thm)],[f_975]) ).
tff(c_15542,plain,
( frontsegP(sk1,nil)
| ~ ssList(app(nil,sk1))
| ~ ssList(nil)
| ~ ssList(sk1) ),
inference(superposition,[status(thm),theory(equality)],[c_12233,c_15405]) ).
tff(c_15649,plain,
frontsegP(sk1,nil),
inference(demodulation,[status(thm),theory(equality)],[c_409,c_16,c_409,c_12233,c_15542]) ).
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_15668,plain,
( ( sk1 = nil )
| ~ ssList(sk1)
| ~ ssList(nil)
| ~ frontsegP(nil,sk1) ),
inference(resolution,[status(thm)],[c_15649,c_258]) ).
tff(c_15671,plain,
( ( sk1 = nil )
| ~ frontsegP(nil,sk1) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_409,c_15668]) ).
tff(c_15672,plain,
~ frontsegP(nil,sk1),
inference(negUnitSimplification,[status(thm)],[c_10461,c_15671]) ).
tff(c_10500,plain,
! [U_978] :
( ( app(U_978,nil) = U_978 )
| ~ ssList(U_978) ),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_10621,plain,
app(nil,nil) = nil,
inference(resolution,[status(thm)],[c_16,c_10500]) ).
tff(c_15082,plain,
! [U_1350,V_1351] :
( rearsegP(app(U_1350,V_1351),V_1351)
| ~ ssList(app(U_1350,V_1351))
| ~ ssList(V_1351)
| ~ ssList(U_1350) ),
inference(cnfTransformation,[status(thm)],[f_961]) ).
tff(c_15231,plain,
( rearsegP(nil,nil)
| ~ ssList(app(nil,nil))
| ~ ssList(nil)
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_10621,c_15082]) ).
tff(c_15331,plain,
rearsegP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_16,c_16,c_10621,c_15231]) ).
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_12232,plain,
app(nil,sk5) = sk5,
inference(resolution,[status(thm)],[c_384,c_12109]) ).
tff(c_15545,plain,
( frontsegP(sk5,nil)
| ~ ssList(app(nil,sk5))
| ~ ssList(nil)
| ~ ssList(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_12232,c_15405]) ).
tff(c_15651,plain,
frontsegP(sk5,nil),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_16,c_384,c_12232,c_15545]) ).
tff(c_15674,plain,
( ( sk5 = nil )
| ~ ssList(sk5)
| ~ ssList(nil)
| ~ frontsegP(nil,sk5) ),
inference(resolution,[status(thm)],[c_15651,c_258]) ).
tff(c_15677,plain,
( ( sk5 = nil )
| ~ frontsegP(nil,sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_384,c_15674]) ).
tff(c_18954,plain,
~ frontsegP(nil,sk5),
inference(splitLeft,[status(thm)],[c_15677]) ).
tff(c_10462,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_398]) ).
tff(c_10495,plain,
app(app(sk5,sk1),sk6) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_10462,c_407]) ).
tff(c_18629,plain,
! [W_1501,V_1502,U_1503] :
( ( app(app(W_1501,V_1502),U_1503) = app(W_1501,app(V_1502,U_1503)) )
| ~ ssList(W_1501)
| ~ ssList(V_1502)
| ~ ssList(U_1503) ),
inference(cnfTransformation,[status(thm)],[f_1051]) ).
tff(c_18841,plain,
( ( app(sk5,app(sk1,sk6)) = nil )
| ~ ssList(sk5)
| ~ ssList(sk1)
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_10495,c_18629]) ).
tff(c_18953,plain,
app(sk5,app(sk1,sk6)) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_386,c_409,c_384,c_18841]) ).
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_20533,plain,
( frontsegP(nil,sk5)
| ~ ssList(app(sk5,app(sk1,sk6)))
| ~ ssList(sk5)
| ~ ssList(app(sk1,sk6)) ),
inference(superposition,[status(thm),theory(equality)],[c_18953,c_288]) ).
tff(c_20562,plain,
( frontsegP(nil,sk5)
| ~ ssList(app(sk1,sk6)) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_16,c_18953,c_20533]) ).
tff(c_20563,plain,
~ ssList(app(sk1,sk6)),
inference(negUnitSimplification,[status(thm)],[c_18954,c_20562]) ).
tff(c_20573,plain,
( ~ ssList(sk1)
| ~ ssList(sk6) ),
inference(resolution,[status(thm)],[c_170,c_20563]) ).
tff(c_20577,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_386,c_409,c_20573]) ).
tff(c_20578,plain,
sk5 = nil,
inference(splitRight,[status(thm)],[c_15677]) ).
tff(c_10622,plain,
app(sk5,nil) = sk5,
inference(resolution,[status(thm)],[c_384,c_10500]) ).
tff(c_15228,plain,
( rearsegP(sk5,nil)
| ~ ssList(app(sk5,nil))
| ~ ssList(nil)
| ~ ssList(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_10622,c_15082]) ).
tff(c_15329,plain,
rearsegP(sk5,nil),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_16,c_384,c_10622,c_15228]) ).
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_15388,plain,
( ( sk5 = nil )
| ~ ssList(sk5)
| ~ ssList(nil)
| ~ rearsegP(nil,sk5) ),
inference(resolution,[status(thm)],[c_15329,c_256]) ).
tff(c_15391,plain,
( ( sk5 = nil )
| ~ rearsegP(nil,sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_384,c_15388]) ).
tff(c_18627,plain,
~ rearsegP(nil,sk5),
inference(splitLeft,[status(thm)],[c_15391]) ).
tff(c_20580,plain,
~ rearsegP(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_20578,c_18627]) ).
tff(c_20612,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_15331,c_20580]) ).
tff(c_20613,plain,
sk5 = nil,
inference(splitRight,[status(thm)],[c_15391]) ).
tff(c_20642,plain,
app(app(nil,sk1),sk6) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_20613,c_10495]) ).
tff(c_20651,plain,
app(sk1,sk6) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_12233,c_20642]) ).
tff(c_20979,plain,
( frontsegP(nil,sk1)
| ~ ssList(app(sk1,sk6))
| ~ ssList(sk1)
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_20651,c_288]) ).
tff(c_21004,plain,
frontsegP(nil,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_409,c_16,c_20651,c_20979]) ).
tff(c_21006,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_15672,c_21004]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC118-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.14/0.34 % Computer : n004.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 21:40:11 EDT 2023
% 0.14/0.35 % CPUTime :
% 18.98/6.91 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.98/6.92
% 18.98/6.92 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 19.20/6.96
% 19.20/6.96 Inference rules
% 19.20/6.96 ----------------------
% 19.20/6.96 #Ref : 0
% 19.20/6.96 #Sup : 4532
% 19.20/6.96 #Fact : 0
% 19.20/6.96 #Define : 0
% 19.20/6.96 #Split : 28
% 19.20/6.96 #Chain : 0
% 19.20/6.96 #Close : 0
% 19.20/6.96
% 19.20/6.96 Ordering : KBO
% 19.20/6.96
% 19.20/6.96 Simplification rules
% 19.20/6.96 ----------------------
% 19.20/6.96 #Subsume : 298
% 19.20/6.96 #Demod : 4546
% 19.20/6.96 #Tautology : 1233
% 19.20/6.96 #SimpNegUnit : 22
% 19.20/6.96 #BackRed : 61
% 19.20/6.96
% 19.20/6.96 #Partial instantiations: 0
% 19.20/6.96 #Strategies tried : 1
% 19.20/6.96
% 19.20/6.96 Timing (in seconds)
% 19.20/6.96 ----------------------
% 19.20/6.96 Preprocessing : 0.87
% 19.24/6.96 Parsing : 0.45
% 19.24/6.96 CNF conversion : 0.07
% 19.24/6.96 Main loop : 5.02
% 19.24/6.96 Inferencing : 1.22
% 19.24/6.96 Reduction : 2.36
% 19.24/6.96 Demodulation : 1.79
% 19.24/6.96 BG Simplification : 0.10
% 19.24/6.96 Subsumption : 1.01
% 19.24/6.96 Abstraction : 0.09
% 19.24/6.96 MUC search : 0.00
% 19.24/6.96 Cooper : 0.00
% 19.24/6.96 Total : 5.95
% 19.24/6.96 Index Insertion : 0.00
% 19.24/6.96 Index Deletion : 0.00
% 19.24/6.96 Index Matching : 0.00
% 19.24/6.96 BG Taut test : 0.00
%------------------------------------------------------------------------------