TSTP Solution File: SWC098-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC098-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 : 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:01:08 EDT 2023
% Result : Unsatisfiable 114.50s 99.29s
% Output : CNFRefutation 114.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 91
% Syntax : Number of formulae : 148 ( 27 unt; 74 typ; 0 def)
% Number of atoms : 162 ( 78 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 171 ( 83 ~; 88 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 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 : 55 ( 55 usr; 8 con; 0-2 aty)
% Number of variables : 21 (; 21 !; 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 > sk6 > 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(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_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1706,axiom,
( ssItem(sk6)
| ( nil = sk3 ) ),
file(unknown,unknown) ).
tff(f_1728,axiom,
( ( cons(sk6,nil) = sk3 )
| ( nil = sk3 ) ),
file(unknown,unknown) ).
tff(f_1700,axiom,
( ( nil != sk2 )
| ( nil != sk1 ) ),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1712,axiom,
( memberP(sk4,sk6)
| ( nil = sk4 ) ),
file(unknown,unknown) ).
tff(f_1661,axiom,
! [A] :
( ~ ssItem(A)
| ( cons(A,nil) != sk1 )
| ssItem(sk5(A))
| ~ memberP(sk2,A) ),
file(unknown,unknown) ).
tff(f_1695,axiom,
! [A] :
( ~ ssItem(A)
| ( cons(A,nil) != sk1 )
| ( A != sk5(A) )
| ~ memberP(sk2,A) ),
file(unknown,unknown) ).
tff(f_1683,axiom,
! [A] :
( ~ ssItem(A)
| ( cons(A,nil) != sk1 )
| leq(A,sk5(A))
| ~ memberP(sk2,A) ),
file(unknown,unknown) ).
tff(f_1672,axiom,
! [A] :
( ~ ssItem(A)
| ( cons(A,nil) != sk1 )
| memberP(sk2,sk5(A))
| ~ memberP(sk2,A) ),
file(unknown,unknown) ).
tff(f_56,axiom,
ssList(nil),
file(unknown,unknown) ).
tff(f_446,axiom,
! [U,V] :
( ( cons(U,V) != V )
| ~ ssItem(U)
| ~ ssList(V) ),
file(unknown,unknown) ).
tff(f_1744,axiom,
! [A] :
( ~ ssItem(A)
| ( sk6 = A )
| ~ memberP(sk4,A)
| ~ leq(sk6,A)
| ( nil = sk3 ) ),
file(unknown,unknown) ).
tff(f_1709,axiom,
( ( cons(sk6,nil) = sk3 )
| ( nil = sk4 ) ),
file(unknown,unknown) ).
tff(f_1703,axiom,
( ssItem(sk6)
| ( nil = sk4 ) ),
file(unknown,unknown) ).
tff(f_1731,axiom,
( memberP(sk4,sk6)
| ( nil = sk3 ) ),
file(unknown,unknown) ).
tff(f_233,axiom,
! [U] :
( ~ memberP(nil,U)
| ~ ssItem(U) ),
file(unknown,unknown) ).
tff(c_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_396,plain,
( ( sk3 = nil )
| ssItem(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1706]) ).
tff(c_409,plain,
( ( sk1 = nil )
| ssItem(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_396]) ).
tff(c_473,plain,
ssItem(sk6),
inference(splitLeft,[status(thm)],[c_409]) ).
tff(c_404,plain,
( ( sk3 = nil )
| ( cons(sk6,nil) = sk3 ) ),
inference(cnfTransformation,[status(thm)],[f_1728]) ).
tff(c_413,plain,
( ( sk1 = nil )
| ( cons(sk6,nil) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_382,c_404]) ).
tff(c_496,plain,
cons(sk6,nil) = sk1,
inference(splitLeft,[status(thm)],[c_413]) ).
tff(c_392,plain,
( ( sk1 != nil )
| ( sk2 != nil ) ),
inference(cnfTransformation,[status(thm)],[f_1700]) ).
tff(c_472,plain,
sk2 != nil,
inference(splitLeft,[status(thm)],[c_392]) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_400,plain,
( ( sk4 = nil )
| memberP(sk4,sk6) ),
inference(cnfTransformation,[status(thm)],[f_1712]) ).
tff(c_417,plain,
( ( sk2 = nil )
| memberP(sk2,sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_400]) ).
tff(c_489,plain,
memberP(sk2,sk6),
inference(negUnitSimplification,[status(thm)],[c_472,c_417]) ).
tff(c_384,plain,
! [A_327] :
( ~ memberP(sk2,A_327)
| ssItem(sk5(A_327))
| ( cons(A_327,nil) != sk1 )
| ~ ssItem(A_327) ),
inference(cnfTransformation,[status(thm)],[f_1661]) ).
tff(c_3357,plain,
! [A_623] :
( ~ memberP(sk2,A_623)
| ( sk5(A_623) != A_623 )
| ( cons(A_623,nil) != sk1 )
| ~ ssItem(A_623) ),
inference(cnfTransformation,[status(thm)],[f_1695]) ).
tff(c_3360,plain,
( ( sk5(sk6) != sk6 )
| ( cons(sk6,nil) != sk1 )
| ~ ssItem(sk6) ),
inference(resolution,[status(thm)],[c_489,c_3357]) ).
tff(c_3363,plain,
sk5(sk6) != sk6,
inference(demodulation,[status(thm),theory(equality)],[c_473,c_496,c_3360]) ).
tff(c_388,plain,
! [A_329] :
( ~ memberP(sk2,A_329)
| leq(A_329,sk5(A_329))
| ( cons(A_329,nil) != sk1 )
| ~ ssItem(A_329) ),
inference(cnfTransformation,[status(thm)],[f_1683]) ).
tff(c_4447,plain,
! [A_686] :
( ~ memberP(sk2,A_686)
| memberP(sk2,sk5(A_686))
| ( cons(A_686,nil) != sk1 )
| ~ ssItem(A_686) ),
inference(cnfTransformation,[status(thm)],[f_1672]) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_1110,plain,
! [V_451,U_452] :
( ~ ssList(V_451)
| ~ ssItem(U_452)
| ( cons(U_452,V_451) != V_451 ) ),
inference(cnfTransformation,[status(thm)],[f_446]) ).
tff(c_1706,plain,
! [U_471] :
( ~ ssItem(U_471)
| ( cons(U_471,nil) != nil ) ),
inference(resolution,[status(thm)],[c_16,c_1110]) ).
tff(c_1712,plain,
cons(sk6,nil) != nil,
inference(resolution,[status(thm)],[c_473,c_1706]) ).
tff(c_1766,plain,
sk1 != nil,
inference(demodulation,[status(thm),theory(equality)],[c_496,c_1712]) ).
tff(c_408,plain,
! [A_332] :
( ( sk3 = nil )
| ~ leq(sk6,A_332)
| ~ memberP(sk4,A_332)
| ( sk6 = A_332 )
| ~ ssItem(A_332) ),
inference(cnfTransformation,[status(thm)],[f_1744]) ).
tff(c_411,plain,
! [A_332] :
( ( sk1 = nil )
| ~ leq(sk6,A_332)
| ~ memberP(sk4,A_332)
| ( sk6 = A_332 )
| ~ ssItem(A_332) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_408]) ).
tff(c_419,plain,
! [A_332] :
( ( sk1 = nil )
| ~ leq(sk6,A_332)
| ~ memberP(sk2,A_332)
| ( sk6 = A_332 )
| ~ ssItem(A_332) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_411]) ).
tff(c_3858,plain,
! [A_332] :
( ~ leq(sk6,A_332)
| ~ memberP(sk2,A_332)
| ( sk6 = A_332 )
| ~ ssItem(A_332) ),
inference(negUnitSimplification,[status(thm)],[c_1766,c_419]) ).
tff(c_150034,plain,
! [A_4638] :
( ~ leq(sk6,sk5(A_4638))
| ( sk5(A_4638) = sk6 )
| ~ ssItem(sk5(A_4638))
| ~ memberP(sk2,A_4638)
| ( cons(A_4638,nil) != sk1 )
| ~ ssItem(A_4638) ),
inference(resolution,[status(thm)],[c_4447,c_3858]) ).
tff(c_150047,plain,
( ( sk5(sk6) = sk6 )
| ~ ssItem(sk5(sk6))
| ~ memberP(sk2,sk6)
| ( cons(sk6,nil) != sk1 )
| ~ ssItem(sk6) ),
inference(resolution,[status(thm)],[c_388,c_150034]) ).
tff(c_150058,plain,
( ( sk5(sk6) = sk6 )
| ~ ssItem(sk5(sk6)) ),
inference(demodulation,[status(thm),theory(equality)],[c_473,c_496,c_489,c_150047]) ).
tff(c_150059,plain,
~ ssItem(sk5(sk6)),
inference(negUnitSimplification,[status(thm)],[c_3363,c_150058]) ).
tff(c_150065,plain,
( ~ memberP(sk2,sk6)
| ( cons(sk6,nil) != sk1 )
| ~ ssItem(sk6) ),
inference(resolution,[status(thm)],[c_384,c_150059]) ).
tff(c_150069,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_473,c_496,c_489,c_150065]) ).
tff(c_150070,plain,
sk1 = nil,
inference(splitRight,[status(thm)],[c_413]) ).
tff(c_150071,plain,
cons(sk6,nil) != sk1,
inference(splitRight,[status(thm)],[c_413]) ).
tff(c_150084,plain,
cons(sk6,nil) != nil,
inference(demodulation,[status(thm),theory(equality)],[c_150070,c_150071]) ).
tff(c_398,plain,
( ( sk4 = nil )
| ( cons(sk6,nil) = sk3 ) ),
inference(cnfTransformation,[status(thm)],[f_1709]) ).
tff(c_412,plain,
( ( sk4 = nil )
| ( cons(sk6,nil) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_398]) ).
tff(c_415,plain,
( ( sk2 = nil )
| ( cons(sk6,nil) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_412]) ).
tff(c_150331,plain,
( ( sk2 = nil )
| ( cons(sk6,nil) = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_150070,c_415]) ).
tff(c_150332,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_150084,c_472,c_150331]) ).
tff(c_150334,plain,
~ ssItem(sk6),
inference(splitRight,[status(thm)],[c_409]) ).
tff(c_394,plain,
( ( sk4 = nil )
| ssItem(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1703]) ).
tff(c_414,plain,
( ( sk2 = nil )
| ssItem(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_394]) ).
tff(c_150348,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_150334,c_472,c_414]) ).
tff(c_150349,plain,
sk1 != nil,
inference(splitRight,[status(thm)],[c_392]) ).
tff(c_150362,plain,
ssItem(sk6),
inference(negUnitSimplification,[status(thm)],[c_150349,c_409]) ).
tff(c_150350,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_392]) ).
tff(c_406,plain,
( ( sk3 = nil )
| memberP(sk4,sk6) ),
inference(cnfTransformation,[status(thm)],[f_1731]) ).
tff(c_410,plain,
( ( sk1 = nil )
| memberP(sk4,sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_406]) ).
tff(c_418,plain,
( ( sk1 = nil )
| memberP(sk2,sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_410]) ).
tff(c_150377,plain,
( ( sk1 = nil )
| memberP(nil,sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_150350,c_418]) ).
tff(c_150378,plain,
memberP(nil,sk6),
inference(negUnitSimplification,[status(thm)],[c_150349,c_150377]) ).
tff(c_150379,plain,
! [U_4671] :
( ~ ssItem(U_4671)
| ~ memberP(nil,U_4671) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_150382,plain,
~ ssItem(sk6),
inference(resolution,[status(thm)],[c_150378,c_150379]) ).
tff(c_150386,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_150362,c_150382]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC098-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/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.17/0.35 % Computer : n014.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 21:42:03 EDT 2023
% 0.17/0.35 % CPUTime :
% 114.50/99.29 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 114.50/99.30
% 114.50/99.30 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 114.50/99.34
% 114.50/99.34 Inference rules
% 114.50/99.34 ----------------------
% 114.50/99.34 #Ref : 0
% 114.50/99.34 #Sup : 34584
% 114.50/99.34 #Fact : 0
% 114.50/99.34 #Define : 0
% 114.50/99.34 #Split : 25
% 114.50/99.34 #Chain : 0
% 114.50/99.34 #Close : 0
% 114.50/99.34
% 114.50/99.34 Ordering : KBO
% 114.50/99.34
% 114.50/99.34 Simplification rules
% 114.50/99.34 ----------------------
% 114.50/99.34 #Subsume : 8067
% 114.50/99.34 #Demod : 38938
% 114.50/99.34 #Tautology : 6758
% 114.50/99.34 #SimpNegUnit : 2821
% 114.50/99.34 #BackRed : 59
% 114.50/99.34
% 114.50/99.34 #Partial instantiations: 0
% 114.50/99.34 #Strategies tried : 1
% 114.50/99.34
% 114.50/99.34 Timing (in seconds)
% 114.50/99.34 ----------------------
% 114.50/99.35 Preprocessing : 0.85
% 114.50/99.35 Parsing : 0.43
% 114.50/99.35 CNF conversion : 0.07
% 114.50/99.35 Main loop : 97.34
% 114.50/99.35 Inferencing : 11.95
% 114.50/99.35 Reduction : 51.47
% 114.50/99.35 Demodulation : 40.36
% 114.50/99.35 BG Simplification : 0.27
% 114.50/99.35 Subsumption : 27.19
% 114.50/99.35 Abstraction : 0.63
% 114.50/99.35 MUC search : 0.00
% 114.50/99.35 Cooper : 0.00
% 114.50/99.35 Total : 98.25
% 114.50/99.35 Index Insertion : 0.00
% 114.50/99.35 Index Deletion : 0.00
% 114.50/99.35 Index Matching : 0.00
% 114.50/99.35 BG Taut test : 0.00
%------------------------------------------------------------------------------