TSTP Solution File: SWC397-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC397-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 : n025.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:29 EDT 2023
% Result : Unsatisfiable 51.29s 35.61s
% Output : CNFRefutation 51.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 97
% Syntax : Number of formulae : 187 ( 47 unt; 75 typ; 0 def)
% Number of atoms : 252 ( 49 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 287 ( 147 ~; 140 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 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 : 56 ( 56 usr; 10 con; 0-2 aty)
% Number of variables : 82 (; 82 !; 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 > sk7 > 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(sk7,type,
sk7: $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_1654,axiom,
~ memberP(sk2,sk5),
file(unknown,unknown) ).
tff(f_1652,axiom,
memberP(sk1,sk5),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1658,axiom,
( ( nil = sk3 )
| ( nil != sk4 ) ),
file(unknown,unknown) ).
tff(f_56,axiom,
ssList(nil),
file(unknown,unknown) ).
tff(f_1648,axiom,
ssList(sk4),
file(unknown,unknown) ).
tff(f_456,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ),
file(unknown,unknown) ).
tff(f_1666,axiom,
( ssList(sk7)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1647,axiom,
ssList(sk3),
file(unknown,unknown) ).
tff(f_334,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| ssList(app(V,U)) ),
file(unknown,unknown) ).
tff(f_240,axiom,
! [U,V] :
( ~ ssList(U)
| duplicatefreeP(U)
| ssItem(V) ),
file(unknown,unknown) ).
tff(f_1662,axiom,
( ssItem(sk6)
| ~ neq(sk4,nil) ),
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_1670,axiom,
( ( app(cons(sk6,nil),sk7) = sk3 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1674,axiom,
( ( app(sk7,cons(sk6,nil)) = sk4 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1481,axiom,
! [W,U,X,Y,V] :
( ( app(app(U,cons(V,W)),cons(V,X)) != Y )
| ~ ssList(X)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(V)
| ~ duplicatefreeP(Y)
| ~ ssList(Y) ),
file(unknown,unknown) ).
tff(f_1239,axiom,
! [U,V,W] :
( ~ memberP(cons(U,V),W)
| ~ ssList(V)
| ~ ssItem(U)
| ~ ssItem(W)
| memberP(V,W)
| ( W = U ) ),
file(unknown,unknown) ).
tff(f_342,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
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_926,axiom,
! [U,V,W] :
( ~ memberP(U,V)
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(V)
| memberP(app(U,W),V) ),
file(unknown,unknown) ).
tff(f_1405,axiom,
! [U,V,W,X] :
( ( app(U,cons(V,W)) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssItem(V)
| ~ ssList(X)
| memberP(X,V) ),
file(unknown,unknown) ).
tff(c_388,plain,
~ memberP(sk2,sk5),
inference(cnfTransformation,[status(thm)],[f_1654]) ).
tff(c_386,plain,
memberP(sk1,sk5),
inference(cnfTransformation,[status(thm)],[f_1652]) ).
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_390,plain,
( ( sk4 != nil )
| ( sk3 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1658]) ).
tff(c_399,plain,
( ( sk4 != nil )
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_390]) ).
tff(c_401,plain,
( ( sk2 != nil )
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_399]) ).
tff(c_460,plain,
sk2 != nil,
inference(splitLeft,[status(thm)],[c_401]) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_378,plain,
ssList(sk4),
inference(cnfTransformation,[status(thm)],[f_1648]) ).
tff(c_406,plain,
ssList(sk2),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_378]) ).
tff(c_2244,plain,
! [V_512,U_513] :
( ( V_512 = U_513 )
| neq(V_512,U_513)
| ~ ssList(V_512)
| ~ ssList(U_513) ),
inference(cnfTransformation,[status(thm)],[f_456]) ).
tff(c_394,plain,
( ~ neq(sk4,nil)
| ssList(sk7) ),
inference(cnfTransformation,[status(thm)],[f_1666]) ).
tff(c_404,plain,
( ~ neq(sk2,nil)
| ssList(sk7) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_394]) ).
tff(c_470,plain,
~ neq(sk2,nil),
inference(splitLeft,[status(thm)],[c_404]) ).
tff(c_2251,plain,
( ( sk2 = nil )
| ~ ssList(sk2)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_2244,c_470]) ).
tff(c_2260,plain,
sk2 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_406,c_2251]) ).
tff(c_2262,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_460,c_2260]) ).
tff(c_2263,plain,
ssList(sk7),
inference(splitRight,[status(thm)],[c_404]) ).
tff(c_376,plain,
ssList(sk3),
inference(cnfTransformation,[status(thm)],[f_1647]) ).
tff(c_407,plain,
ssList(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_376]) ).
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_2871,plain,
! [V_565,U_566] :
( ssList(app(V_565,U_566))
| ~ ssList(V_565)
| ~ ssList(U_566) ),
inference(cnfTransformation,[status(thm)],[f_334]) ).
tff(c_144,plain,
! [V_67,U_66] :
( ssItem(V_67)
| duplicatefreeP(U_66)
| ~ ssList(U_66) ),
inference(cnfTransformation,[status(thm)],[f_240]) ).
tff(c_2417,plain,
! [U_66] :
( duplicatefreeP(U_66)
| ~ ssList(U_66) ),
inference(splitLeft,[status(thm)],[c_144]) ).
tff(c_2906,plain,
! [V_565,U_566] :
( duplicatefreeP(app(V_565,U_566))
| ~ ssList(V_565)
| ~ ssList(U_566) ),
inference(resolution,[status(thm)],[c_2871,c_2417]) ).
tff(c_2264,plain,
neq(sk2,nil),
inference(splitRight,[status(thm)],[c_404]) ).
tff(c_392,plain,
( ~ neq(sk4,nil)
| ssItem(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1662]) ).
tff(c_402,plain,
( ~ neq(sk2,nil)
| ssItem(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_392]) ).
tff(c_2269,plain,
ssItem(sk6),
inference(demodulation,[status(thm),theory(equality)],[c_2264,c_402]) ).
tff(c_5314,plain,
! [U_748,V_749] :
( ( app(cons(U_748,nil),V_749) = cons(U_748,V_749) )
| ~ ssList(V_749)
| ~ ssItem(U_748) ),
inference(cnfTransformation,[status(thm)],[f_666]) ).
tff(c_396,plain,
( ~ neq(sk4,nil)
| ( app(cons(sk6,nil),sk7) = sk3 ) ),
inference(cnfTransformation,[status(thm)],[f_1670]) ).
tff(c_400,plain,
( ~ neq(sk4,nil)
| ( app(cons(sk6,nil),sk7) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_396]) ).
tff(c_405,plain,
( ~ neq(sk2,nil)
| ( app(cons(sk6,nil),sk7) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_400]) ).
tff(c_3857,plain,
app(cons(sk6,nil),sk7) = sk1,
inference(demodulation,[status(thm),theory(equality)],[c_2264,c_405]) ).
tff(c_5323,plain,
( ( cons(sk6,sk7) = sk1 )
| ~ ssList(sk7)
| ~ ssItem(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_5314,c_3857]) ).
tff(c_5338,plain,
cons(sk6,sk7) = sk1,
inference(demodulation,[status(thm),theory(equality)],[c_2269,c_2263,c_5323]) ).
tff(c_398,plain,
( ~ neq(sk4,nil)
| ( app(sk7,cons(sk6,nil)) = sk4 ) ),
inference(cnfTransformation,[status(thm)],[f_1674]) ).
tff(c_403,plain,
( ~ neq(sk2,nil)
| ( app(sk7,cons(sk6,nil)) = sk2 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_398]) ).
tff(c_3394,plain,
app(sk7,cons(sk6,nil)) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_2264,c_403]) ).
tff(c_11955,plain,
! [U_1038,V_1039,W_1040,X_1041] :
( ~ ssList(app(app(U_1038,cons(V_1039,W_1040)),cons(V_1039,X_1041)))
| ~ duplicatefreeP(app(app(U_1038,cons(V_1039,W_1040)),cons(V_1039,X_1041)))
| ~ ssItem(V_1039)
| ~ ssList(U_1038)
| ~ ssList(W_1040)
| ~ ssList(X_1041) ),
inference(cnfTransformation,[status(thm)],[f_1481]) ).
tff(c_12029,plain,
! [X_1041] :
( ~ ssList(app(sk2,cons(sk6,X_1041)))
| ~ duplicatefreeP(app(app(sk7,cons(sk6,nil)),cons(sk6,X_1041)))
| ~ ssItem(sk6)
| ~ ssList(sk7)
| ~ ssList(nil)
| ~ ssList(X_1041) ),
inference(superposition,[status(thm),theory(equality)],[c_3394,c_11955]) ).
tff(c_59874,plain,
! [X_3164] :
( ~ ssList(app(sk2,cons(sk6,X_3164)))
| ~ duplicatefreeP(app(sk2,cons(sk6,X_3164)))
| ~ ssList(X_3164) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_2263,c_2269,c_3394,c_12029]) ).
tff(c_59881,plain,
( ~ ssList(app(sk2,sk1))
| ~ duplicatefreeP(app(sk2,cons(sk6,sk7)))
| ~ ssList(sk7) ),
inference(superposition,[status(thm),theory(equality)],[c_5338,c_59874]) ).
tff(c_59888,plain,
( ~ ssList(app(sk2,sk1))
| ~ duplicatefreeP(app(sk2,sk1)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2263,c_5338,c_59881]) ).
tff(c_59892,plain,
~ duplicatefreeP(app(sk2,sk1)),
inference(splitLeft,[status(thm)],[c_59888]) ).
tff(c_59895,plain,
( ~ ssList(sk2)
| ~ ssList(sk1) ),
inference(resolution,[status(thm)],[c_2906,c_59892]) ).
tff(c_59899,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_407,c_406,c_59895]) ).
tff(c_59900,plain,
~ ssList(app(sk2,sk1)),
inference(splitRight,[status(thm)],[c_59888]) ).
tff(c_59905,plain,
( ~ ssList(sk2)
| ~ ssList(sk1) ),
inference(resolution,[status(thm)],[c_170,c_59900]) ).
tff(c_59909,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_407,c_406,c_59905]) ).
tff(c_59910,plain,
! [V_67] : ssItem(V_67),
inference(splitRight,[status(thm)],[c_144]) ).
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_62838,plain,
! [U_3450,V_3451] :
( ( app(cons(U_3450,nil),V_3451) = cons(U_3450,V_3451) )
| ~ ssList(V_3451) ),
inference(demodulation,[status(thm),theory(equality)],[c_59910,c_240]) ).
tff(c_61007,plain,
app(cons(sk6,nil),sk7) = sk1,
inference(demodulation,[status(thm),theory(equality)],[c_2264,c_405]) ).
tff(c_62847,plain,
( ( cons(sk6,sk7) = sk1 )
| ~ ssList(sk7) ),
inference(superposition,[status(thm),theory(equality)],[c_62838,c_61007]) ).
tff(c_62863,plain,
cons(sk6,sk7) = sk1,
inference(demodulation,[status(thm),theory(equality)],[c_2263,c_62847]) ).
tff(c_322,plain,
! [W_242,U_240,V_241] :
( ( W_242 = U_240 )
| memberP(V_241,W_242)
| ~ ssItem(W_242)
| ~ ssItem(U_240)
| ~ ssList(V_241)
| ~ memberP(cons(U_240,V_241),W_242) ),
inference(cnfTransformation,[status(thm)],[f_1239]) ).
tff(c_67267,plain,
! [W_3651,U_3652,V_3653] :
( ( W_3651 = U_3652 )
| memberP(V_3653,W_3651)
| ~ ssList(V_3653)
| ~ memberP(cons(U_3652,V_3653),W_3651) ),
inference(demodulation,[status(thm),theory(equality)],[c_59910,c_59910,c_322]) ).
tff(c_67276,plain,
! [W_3651] :
( ( sk6 = W_3651 )
| memberP(sk7,W_3651)
| ~ ssList(sk7)
| ~ memberP(sk1,W_3651) ),
inference(superposition,[status(thm),theory(equality)],[c_62863,c_67267]) ).
tff(c_67291,plain,
! [W_3651] :
( ( sk6 = W_3651 )
| memberP(sk7,W_3651)
| ~ memberP(sk1,W_3651) ),
inference(demodulation,[status(thm),theory(equality)],[c_2263,c_67276]) ).
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_60681,plain,
! [U_82,V_83] :
( ssList(cons(U_82,V_83))
| ~ ssList(V_83) ),
inference(demodulation,[status(thm),theory(equality)],[c_59910,c_172]) ).
tff(c_63430,plain,
! [U_3486,V_3487] :
( rearsegP(app(U_3486,V_3487),V_3487)
| ~ ssList(app(U_3486,V_3487))
| ~ ssList(V_3487)
| ~ ssList(U_3486) ),
inference(cnfTransformation,[status(thm)],[f_961]) ).
tff(c_63486,plain,
( rearsegP(sk1,sk7)
| ~ ssList(app(cons(sk6,nil),sk7))
| ~ ssList(sk7)
| ~ ssList(cons(sk6,nil)) ),
inference(superposition,[status(thm),theory(equality)],[c_61007,c_63430]) ).
tff(c_63629,plain,
( rearsegP(sk1,sk7)
| ~ ssList(cons(sk6,nil)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2263,c_407,c_61007,c_63486]) ).
tff(c_68598,plain,
~ ssList(cons(sk6,nil)),
inference(splitLeft,[status(thm)],[c_63629]) ).
tff(c_68601,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_60681,c_68598]) ).
tff(c_68605,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_68601]) ).
tff(c_68607,plain,
ssList(cons(sk6,nil)),
inference(splitRight,[status(thm)],[c_63629]) ).
tff(c_61029,plain,
app(sk7,cons(sk6,nil)) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_2264,c_403]) ).
tff(c_280,plain,
! [U_182,W_184,V_183] :
( memberP(app(U_182,W_184),V_183)
| ~ ssItem(V_183)
| ~ ssList(U_182)
| ~ ssList(W_184)
| ~ memberP(U_182,V_183) ),
inference(cnfTransformation,[status(thm)],[f_926]) ).
tff(c_64661,plain,
! [U_3521,W_3522,V_3523] :
( memberP(app(U_3521,W_3522),V_3523)
| ~ ssList(U_3521)
| ~ ssList(W_3522)
| ~ memberP(U_3521,V_3523) ),
inference(demodulation,[status(thm),theory(equality)],[c_59910,c_280]) ).
tff(c_64712,plain,
! [V_3523] :
( memberP(sk2,V_3523)
| ~ ssList(sk7)
| ~ ssList(cons(sk6,nil))
| ~ memberP(sk7,V_3523) ),
inference(superposition,[status(thm),theory(equality)],[c_61029,c_64661]) ).
tff(c_64855,plain,
! [V_3523] :
( memberP(sk2,V_3523)
| ~ ssList(cons(sk6,nil))
| ~ memberP(sk7,V_3523) ),
inference(demodulation,[status(thm),theory(equality)],[c_2263,c_64712]) ).
tff(c_86677,plain,
! [V_4557] :
( memberP(sk2,V_4557)
| ~ memberP(sk7,V_4557) ),
inference(demodulation,[status(thm),theory(equality)],[c_68607,c_64855]) ).
tff(c_86707,plain,
! [W_4561] :
( memberP(sk2,W_4561)
| ( sk6 = W_4561 )
| ~ memberP(sk1,W_4561) ),
inference(resolution,[status(thm)],[c_67291,c_86677]) ).
tff(c_86710,plain,
( ( sk6 = sk5 )
| ~ memberP(sk1,sk5) ),
inference(resolution,[status(thm)],[c_86707,c_388]) ).
tff(c_86713,plain,
sk6 = sk5,
inference(demodulation,[status(thm),theory(equality)],[c_386,c_86710]) ).
tff(c_350,plain,
! [U_273,V_274,W_275] :
( memberP(app(U_273,cons(V_274,W_275)),V_274)
| ~ ssList(app(U_273,cons(V_274,W_275)))
| ~ ssItem(V_274)
| ~ ssList(U_273)
| ~ ssList(W_275) ),
inference(cnfTransformation,[status(thm)],[f_1405]) ).
tff(c_69109,plain,
! [U_3734,V_3735,W_3736] :
( memberP(app(U_3734,cons(V_3735,W_3736)),V_3735)
| ~ ssList(app(U_3734,cons(V_3735,W_3736)))
| ~ ssList(U_3734)
| ~ ssList(W_3736) ),
inference(demodulation,[status(thm),theory(equality)],[c_59910,c_350]) ).
tff(c_69164,plain,
( memberP(sk2,sk6)
| ~ ssList(app(sk7,cons(sk6,nil)))
| ~ ssList(sk7)
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_61029,c_69109]) ).
tff(c_69187,plain,
memberP(sk2,sk6),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_2263,c_406,c_61029,c_69164]) ).
tff(c_86745,plain,
memberP(sk2,sk5),
inference(demodulation,[status(thm),theory(equality)],[c_86713,c_69187]) ).
tff(c_86755,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_388,c_86745]) ).
tff(c_86756,plain,
sk1 = nil,
inference(splitRight,[status(thm)],[c_401]) ).
tff(c_86758,plain,
memberP(nil,sk5),
inference(demodulation,[status(thm),theory(equality)],[c_86756,c_386]) ).
tff(c_86757,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_401]) ).
tff(c_86766,plain,
~ memberP(nil,sk5),
inference(demodulation,[status(thm),theory(equality)],[c_86757,c_388]) ).
tff(c_86783,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_86758,c_86766]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC397-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.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % 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:41:20 EDT 2023
% 0.14/0.36 % CPUTime :
% 51.29/35.61 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 51.33/35.63
% 51.33/35.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 51.33/35.67
% 51.33/35.67 Inference rules
% 51.33/35.67 ----------------------
% 51.33/35.67 #Ref : 2
% 51.33/35.67 #Sup : 19570
% 51.33/35.67 #Fact : 0
% 51.33/35.67 #Define : 0
% 51.33/35.67 #Split : 67
% 51.33/35.67 #Chain : 0
% 51.33/35.67 #Close : 0
% 51.33/35.67
% 51.33/35.67 Ordering : KBO
% 51.33/35.67
% 51.33/35.67 Simplification rules
% 51.33/35.67 ----------------------
% 51.33/35.67 #Subsume : 5127
% 51.33/35.67 #Demod : 19474
% 51.33/35.67 #Tautology : 5330
% 51.33/35.67 #SimpNegUnit : 632
% 51.33/35.67 #BackRed : 167
% 51.33/35.67
% 51.33/35.67 #Partial instantiations: 0
% 51.33/35.67 #Strategies tried : 1
% 51.33/35.67
% 51.33/35.67 Timing (in seconds)
% 51.33/35.67 ----------------------
% 51.33/35.67 Preprocessing : 0.86
% 51.33/35.67 Parsing : 0.44
% 51.33/35.67 CNF conversion : 0.06
% 51.33/35.67 Main loop : 33.57
% 51.33/35.67 Inferencing : 6.21
% 51.33/35.67 Reduction : 16.74
% 51.33/35.67 Demodulation : 12.58
% 51.33/35.67 BG Simplification : 0.16
% 51.33/35.67 Subsumption : 8.43
% 51.33/35.67 Abstraction : 0.32
% 51.33/35.67 MUC search : 0.00
% 51.33/35.67 Cooper : 0.00
% 51.33/35.67 Total : 34.50
% 51.33/35.67 Index Insertion : 0.00
% 51.33/35.67 Index Deletion : 0.00
% 51.33/35.67 Index Matching : 0.00
% 51.33/35.67 BG Taut test : 0.00
%------------------------------------------------------------------------------