TSTP Solution File: SWC106-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC106-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n017.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:01:11 EDT 2023
% Result : Unsatisfiable 11.80s 3.80s
% Output : CNFRefutation 11.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 89
% Syntax : Number of formulae : 130 ( 27 unt; 74 typ; 0 def)
% Number of atoms : 105 ( 20 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 104 ( 55 ~; 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 : 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 : 16 (; 16 !; 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_1653,axiom,
( neq(sk2,nil)
| neq(sk2,nil) ),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1680,axiom,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_56,axiom,
ssList(nil),
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1647,axiom,
ssList(sk3),
file(unknown,unknown) ).
tff(f_456,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ),
file(unknown,unknown) ).
tff(f_1700,axiom,
( ~ neq(sk1,nil)
| ~ rearsegP(sk2,sk1)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1688,axiom,
( ( cons(sk5,nil) = sk3 )
| ~ neq(sk4,nil) ),
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_233,axiom,
! [U] :
( ~ memberP(nil,U)
| ~ ssItem(U) ),
file(unknown,unknown) ).
tff(f_1684,axiom,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1648,axiom,
ssList(sk4),
file(unknown,unknown) ).
tff(f_1692,axiom,
( ( app(sk6,cons(sk5,nil)) = sk4 )
| ~ neq(sk4,nil) ),
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(c_384,plain,
neq(sk2,nil),
inference(cnfTransformation,[status(thm)],[f_1653]) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_398,plain,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1680]) ).
tff(c_414,plain,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_398]) ).
tff(c_420,plain,
ssItem(sk5),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_414]) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
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_431,plain,
ssList(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_376]) ).
tff(c_2017,plain,
! [V_507,U_508] :
( ( V_507 = U_508 )
| neq(V_507,U_508)
| ~ ssList(V_507)
| ~ ssList(U_508) ),
inference(cnfTransformation,[status(thm)],[f_456]) ).
tff(c_406,plain,
( ~ neq(sk4,nil)
| ~ rearsegP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(cnfTransformation,[status(thm)],[f_1700]) ).
tff(c_416,plain,
( ~ neq(sk2,nil)
| ~ rearsegP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_406]) ).
tff(c_424,plain,
( ~ rearsegP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_416]) ).
tff(c_504,plain,
~ neq(sk1,nil),
inference(splitLeft,[status(thm)],[c_424]) ).
tff(c_2020,plain,
( ( sk1 = nil )
| ~ ssList(sk1)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_2017,c_504]) ).
tff(c_2031,plain,
sk1 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_431,c_2020]) ).
tff(c_402,plain,
( ~ neq(sk4,nil)
| ( cons(sk5,nil) = sk3 ) ),
inference(cnfTransformation,[status(thm)],[f_1688]) ).
tff(c_413,plain,
( ~ neq(sk4,nil)
| ( cons(sk5,nil) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_402]) ).
tff(c_418,plain,
( ~ neq(sk2,nil)
| ( cons(sk5,nil) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_413]) ).
tff(c_428,plain,
cons(sk5,nil) = sk1,
inference(demodulation,[status(thm),theory(equality)],[c_384,c_418]) ).
tff(c_1857,plain,
! [V_479,W_480] :
( memberP(cons(V_479,W_480),V_479)
| ~ ssItem(V_479)
| ~ ssList(W_480) ),
inference(cnfTransformation,[status(thm)],[f_898]) ).
tff(c_1860,plain,
( memberP(sk1,sk5)
| ~ ssItem(sk5)
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_428,c_1857]) ).
tff(c_1862,plain,
memberP(sk1,sk5),
inference(demodulation,[status(thm),theory(equality)],[c_16,c_420,c_1860]) ).
tff(c_2037,plain,
memberP(nil,sk5),
inference(demodulation,[status(thm),theory(equality)],[c_2031,c_1862]) ).
tff(c_142,plain,
! [U_65] :
( ~ ssItem(U_65)
| ~ memberP(nil,U_65) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_2083,plain,
~ ssItem(sk5),
inference(resolution,[status(thm)],[c_2037,c_142]) ).
tff(c_2087,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_420,c_2083]) ).
tff(c_2088,plain,
~ rearsegP(sk2,sk1),
inference(splitRight,[status(thm)],[c_424]) ).
tff(c_400,plain,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1684]) ).
tff(c_417,plain,
( ~ neq(sk2,nil)
| ssList(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_400]) ).
tff(c_426,plain,
ssList(sk6),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_417]) ).
tff(c_378,plain,
ssList(sk4),
inference(cnfTransformation,[status(thm)],[f_1648]) ).
tff(c_430,plain,
ssList(sk2),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_378]) ).
tff(c_404,plain,
( ~ neq(sk4,nil)
| ( app(sk6,cons(sk5,nil)) = sk4 ) ),
inference(cnfTransformation,[status(thm)],[f_1692]) ).
tff(c_415,plain,
( ~ neq(sk2,nil)
| ( app(sk6,cons(sk5,nil)) = sk2 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_404]) ).
tff(c_422,plain,
app(sk6,cons(sk5,nil)) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_384,c_415]) ).
tff(c_429,plain,
app(sk6,sk1) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_428,c_422]) ).
tff(c_5755,plain,
! [U_762,V_763] :
( rearsegP(app(U_762,V_763),V_763)
| ~ ssList(app(U_762,V_763))
| ~ ssList(V_763)
| ~ ssList(U_762) ),
inference(cnfTransformation,[status(thm)],[f_961]) ).
tff(c_5889,plain,
( rearsegP(sk2,sk1)
| ~ ssList(app(sk6,sk1))
| ~ ssList(sk1)
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_429,c_5755]) ).
tff(c_5976,plain,
rearsegP(sk2,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_426,c_431,c_430,c_429,c_5889]) ).
tff(c_5978,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2088,c_5976]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC106-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.15 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.36 % Computer : n017.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 20:46:06 EDT 2023
% 0.14/0.36 % CPUTime :
% 11.80/3.80 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.80/3.82
% 11.80/3.82 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 11.80/3.85
% 11.80/3.85 Inference rules
% 11.80/3.85 ----------------------
% 11.80/3.85 #Ref : 0
% 11.80/3.85 #Sup : 1234
% 11.80/3.85 #Fact : 0
% 11.80/3.85 #Define : 0
% 11.80/3.85 #Split : 7
% 11.80/3.85 #Chain : 0
% 11.80/3.85 #Close : 0
% 11.80/3.85
% 11.80/3.85 Ordering : KBO
% 11.80/3.85
% 11.80/3.85 Simplification rules
% 11.80/3.85 ----------------------
% 11.80/3.85 #Subsume : 46
% 11.80/3.85 #Demod : 979
% 11.80/3.85 #Tautology : 393
% 11.80/3.85 #SimpNegUnit : 9
% 11.80/3.85 #BackRed : 72
% 11.80/3.85
% 11.80/3.85 #Partial instantiations: 0
% 11.80/3.85 #Strategies tried : 1
% 11.80/3.85
% 11.80/3.85 Timing (in seconds)
% 11.80/3.85 ----------------------
% 11.80/3.85 Preprocessing : 0.89
% 11.80/3.85 Parsing : 0.44
% 11.80/3.85 CNF conversion : 0.07
% 11.80/3.85 Main loop : 1.86
% 11.80/3.85 Inferencing : 0.58
% 11.80/3.86 Reduction : 0.72
% 11.80/3.86 Demodulation : 0.50
% 11.80/3.86 BG Simplification : 0.08
% 11.80/3.86 Subsumption : 0.33
% 11.80/3.86 Abstraction : 0.05
% 11.80/3.86 MUC search : 0.00
% 11.80/3.86 Cooper : 0.00
% 11.80/3.86 Total : 2.81
% 11.80/3.86 Index Insertion : 0.00
% 11.80/3.86 Index Deletion : 0.00
% 11.80/3.86 Index Matching : 0.00
% 11.80/3.86 BG Taut test : 0.00
%------------------------------------------------------------------------------