TSTP Solution File: SWC419-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC419-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 : n027.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:36 EDT 2023
% Result : Unsatisfiable 76.52s 58.69s
% Output : CNFRefutation 76.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 93
% Syntax : Number of formulae : 156 ( 29 unt; 74 typ; 0 def)
% Number of atoms : 181 ( 47 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 212 ( 113 ~; 99 |; 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 : 55 ( 55 usr; 9 con; 0-2 aty)
% Number of variables : 68 (; 68 !; 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_1651,axiom,
neq(sk2,nil),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1678,axiom,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1648,axiom,
ssList(sk4),
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
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_1674,axiom,
( ssItem(sk5)
| ~ 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_1682,axiom,
( ( app(cons(sk5,nil),sk6) = sk4 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1686,axiom,
( ( app(sk6,cons(sk5,nil)) = sk3 )
| ~ 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_250,axiom,
! [U] :
( ~ ssList(U)
| ( app(nil,U) = U ) ),
file(unknown,unknown) ).
tff(f_1175,axiom,
! [U,V,W] :
( ~ ssItem(U)
| ~ ssList(V)
| ~ ssList(W)
| ( cons(U,app(V,W)) = app(cons(U,V),W) ) ),
file(unknown,unknown) ).
tff(f_245,axiom,
! [U] :
( ~ ssList(U)
| ( app(U,nil) = U ) ),
file(unknown,unknown) ).
tff(f_342,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
file(unknown,unknown) ).
tff(f_1666,axiom,
! [A,B,C] :
( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ( app(app(C,cons(A,nil)),B) != sk1 ) ),
file(unknown,unknown) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_384,plain,
neq(sk2,nil),
inference(cnfTransformation,[status(thm)],[f_1651]) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_392,plain,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1678]) ).
tff(c_399,plain,
( ~ neq(sk2,nil)
| ssList(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_392]) ).
tff(c_405,plain,
ssList(sk6),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_399]) ).
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_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_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_1073,plain,
! [V_447,U_448] :
( ssList(app(V_447,U_448))
| ~ ssList(V_447)
| ~ ssList(U_448) ),
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_766,plain,
! [U_66] :
( duplicatefreeP(U_66)
| ~ ssList(U_66) ),
inference(splitLeft,[status(thm)],[c_144]) ).
tff(c_1137,plain,
! [V_447,U_448] :
( duplicatefreeP(app(V_447,U_448))
| ~ ssList(V_447)
| ~ ssList(U_448) ),
inference(resolution,[status(thm)],[c_1073,c_766]) ).
tff(c_390,plain,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1674]) ).
tff(c_400,plain,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_390]) ).
tff(c_407,plain,
ssItem(sk5),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_400]) ).
tff(c_3692,plain,
! [U_638,V_639] :
( ( app(cons(U_638,nil),V_639) = cons(U_638,V_639) )
| ~ ssList(V_639)
| ~ ssItem(U_638) ),
inference(cnfTransformation,[status(thm)],[f_666]) ).
tff(c_394,plain,
( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk6) = sk4 ) ),
inference(cnfTransformation,[status(thm)],[f_1682]) ).
tff(c_401,plain,
( ~ neq(sk2,nil)
| ( app(cons(sk5,nil),sk6) = sk2 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_394]) ).
tff(c_409,plain,
app(cons(sk5,nil),sk6) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_384,c_401]) ).
tff(c_3704,plain,
( ( cons(sk5,sk6) = sk2 )
| ~ ssList(sk6)
| ~ ssItem(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_3692,c_409]) ).
tff(c_3716,plain,
cons(sk5,sk6) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_407,c_405,c_3704]) ).
tff(c_396,plain,
( ~ neq(sk4,nil)
| ( app(sk6,cons(sk5,nil)) = sk3 ) ),
inference(cnfTransformation,[status(thm)],[f_1686]) ).
tff(c_398,plain,
( ~ neq(sk4,nil)
| ( app(sk6,cons(sk5,nil)) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_396]) ).
tff(c_403,plain,
( ~ neq(sk2,nil)
| ( app(sk6,cons(sk5,nil)) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_398]) ).
tff(c_411,plain,
app(sk6,cons(sk5,nil)) = sk1,
inference(demodulation,[status(thm),theory(equality)],[c_384,c_403]) ).
tff(c_10189,plain,
! [U_925,V_926,W_927,X_928] :
( ~ ssList(app(app(U_925,cons(V_926,W_927)),cons(V_926,X_928)))
| ~ duplicatefreeP(app(app(U_925,cons(V_926,W_927)),cons(V_926,X_928)))
| ~ ssItem(V_926)
| ~ ssList(U_925)
| ~ ssList(W_927)
| ~ ssList(X_928) ),
inference(cnfTransformation,[status(thm)],[f_1481]) ).
tff(c_10266,plain,
! [X_928] :
( ~ ssList(app(sk1,cons(sk5,X_928)))
| ~ duplicatefreeP(app(app(sk6,cons(sk5,nil)),cons(sk5,X_928)))
| ~ ssItem(sk5)
| ~ ssList(sk6)
| ~ ssList(nil)
| ~ ssList(X_928) ),
inference(superposition,[status(thm),theory(equality)],[c_411,c_10189]) ).
tff(c_47109,plain,
! [X_2678] :
( ~ ssList(app(sk1,cons(sk5,X_2678)))
| ~ duplicatefreeP(app(sk1,cons(sk5,X_2678)))
| ~ ssList(X_2678) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_405,c_407,c_411,c_10266]) ).
tff(c_47116,plain,
( ~ ssList(app(sk1,sk2))
| ~ duplicatefreeP(app(sk1,cons(sk5,sk6)))
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_3716,c_47109]) ).
tff(c_47123,plain,
( ~ ssList(app(sk1,sk2))
| ~ duplicatefreeP(app(sk1,sk2)) ),
inference(demodulation,[status(thm),theory(equality)],[c_405,c_3716,c_47116]) ).
tff(c_47127,plain,
~ duplicatefreeP(app(sk1,sk2)),
inference(splitLeft,[status(thm)],[c_47123]) ).
tff(c_47130,plain,
( ~ ssList(sk1)
| ~ ssList(sk2) ),
inference(resolution,[status(thm)],[c_1137,c_47127]) ).
tff(c_47134,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_412,c_413,c_47130]) ).
tff(c_47135,plain,
~ ssList(app(sk1,sk2)),
inference(splitRight,[status(thm)],[c_47123]) ).
tff(c_47139,plain,
( ~ ssList(sk1)
| ~ ssList(sk2) ),
inference(resolution,[status(thm)],[c_170,c_47135]) ).
tff(c_47143,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_412,c_413,c_47139]) ).
tff(c_47144,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_50033,plain,
! [U_2984,V_2985] :
( ( app(cons(U_2984,nil),V_2985) = cons(U_2984,V_2985) )
| ~ ssList(V_2985) ),
inference(demodulation,[status(thm),theory(equality)],[c_47144,c_240]) ).
tff(c_50045,plain,
( ( cons(sk5,sk6) = sk2 )
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_50033,c_409]) ).
tff(c_50058,plain,
cons(sk5,sk6) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_405,c_50045]) ).
tff(c_484,plain,
! [U_391] :
( ( app(nil,U_391) = U_391 )
| ~ ssList(U_391) ),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_606,plain,
app(nil,sk6) = sk6,
inference(resolution,[status(thm)],[c_405,c_484]) ).
tff(c_314,plain,
! [U_230,V_231,W_232] :
( ( cons(U_230,app(V_231,W_232)) = app(cons(U_230,V_231),W_232) )
| ~ ssList(W_232)
| ~ ssList(V_231)
| ~ ssItem(U_230) ),
inference(cnfTransformation,[status(thm)],[f_1175]) ).
tff(c_53585,plain,
! [U_3142,V_3143,W_3144] :
( ( cons(U_3142,app(V_3143,W_3144)) = app(cons(U_3142,V_3143),W_3144) )
| ~ ssList(W_3144)
| ~ ssList(V_3143) ),
inference(demodulation,[status(thm),theory(equality)],[c_47144,c_314]) ).
tff(c_53780,plain,
! [U_3142] :
( ( app(cons(U_3142,nil),sk6) = cons(U_3142,sk6) )
| ~ ssList(sk6)
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_606,c_53585]) ).
tff(c_53890,plain,
! [U_3142] : ( app(cons(U_3142,nil),sk6) = cons(U_3142,sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_405,c_53780]) ).
tff(c_627,plain,
! [U_394] :
( ( app(U_394,nil) = U_394 )
| ~ ssList(U_394) ),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_751,plain,
app(sk1,nil) = sk1,
inference(resolution,[status(thm)],[c_413,c_627]) ).
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_47819,plain,
! [U_2742,V_2743] :
( ssList(cons(U_2742,V_2743))
| ~ ssList(V_2743) ),
inference(demodulation,[status(thm),theory(equality)],[c_47144,c_172]) ).
tff(c_148,plain,
! [U_69] :
( ( app(nil,U_69) = U_69 )
| ~ ssList(U_69) ),
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_47833,plain,
! [U_2742,V_2743] :
( ( app(nil,cons(U_2742,V_2743)) = cons(U_2742,V_2743) )
| ~ ssList(V_2743) ),
inference(resolution,[status(thm)],[c_47819,c_148]) ).
tff(c_386,plain,
! [C_329,A_327,B_328] :
( ( app(app(C_329,cons(A_327,nil)),B_328) != sk1 )
| ( app(app(B_328,cons(A_327,nil)),C_329) != sk2 )
| ~ ssList(C_329)
| ~ ssList(B_328)
| ~ ssItem(A_327) ),
inference(cnfTransformation,[status(thm)],[f_1666]) ).
tff(c_56600,plain,
! [C_3253,A_3254,B_3255] :
( ( app(app(C_3253,cons(A_3254,nil)),B_3255) != sk1 )
| ( app(app(B_3255,cons(A_3254,nil)),C_3253) != sk2 )
| ~ ssList(C_3253)
| ~ ssList(B_3255) ),
inference(demodulation,[status(thm),theory(equality)],[c_47144,c_386]) ).
tff(c_56625,plain,
! [B_3255] :
( ( app(sk1,B_3255) != sk1 )
| ( app(app(B_3255,cons(sk5,nil)),sk6) != sk2 )
| ~ ssList(sk6)
| ~ ssList(B_3255) ),
inference(superposition,[status(thm),theory(equality)],[c_411,c_56600]) ).
tff(c_130700,plain,
! [B_6498] :
( ( app(sk1,B_6498) != sk1 )
| ( app(app(B_6498,cons(sk5,nil)),sk6) != sk2 )
| ~ ssList(B_6498) ),
inference(demodulation,[status(thm),theory(equality)],[c_405,c_56625]) ).
tff(c_130704,plain,
( ( app(sk1,nil) != sk1 )
| ( app(cons(sk5,nil),sk6) != sk2 )
| ~ ssList(nil)
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_47833,c_130700]) ).
tff(c_130733,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_16,c_50058,c_53890,c_751,c_130704]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC419-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 : n027.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 22:03:24 EDT 2023
% 0.13/0.35 % CPUTime :
% 76.52/58.69 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 76.52/58.71
% 76.52/58.71 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 76.80/58.78
% 76.80/58.78 Inference rules
% 76.80/58.78 ----------------------
% 76.80/58.78 #Ref : 18
% 76.80/58.78 #Sup : 30305
% 76.80/58.78 #Fact : 0
% 76.80/58.78 #Define : 0
% 76.80/58.78 #Split : 81
% 76.80/58.78 #Chain : 0
% 76.80/58.78 #Close : 0
% 76.80/58.78
% 76.80/58.78 Ordering : KBO
% 76.80/58.78
% 76.80/58.78 Simplification rules
% 76.80/58.78 ----------------------
% 76.80/58.78 #Subsume : 6715
% 76.80/58.78 #Demod : 23665
% 76.80/58.78 #Tautology : 6097
% 76.80/58.78 #SimpNegUnit : 1486
% 76.80/58.78 #BackRed : 103
% 76.80/58.78
% 76.80/58.78 #Partial instantiations: 0
% 76.80/58.78 #Strategies tried : 1
% 76.80/58.78
% 76.80/58.78 Timing (in seconds)
% 76.80/58.78 ----------------------
% 76.80/58.78 Preprocessing : 0.89
% 76.80/58.78 Parsing : 0.47
% 76.80/58.78 CNF conversion : 0.06
% 76.80/58.78 Main loop : 56.71
% 76.80/58.78 Inferencing : 9.47
% 76.80/58.78 Reduction : 26.89
% 76.80/58.78 Demodulation : 19.96
% 76.80/58.78 BG Simplification : 0.23
% 76.80/58.78 Subsumption : 16.93
% 76.80/58.78 Abstraction : 0.51
% 76.80/58.78 MUC search : 0.00
% 76.80/58.78 Cooper : 0.00
% 76.80/58.78 Total : 57.71
% 76.80/58.78 Index Insertion : 0.00
% 76.80/58.78 Index Deletion : 0.00
% 76.80/58.78 Index Matching : 0.00
% 76.80/58.78 BG Taut test : 0.00
%------------------------------------------------------------------------------