TSTP Solution File: SWC025-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC025-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 : n011.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:48 EDT 2023
% Result : Unsatisfiable 19.72s 7.90s
% Output : CNFRefutation 19.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 85
% Syntax : Number of formulae : 125 ( 24 unt; 72 typ; 0 def)
% Number of atoms : 111 ( 31 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 111 ( 53 ~; 58 |; 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 : 53 ( 53 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 > 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_62,axiom,
! [U] : ssItem(skaf83(U)),
file(unknown,unknown) ).
tff(f_1683,axiom,
( ( nil != sk1 )
| ( nil != sk2 ) ),
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1647,axiom,
ssList(sk3),
file(unknown,unknown) ).
tff(f_64,axiom,
! [U] : ssList(skaf82(U)),
file(unknown,unknown) ).
tff(f_543,axiom,
! [U] :
( ~ ssList(U)
| ( cons(skaf83(U),skaf82(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_1670,axiom,
( ( nil = sk2 )
| ( nil = sk1 ) ),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1659,axiom,
! [A] :
( ~ ssItem(A)
| memberP(sk4,A)
| ~ memberP(sk3,A) ),
file(unknown,unknown) ).
tff(f_233,axiom,
! [U] :
( ~ memberP(nil,U)
| ~ ssItem(U) ),
file(unknown,unknown) ).
tff(f_1648,axiom,
ssList(sk4),
file(unknown,unknown) ).
tff(f_1667,axiom,
! [A] :
( ~ ssItem(A)
| memberP(sk3,A)
| ~ memberP(sk4,A) ),
file(unknown,unknown) ).
tff(c_24,plain,
! [U_1] : ssItem(skaf83(U_1)),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_396,plain,
( ( sk2 != nil )
| ( sk1 != nil ) ),
inference(cnfTransformation,[status(thm)],[f_1683]) ).
tff(c_454,plain,
sk1 != nil,
inference(splitLeft,[status(thm)],[c_396]) ).
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_403,plain,
ssList(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_376]) ).
tff(c_26,plain,
! [U_2] : ssList(skaf82(U_2)),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_3002,plain,
! [U_605] :
( ( nil = U_605 )
| ( cons(skaf83(U_605),skaf82(U_605)) = U_605 )
| ~ ssList(U_605) ),
inference(cnfTransformation,[status(thm)],[f_543]) ).
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_3014,plain,
! [U_605] :
( memberP(U_605,skaf83(U_605))
| ~ ssItem(skaf83(U_605))
| ~ ssList(skaf82(U_605))
| ( nil = U_605 )
| ~ ssList(U_605) ),
inference(superposition,[status(thm),theory(equality)],[c_3002,c_276]) ).
tff(c_10752,plain,
! [U_1095] :
( memberP(U_1095,skaf83(U_1095))
| ( nil = U_1095 )
| ~ ssList(U_1095) ),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_24,c_3014]) ).
tff(c_390,plain,
( ( sk1 = nil )
| ( sk2 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1670]) ).
tff(c_455,plain,
sk2 = nil,
inference(negUnitSimplification,[status(thm)],[c_454,c_390]) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_386,plain,
! [A_327] :
( ~ memberP(sk3,A_327)
| memberP(sk4,A_327)
| ~ ssItem(A_327) ),
inference(cnfTransformation,[status(thm)],[f_1659]) ).
tff(c_399,plain,
! [A_327] :
( ~ memberP(sk1,A_327)
| memberP(sk4,A_327)
| ~ ssItem(A_327) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_386]) ).
tff(c_401,plain,
! [A_327] :
( ~ memberP(sk1,A_327)
| memberP(sk2,A_327)
| ~ ssItem(A_327) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_399]) ).
tff(c_1719,plain,
! [A_327] :
( ~ memberP(sk1,A_327)
| memberP(nil,A_327)
| ~ ssItem(A_327) ),
inference(demodulation,[status(thm),theory(equality)],[c_455,c_401]) ).
tff(c_10764,plain,
( memberP(nil,skaf83(sk1))
| ~ ssItem(skaf83(sk1))
| ( sk1 = nil )
| ~ ssList(sk1) ),
inference(resolution,[status(thm)],[c_10752,c_1719]) ).
tff(c_10777,plain,
( memberP(nil,skaf83(sk1))
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_403,c_24,c_10764]) ).
tff(c_10778,plain,
memberP(nil,skaf83(sk1)),
inference(negUnitSimplification,[status(thm)],[c_454,c_10777]) ).
tff(c_142,plain,
! [U_65] :
( ~ ssItem(U_65)
| ~ memberP(nil,U_65) ),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_10786,plain,
~ ssItem(skaf83(sk1)),
inference(resolution,[status(thm)],[c_10778,c_142]) ).
tff(c_10790,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_10786]) ).
tff(c_10791,plain,
sk2 != nil,
inference(splitRight,[status(thm)],[c_396]) ).
tff(c_378,plain,
ssList(sk4),
inference(cnfTransformation,[status(thm)],[f_1648]) ).
tff(c_402,plain,
ssList(sk2),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_378]) ).
tff(c_13066,plain,
! [U_1299] :
( ( nil = U_1299 )
| ( cons(skaf83(U_1299),skaf82(U_1299)) = U_1299 )
| ~ ssList(U_1299) ),
inference(cnfTransformation,[status(thm)],[f_543]) ).
tff(c_13075,plain,
! [U_1299] :
( memberP(U_1299,skaf83(U_1299))
| ~ ssItem(skaf83(U_1299))
| ~ ssList(skaf82(U_1299))
| ( nil = U_1299 )
| ~ ssList(U_1299) ),
inference(superposition,[status(thm),theory(equality)],[c_13066,c_276]) ).
tff(c_21203,plain,
! [U_1834] :
( memberP(U_1834,skaf83(U_1834))
| ( nil = U_1834 )
| ~ ssList(U_1834) ),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_24,c_13075]) ).
tff(c_10792,plain,
sk1 = nil,
inference(splitRight,[status(thm)],[c_396]) ).
tff(c_388,plain,
! [A_328] :
( ~ memberP(sk4,A_328)
| memberP(sk3,A_328)
| ~ ssItem(A_328) ),
inference(cnfTransformation,[status(thm)],[f_1667]) ).
tff(c_398,plain,
! [A_328] :
( ~ memberP(sk4,A_328)
| memberP(sk1,A_328)
| ~ ssItem(A_328) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_388]) ).
tff(c_400,plain,
! [A_328] :
( ~ memberP(sk2,A_328)
| memberP(sk1,A_328)
| ~ ssItem(A_328) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_398]) ).
tff(c_12035,plain,
! [A_328] :
( ~ memberP(sk2,A_328)
| memberP(nil,A_328)
| ~ ssItem(A_328) ),
inference(demodulation,[status(thm),theory(equality)],[c_10792,c_400]) ).
tff(c_21215,plain,
( memberP(nil,skaf83(sk2))
| ~ ssItem(skaf83(sk2))
| ( sk2 = nil )
| ~ ssList(sk2) ),
inference(resolution,[status(thm)],[c_21203,c_12035]) ).
tff(c_21228,plain,
( memberP(nil,skaf83(sk2))
| ( sk2 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_402,c_24,c_21215]) ).
tff(c_21229,plain,
memberP(nil,skaf83(sk2)),
inference(negUnitSimplification,[status(thm)],[c_10791,c_21228]) ).
tff(c_21236,plain,
~ ssItem(skaf83(sk2)),
inference(resolution,[status(thm)],[c_21229,c_142]) ).
tff(c_21240,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_24,c_21236]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWC025-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 : n011.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:24:36 EDT 2023
% 0.14/0.37 % CPUTime :
% 19.72/7.90 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 19.72/7.91
% 19.72/7.91 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 19.72/7.94
% 19.72/7.94 Inference rules
% 19.72/7.94 ----------------------
% 19.72/7.94 #Ref : 0
% 19.72/7.94 #Sup : 4495
% 19.72/7.94 #Fact : 0
% 19.72/7.94 #Define : 0
% 19.72/7.94 #Split : 7
% 19.72/7.94 #Chain : 0
% 19.72/7.94 #Close : 0
% 19.72/7.94
% 19.72/7.94 Ordering : KBO
% 19.72/7.94
% 19.72/7.94 Simplification rules
% 19.72/7.94 ----------------------
% 19.72/7.94 #Subsume : 344
% 19.72/7.94 #Demod : 5024
% 19.72/7.94 #Tautology : 1149
% 19.72/7.94 #SimpNegUnit : 15
% 19.72/7.94 #BackRed : 5
% 19.72/7.94
% 19.72/7.94 #Partial instantiations: 0
% 19.72/7.94 #Strategies tried : 1
% 19.72/7.94
% 19.72/7.94 Timing (in seconds)
% 19.72/7.94 ----------------------
% 19.72/7.95 Preprocessing : 0.86
% 19.72/7.95 Parsing : 0.44
% 19.72/7.95 CNF conversion : 0.07
% 19.72/7.95 Main loop : 6.01
% 19.72/7.95 Inferencing : 1.51
% 19.72/7.95 Reduction : 2.81
% 19.72/7.95 Demodulation : 2.20
% 19.72/7.95 BG Simplification : 0.11
% 19.72/7.95 Subsumption : 1.25
% 19.72/7.95 Abstraction : 0.10
% 19.72/7.95 MUC search : 0.00
% 19.72/7.95 Cooper : 0.00
% 19.72/7.95 Total : 6.92
% 19.72/7.95 Index Insertion : 0.00
% 19.72/7.95 Index Deletion : 0.00
% 19.72/7.95 Index Matching : 0.00
% 19.72/7.95 BG Taut test : 0.00
%------------------------------------------------------------------------------