TSTP Solution File: SWC046-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC046-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 : n014.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:00:55 EDT 2023
% Result : Unsatisfiable 15.22s 5.35s
% Output : CNFRefutation 15.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 87
% Syntax : Number of formulae : 124 ( 25 unt; 73 typ; 0 def)
% Number of atoms : 100 ( 35 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 93 ( 44 ~; 49 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 83 ( 66 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 54 ( 54 usr; 7 con; 0-2 aty)
% Number of variables : 28 (; 28 !; 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 > sk5 > hd > skac3 > skac2 > 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(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(sk5,type,
sk5: $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(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_1653,axiom,
nil != sk1,
file(unknown,unknown) ).
tff(f_1651,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1647,axiom,
ssList(sk3),
file(unknown,unknown) ).
tff(f_278,axiom,
! [U] :
( ~ ssList(U)
| ssItem(hd(U))
| ( nil = U ) ),
file(unknown,unknown) ).
tff(f_64,axiom,
! [U] : ssList(skaf82(U)),
file(unknown,unknown) ).
tff(f_62,axiom,
! [U] : ssItem(skaf83(U)),
file(unknown,unknown) ).
tff(f_543,axiom,
! [U] :
( ~ ssList(U)
| ( cons(skaf83(U),skaf82(U)) = U )
| ( nil = U ) ),
file(unknown,unknown) ).
tff(f_420,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ( tl(cons(U,V)) = V ) ),
file(unknown,unknown) ).
tff(f_492,axiom,
! [U] :
( ~ ssList(U)
| ( cons(hd(U),tl(U)) = U )
| ( nil = U ) ),
file(unknown,unknown) ).
tff(f_898,axiom,
! [U,V,W] :
( ( U != V )
| ~ ssList(W)
| ~ ssItem(V)
| ~ ssItem(U)
| memberP(cons(V,W),U) ),
file(unknown,unknown) ).
tff(f_1649,axiom,
nil = sk2,
file(unknown,unknown) ).
tff(f_1650,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1681,axiom,
! [A] :
( ~ ssItem(A)
| ~ memberP(sk3,A)
| memberP(sk4,A) ),
file(unknown,unknown) ).
tff(f_233,axiom,
! [U] :
( ~ memberP(nil,U)
| ~ ssItem(U) ),
file(unknown,unknown) ).
tff(c_386,plain,
sk1 != nil,
inference(cnfTransformation,[status(thm)],[f_1653]) ).
tff(c_384,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1651]) ).
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_384,c_376]) ).
tff(c_156,plain,
! [U_73] :
( ( nil = U_73 )
| ssItem(hd(U_73))
| ~ ssList(U_73) ),
inference(cnfTransformation,[status(thm)],[f_278]) ).
tff(c_26,plain,
! [U_2] : ssList(skaf82(U_2)),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_24,plain,
! [U_1] : ssItem(skaf83(U_1)),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_3038,plain,
! [U_600] :
( ( nil = U_600 )
| ( cons(skaf83(U_600),skaf82(U_600)) = U_600 )
| ~ ssList(U_600) ),
inference(cnfTransformation,[status(thm)],[f_543]) ).
tff(c_192,plain,
! [U_93,V_94] :
( ( tl(cons(U_93,V_94)) = V_94 )
| ~ ssList(V_94)
| ~ ssItem(U_93) ),
inference(cnfTransformation,[status(thm)],[f_420]) ).
tff(c_3050,plain,
! [U_600] :
( ( tl(U_600) = skaf82(U_600) )
| ~ ssList(skaf82(U_600))
| ~ ssItem(skaf83(U_600))
| ( nil = U_600 )
| ~ ssList(U_600) ),
inference(superposition,[status(thm),theory(equality)],[c_3038,c_192]) ).
tff(c_10353,plain,
! [U_1068] :
( ( tl(U_1068) = skaf82(U_1068) )
| ( nil = U_1068 )
| ~ ssList(U_1068) ),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_26,c_3050]) ).
tff(c_10446,plain,
( ( tl(sk1) = skaf82(sk1) )
| ( sk1 = nil ) ),
inference(resolution,[status(thm)],[c_409,c_10353]) ).
tff(c_10482,plain,
tl(sk1) = skaf82(sk1),
inference(negUnitSimplification,[status(thm)],[c_386,c_10446]) ).
tff(c_208,plain,
! [U_108] :
( ( nil = U_108 )
| ( cons(hd(U_108),tl(U_108)) = U_108 )
| ~ ssList(U_108) ),
inference(cnfTransformation,[status(thm)],[f_492]) ).
tff(c_10494,plain,
( ( sk1 = nil )
| ( cons(hd(sk1),skaf82(sk1)) = sk1 )
| ~ ssList(sk1) ),
inference(superposition,[status(thm),theory(equality)],[c_10482,c_208]) ).
tff(c_10507,plain,
( ( sk1 = nil )
| ( cons(hd(sk1),skaf82(sk1)) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_409,c_10494]) ).
tff(c_10508,plain,
cons(hd(sk1),skaf82(sk1)) = sk1,
inference(negUnitSimplification,[status(thm)],[c_386,c_10507]) ).
tff(c_276,plain,
! [V_177,W_178] :
( memberP(cons(V_177,W_178),V_177)
| ~ ssItem(V_177)
| ~ ssList(W_178) ),
inference(cnfTransformation,[status(thm)],[f_898]) ).
tff(c_10594,plain,
( memberP(sk1,hd(sk1))
| ~ ssItem(hd(sk1))
| ~ ssList(skaf82(sk1)) ),
inference(superposition,[status(thm),theory(equality)],[c_10508,c_276]) ).
tff(c_10655,plain,
( memberP(sk1,hd(sk1))
| ~ ssItem(hd(sk1)) ),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_10594]) ).
tff(c_10662,plain,
~ ssItem(hd(sk1)),
inference(splitLeft,[status(thm)],[c_10655]) ).
tff(c_10665,plain,
( ( sk1 = nil )
| ~ ssList(sk1) ),
inference(resolution,[status(thm)],[c_156,c_10662]) ).
tff(c_10668,plain,
sk1 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_409,c_10665]) ).
tff(c_10670,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_386,c_10668]) ).
tff(c_10672,plain,
ssItem(hd(sk1)),
inference(splitRight,[status(thm)],[c_10655]) ).
tff(c_10671,plain,
memberP(sk1,hd(sk1)),
inference(splitRight,[status(thm)],[c_10655]) ).
tff(c_380,plain,
sk2 = nil,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_382,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_392,plain,
! [A_329] :
( memberP(sk4,A_329)
| ~ memberP(sk3,A_329)
| ~ ssItem(A_329) ),
inference(cnfTransformation,[status(thm)],[f_1681]) ).
tff(c_395,plain,
! [A_329] :
( memberP(sk4,A_329)
| ~ memberP(sk1,A_329)
| ~ ssItem(A_329) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_392]) ).
tff(c_399,plain,
! [A_329] :
( memberP(sk2,A_329)
| ~ memberP(sk1,A_329)
| ~ ssItem(A_329) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_395]) ).
tff(c_404,plain,
! [A_329] :
( memberP(nil,A_329)
| ~ memberP(sk1,A_329)
| ~ ssItem(A_329) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_399]) ).
tff(c_10687,plain,
( memberP(nil,hd(sk1))
| ~ ssItem(hd(sk1)) ),
inference(resolution,[status(thm)],[c_10671,c_404]) ).
tff(c_10690,plain,
memberP(nil,hd(sk1)),
inference(demodulation,[status(thm),theory(equality)],[c_10672,c_10687]) ).
tff(c_142,plain,
! [U_65] :
( ~ ssItem(U_65)
| ~ memberP(nil,U_65) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_10693,plain,
~ ssItem(hd(sk1)),
inference(resolution,[status(thm)],[c_10690,c_142]) ).
tff(c_10697,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10672,c_10693]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC046-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.15/0.35 % Computer : n014.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:13:33 EDT 2023
% 0.15/0.35 % CPUTime :
% 15.22/5.35 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.22/5.35
% 15.22/5.35 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 15.22/5.38
% 15.22/5.38 Inference rules
% 15.22/5.38 ----------------------
% 15.22/5.38 #Ref : 0
% 15.22/5.38 #Sup : 2223
% 15.22/5.38 #Fact : 0
% 15.22/5.38 #Define : 0
% 15.22/5.38 #Split : 4
% 15.22/5.38 #Chain : 0
% 15.22/5.38 #Close : 0
% 15.22/5.38
% 15.22/5.38 Ordering : KBO
% 15.22/5.38
% 15.22/5.38 Simplification rules
% 15.22/5.38 ----------------------
% 15.22/5.38 #Subsume : 169
% 15.22/5.38 #Demod : 2443
% 15.22/5.38 #Tautology : 555
% 15.22/5.38 #SimpNegUnit : 11
% 15.22/5.38 #BackRed : 0
% 15.22/5.39
% 15.22/5.39 #Partial instantiations: 0
% 15.22/5.39 #Strategies tried : 1
% 15.22/5.39
% 15.22/5.39 Timing (in seconds)
% 15.22/5.39 ----------------------
% 15.22/5.39 Preprocessing : 0.88
% 15.22/5.39 Parsing : 0.46
% 15.22/5.39 CNF conversion : 0.07
% 15.22/5.39 Main loop : 3.42
% 15.22/5.39 Inferencing : 0.88
% 15.22/5.39 Reduction : 1.55
% 15.22/5.39 Demodulation : 1.20
% 15.22/5.39 BG Simplification : 0.09
% 15.22/5.39 Subsumption : 0.69
% 15.22/5.39 Abstraction : 0.07
% 15.22/5.39 MUC search : 0.00
% 15.22/5.39 Cooper : 0.00
% 15.22/5.39 Total : 4.36
% 15.22/5.39 Index Insertion : 0.00
% 15.22/5.39 Index Deletion : 0.00
% 15.22/5.39 Index Matching : 0.00
% 15.22/5.39 BG Taut test : 0.00
%------------------------------------------------------------------------------