TSTP Solution File: SWC407-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC407-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:32 EDT 2023
% Result : Unsatisfiable 30.15s 16.29s
% Output : CNFRefutation 30.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 87
% Syntax : Number of formulae : 137 ( 38 unt; 74 typ; 0 def)
% Number of atoms : 103 ( 37 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 68 ( 28 ~; 40 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 2 ( 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 : 10 (; 10 !; 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_1651,axiom,
ssItem(sk5),
file(unknown,unknown) ).
tff(f_1654,axiom,
~ memberP(sk2,sk5),
file(unknown,unknown) ).
tff(f_1652,axiom,
memberP(sk1,sk5),
file(unknown,unknown) ).
tff(f_56,axiom,
ssList(nil),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1657,axiom,
( ssItem(sk6)
| ( nil = sk4 ) ),
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1669,axiom,
( ( cons(sk6,nil) = sk3 )
| ( nil = sk3 ) ),
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_233,axiom,
! [U] :
( ~ memberP(nil,U)
| ~ ssItem(U) ),
file(unknown,unknown) ).
tff(f_1666,axiom,
( memberP(sk4,sk6)
| ( nil = sk4 ) ),
file(unknown,unknown) ).
tff(f_1672,axiom,
( memberP(sk4,sk6)
| ( nil = sk3 ) ),
file(unknown,unknown) ).
tff(f_1660,axiom,
( ssItem(sk6)
| ( nil = sk3 ) ),
file(unknown,unknown) ).
tff(c_384,plain,
ssItem(sk5),
inference(cnfTransformation,[status(thm)],[f_1651]) ).
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_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_390,plain,
( ( sk4 = nil )
| ssItem(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1657]) ).
tff(c_406,plain,
( ( sk2 = nil )
| ssItem(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_390]) ).
tff(c_458,plain,
ssItem(sk6),
inference(splitLeft,[status(thm)],[c_406]) ).
tff(c_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_398,plain,
( ( sk3 = nil )
| ( cons(sk6,nil) = sk3 ) ),
inference(cnfTransformation,[status(thm)],[f_1669]) ).
tff(c_402,plain,
( ( sk1 = nil )
| ( cons(sk6,nil) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_382,c_398]) ).
tff(c_481,plain,
cons(sk6,nil) = sk1,
inference(splitLeft,[status(thm)],[c_402]) ).
tff(c_7505,plain,
! [W_818,U_819,V_820] :
( ( W_818 = U_819 )
| memberP(V_820,W_818)
| ~ ssItem(W_818)
| ~ ssItem(U_819)
| ~ ssList(V_820)
| ~ memberP(cons(U_819,V_820),W_818) ),
inference(cnfTransformation,[status(thm)],[f_1239]) ).
tff(c_7526,plain,
! [W_818] :
( ( sk6 = W_818 )
| memberP(nil,W_818)
| ~ ssItem(W_818)
| ~ ssItem(sk6)
| ~ ssList(nil)
| ~ memberP(sk1,W_818) ),
inference(superposition,[status(thm),theory(equality)],[c_481,c_7505]) ).
tff(c_35916,plain,
! [W_1998] :
( ( sk6 = W_1998 )
| memberP(nil,W_1998)
| ~ ssItem(W_1998)
| ~ memberP(sk1,W_1998) ),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_458,c_7526]) ).
tff(c_35930,plain,
( ( sk6 = sk5 )
| memberP(nil,sk5)
| ~ ssItem(sk5) ),
inference(resolution,[status(thm)],[c_386,c_35916]) ).
tff(c_35944,plain,
( ( sk6 = sk5 )
| memberP(nil,sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_35930]) ).
tff(c_35945,plain,
memberP(nil,sk5),
inference(splitLeft,[status(thm)],[c_35944]) ).
tff(c_142,plain,
! [U_65] :
( ~ ssItem(U_65)
| ~ memberP(nil,U_65) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_35948,plain,
~ ssItem(sk5),
inference(resolution,[status(thm)],[c_35945,c_142]) ).
tff(c_35952,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_384,c_35948]) ).
tff(c_35953,plain,
sk6 = sk5,
inference(splitRight,[status(thm)],[c_35944]) ).
tff(c_396,plain,
( ( sk4 = nil )
| memberP(sk4,sk6) ),
inference(cnfTransformation,[status(thm)],[f_1666]) ).
tff(c_405,plain,
( ( sk2 = nil )
| memberP(sk2,sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_396]) ).
tff(c_465,plain,
memberP(sk2,sk6),
inference(splitLeft,[status(thm)],[c_405]) ).
tff(c_36041,plain,
memberP(sk2,sk5),
inference(demodulation,[status(thm),theory(equality)],[c_35953,c_465]) ).
tff(c_36045,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_388,c_36041]) ).
tff(c_36046,plain,
sk1 = nil,
inference(splitRight,[status(thm)],[c_402]) ).
tff(c_36049,plain,
memberP(nil,sk5),
inference(demodulation,[status(thm),theory(equality)],[c_36046,c_386]) ).
tff(c_36063,plain,
~ ssItem(sk5),
inference(resolution,[status(thm)],[c_36049,c_142]) ).
tff(c_36067,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_384,c_36063]) ).
tff(c_36068,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_405]) ).
tff(c_36070,plain,
~ memberP(nil,sk5),
inference(demodulation,[status(thm),theory(equality)],[c_36068,c_388]) ).
tff(c_36069,plain,
~ memberP(sk2,sk6),
inference(splitRight,[status(thm)],[c_405]) ).
tff(c_36082,plain,
~ memberP(nil,sk6),
inference(demodulation,[status(thm),theory(equality)],[c_36068,c_36069]) ).
tff(c_400,plain,
( ( sk3 = nil )
| memberP(sk4,sk6) ),
inference(cnfTransformation,[status(thm)],[f_1672]) ).
tff(c_404,plain,
( ( sk1 = nil )
| memberP(sk4,sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_400]) ).
tff(c_408,plain,
( ( sk1 = nil )
| memberP(sk2,sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_404]) ).
tff(c_36091,plain,
( ( sk1 = nil )
| memberP(nil,sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_36068,c_408]) ).
tff(c_36092,plain,
sk1 = nil,
inference(negUnitSimplification,[status(thm)],[c_36082,c_36091]) ).
tff(c_36093,plain,
memberP(nil,sk5),
inference(demodulation,[status(thm),theory(equality)],[c_36092,c_386]) ).
tff(c_36097,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36070,c_36093]) ).
tff(c_36098,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_406]) ).
tff(c_36100,plain,
~ memberP(nil,sk5),
inference(demodulation,[status(thm),theory(equality)],[c_36098,c_388]) ).
tff(c_36099,plain,
~ ssItem(sk6),
inference(splitRight,[status(thm)],[c_406]) ).
tff(c_392,plain,
( ( sk3 = nil )
| ssItem(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1660]) ).
tff(c_401,plain,
( ( sk1 = nil )
| ssItem(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_392]) ).
tff(c_36116,plain,
sk1 = nil,
inference(negUnitSimplification,[status(thm)],[c_36099,c_401]) ).
tff(c_36117,plain,
memberP(nil,sk5),
inference(demodulation,[status(thm),theory(equality)],[c_36116,c_386]) ).
tff(c_36121,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36100,c_36117]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC407-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.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % 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:56:35 EDT 2023
% 0.14/0.36 % CPUTime :
% 30.15/16.29 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 30.15/16.30
% 30.15/16.30 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 30.15/16.33
% 30.15/16.33 Inference rules
% 30.15/16.33 ----------------------
% 30.15/16.33 #Ref : 0
% 30.15/16.33 #Sup : 7813
% 30.15/16.33 #Fact : 0
% 30.15/16.33 #Define : 0
% 30.15/16.33 #Split : 18
% 30.15/16.33 #Chain : 0
% 30.15/16.33 #Close : 0
% 30.15/16.33
% 30.15/16.33 Ordering : KBO
% 30.15/16.33
% 30.15/16.33 Simplification rules
% 30.15/16.33 ----------------------
% 30.15/16.33 #Subsume : 1283
% 30.15/16.33 #Demod : 9568
% 30.15/16.33 #Tautology : 2610
% 30.15/16.33 #SimpNegUnit : 710
% 30.15/16.33 #BackRed : 112
% 30.15/16.33
% 30.15/16.33 #Partial instantiations: 0
% 30.15/16.33 #Strategies tried : 1
% 30.15/16.33
% 30.15/16.33 Timing (in seconds)
% 30.15/16.33 ----------------------
% 30.15/16.33 Preprocessing : 0.87
% 30.15/16.33 Parsing : 0.44
% 30.15/16.33 CNF conversion : 0.07
% 30.15/16.34 Main loop : 14.33
% 30.15/16.34 Inferencing : 2.86
% 30.15/16.34 Reduction : 7.48
% 30.15/16.34 Demodulation : 5.79
% 30.15/16.34 BG Simplification : 0.12
% 30.15/16.34 Subsumption : 3.02
% 30.15/16.34 Abstraction : 0.14
% 30.15/16.34 MUC search : 0.00
% 30.15/16.34 Cooper : 0.00
% 30.15/16.34 Total : 15.25
% 30.15/16.34 Index Insertion : 0.00
% 30.15/16.34 Index Deletion : 0.00
% 30.15/16.34 Index Matching : 0.00
% 30.15/16.34 BG Taut test : 0.00
%------------------------------------------------------------------------------