TSTP Solution File: SWC415-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC415-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:02:34 EDT 2023
% Result : Unsatisfiable 8.90s 3.15s
% Output : CNFRefutation 9.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 83
% Syntax : Number of formulae : 123 ( 29 unt; 72 typ; 0 def)
% Number of atoms : 103 ( 29 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 113 ( 61 ~; 52 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 53 ( 53 usr; 7 con; 0-2 aty)
% Number of variables : 13 (; 13 !; 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 > 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(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_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1648,axiom,
ssList(sk4),
file(unknown,unknown) ).
tff(f_56,axiom,
ssList(nil),
file(unknown,unknown) ).
tff(f_456,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ),
file(unknown,unknown) ).
tff(f_271,axiom,
! [U] :
( ~ ssList(U)
| ssList(tl(U))
| ( nil = U ) ),
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1647,axiom,
ssList(sk3),
file(unknown,unknown) ).
tff(f_1653,axiom,
( neq(sk2,nil)
| neq(sk2,nil) ),
file(unknown,unknown) ).
tff(f_1713,axiom,
! [A] :
( ~ ssList(A)
| ( tl(sk2) != A )
| ( sk1 != A )
| ~ neq(nil,sk2)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1698,axiom,
! [A] :
( ~ ssList(A)
| ( sk3 = A )
| ( tl(sk4) != A )
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_613,axiom,
! [U,V] :
( ( U != V )
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) ),
file(unknown,unknown) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_378,plain,
ssList(sk4),
inference(cnfTransformation,[status(thm)],[f_1648]) ).
tff(c_405,plain,
ssList(sk2),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_378]) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_3193,plain,
! [V_605,U_606] :
( ( V_605 = U_606 )
| neq(V_605,U_606)
| ~ ssList(V_605)
| ~ ssList(U_606) ),
inference(cnfTransformation,[status(thm)],[f_456]) ).
tff(c_200,plain,
! [V_102,U_101] :
( ( V_102 = U_101 )
| neq(V_102,U_101)
| ~ ssList(V_102)
| ~ ssList(U_101) ),
inference(cnfTransformation,[status(thm)],[f_456]) ).
tff(c_154,plain,
! [U_72] :
( ( nil = U_72 )
| ssList(tl(U_72))
| ~ ssList(U_72) ),
inference(cnfTransformation,[status(thm)],[f_271]) ).
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_406,plain,
ssList(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_376]) ).
tff(c_384,plain,
neq(sk2,nil),
inference(cnfTransformation,[status(thm)],[f_1653]) ).
tff(c_394,plain,
( ~ neq(sk4,nil)
| ~ neq(nil,sk2)
| ( tl(sk2) != sk1 )
| ~ ssList(sk1) ),
inference(cnfTransformation,[status(thm)],[f_1713]) ).
tff(c_399,plain,
( ~ neq(sk2,nil)
| ~ neq(nil,sk2)
| ( tl(sk2) != sk1 )
| ~ ssList(sk1) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_394]) ).
tff(c_402,plain,
( ~ neq(nil,sk2)
| ( tl(sk2) != sk1 )
| ~ ssList(sk1) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_399]) ).
tff(c_408,plain,
( ~ neq(nil,sk2)
| ( tl(sk2) != sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_406,c_402]) ).
tff(c_607,plain,
tl(sk2) != sk1,
inference(splitLeft,[status(thm)],[c_408]) ).
tff(c_392,plain,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ( tl(sk4) = sk3 )
| ~ ssList(tl(sk4)) ),
inference(cnfTransformation,[status(thm)],[f_1698]) ).
tff(c_398,plain,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ( tl(sk4) = sk1 )
| ~ ssList(tl(sk4)) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_392]) ).
tff(c_400,plain,
( ~ neq(sk2,nil)
| ~ neq(nil,sk2)
| ( tl(sk2) = sk1 )
| ~ ssList(tl(sk2)) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_380,c_380,c_398]) ).
tff(c_404,plain,
( ~ neq(nil,sk2)
| ( tl(sk2) = sk1 )
| ~ ssList(tl(sk2)) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_400]) ).
tff(c_1869,plain,
( ~ neq(nil,sk2)
| ~ ssList(tl(sk2)) ),
inference(negUnitSimplification,[status(thm)],[c_607,c_404]) ).
tff(c_1870,plain,
~ ssList(tl(sk2)),
inference(splitLeft,[status(thm)],[c_1869]) ).
tff(c_1873,plain,
( ( sk2 = nil )
| ~ ssList(sk2) ),
inference(resolution,[status(thm)],[c_154,c_1870]) ).
tff(c_1876,plain,
sk2 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_405,c_1873]) ).
tff(c_1901,plain,
neq(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_1876,c_384]) ).
tff(c_230,plain,
! [V_129] :
( ~ ssList(V_129)
| ~ neq(V_129,V_129) ),
inference(cnfTransformation,[status(thm)],[f_613]) ).
tff(c_1919,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_1901,c_230]) ).
tff(c_1926,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_1919]) ).
tff(c_1927,plain,
~ neq(nil,sk2),
inference(splitRight,[status(thm)],[c_1869]) ).
tff(c_1956,plain,
( ( sk2 = nil )
| ~ ssList(nil)
| ~ ssList(sk2) ),
inference(resolution,[status(thm)],[c_200,c_1927]) ).
tff(c_1960,plain,
sk2 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_405,c_16,c_1956]) ).
tff(c_1986,plain,
neq(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_1960,c_384]) ).
tff(c_2005,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_1986,c_230]) ).
tff(c_2012,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_2005]) ).
tff(c_2013,plain,
~ neq(nil,sk2),
inference(splitRight,[status(thm)],[c_408]) ).
tff(c_3196,plain,
( ( sk2 = nil )
| ~ ssList(nil)
| ~ ssList(sk2) ),
inference(resolution,[status(thm)],[c_3193,c_2013]) ).
tff(c_3207,plain,
sk2 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_405,c_16,c_3196]) ).
tff(c_3226,plain,
~ neq(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_3207,c_2013]) ).
tff(c_3228,plain,
neq(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_3207,c_384]) ).
tff(c_3260,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_3226,c_3228]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC415-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.13/0.35 % Computer : n014.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 21:14:33 EDT 2023
% 0.13/0.35 % CPUTime :
% 8.90/3.15 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.90/3.16
% 8.90/3.16 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.20/3.19
% 9.20/3.19 Inference rules
% 9.20/3.19 ----------------------
% 9.20/3.19 #Ref : 0
% 9.20/3.19 #Sup : 643
% 9.20/3.19 #Fact : 0
% 9.20/3.19 #Define : 0
% 9.20/3.19 #Split : 6
% 9.20/3.19 #Chain : 0
% 9.20/3.19 #Close : 0
% 9.20/3.19
% 9.20/3.19 Ordering : KBO
% 9.20/3.19
% 9.20/3.19 Simplification rules
% 9.20/3.19 ----------------------
% 9.20/3.19 #Subsume : 10
% 9.20/3.19 #Demod : 356
% 9.20/3.19 #Tautology : 232
% 9.20/3.19 #SimpNegUnit : 2
% 9.20/3.19 #BackRed : 74
% 9.20/3.19
% 9.20/3.19 #Partial instantiations: 0
% 9.20/3.19 #Strategies tried : 1
% 9.20/3.19
% 9.20/3.19 Timing (in seconds)
% 9.20/3.19 ----------------------
% 9.20/3.19 Preprocessing : 0.86
% 9.20/3.19 Parsing : 0.43
% 9.20/3.19 CNF conversion : 0.07
% 9.20/3.19 Main loop : 1.10
% 9.20/3.19 Inferencing : 0.34
% 9.20/3.19 Reduction : 0.38
% 9.20/3.19 Demodulation : 0.27
% 9.20/3.19 BG Simplification : 0.07
% 9.20/3.19 Subsumption : 0.22
% 9.20/3.19 Abstraction : 0.04
% 9.20/3.19 MUC search : 0.00
% 9.20/3.19 Cooper : 0.00
% 9.20/3.19 Total : 2.01
% 9.20/3.19 Index Insertion : 0.00
% 9.20/3.19 Index Deletion : 0.00
% 9.20/3.19 Index Matching : 0.00
% 9.20/3.19 BG Taut test : 0.00
%------------------------------------------------------------------------------