TSTP Solution File: SWC182-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC182-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 : n006.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:30 EDT 2023
% Result : Unsatisfiable 31.26s 16.94s
% Output : CNFRefutation 31.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 90
% Syntax : Number of formulae : 135 ( 32 unt; 75 typ; 0 def)
% Number of atoms : 123 ( 27 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 137 ( 74 ~; 63 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 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 : 56 ( 56 usr; 10 con; 0-2 aty)
% Number of variables : 33 (; 33 !; 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 > sk7 > 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(sk7,type,
sk7: $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_1652,axiom,
ssItem(sk5),
file(unknown,unknown) ).
tff(f_1649,axiom,
nil = sk3,
file(unknown,unknown) ).
tff(f_1647,axiom,
ssList(sk3),
file(unknown,unknown) ).
tff(f_437,axiom,
! [U,V] :
( ( cons(U,V) != nil )
| ~ ssItem(U)
| ~ ssList(V) ),
file(unknown,unknown) ).
tff(f_342,axiom,
! [U,V] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
file(unknown,unknown) ).
tff(f_1653,axiom,
ssList(sk6),
file(unknown,unknown) ).
tff(f_334,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| ssList(app(V,U)) ),
file(unknown,unknown) ).
tff(f_1654,axiom,
ssList(sk7),
file(unknown,unknown) ).
tff(f_245,axiom,
! [U] :
( ~ ssList(U)
| ( app(U,nil) = U ) ),
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(f_770,axiom,
! [U,V] :
( ~ rearsegP(U,V)
| ~ rearsegP(V,U)
| ~ ssList(U)
| ~ ssList(V)
| ( V = U ) ),
file(unknown,unknown) ).
tff(f_1651,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1655,axiom,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file(unknown,unknown) ).
tff(f_1371,axiom,
! [U,V,W,X] :
( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(X)
| segmentP(X,V) ),
file(unknown,unknown) ).
tff(f_294,axiom,
! [U] :
( ~ segmentP(nil,U)
| ~ ssList(U)
| ( nil = U ) ),
file(unknown,unknown) ).
tff(c_386,plain,
ssItem(sk5),
inference(cnfTransformation,[status(thm)],[f_1652]) ).
tff(c_380,plain,
sk3 = nil,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_376,plain,
ssList(sk3),
inference(cnfTransformation,[status(thm)],[f_1647]) ).
tff(c_398,plain,
ssList(nil),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_376]) ).
tff(c_1321,plain,
! [V_451,U_452] :
( ~ ssList(V_451)
| ~ ssItem(U_452)
| ( cons(U_452,V_451) != nil ) ),
inference(cnfTransformation,[status(thm)],[f_437]) ).
tff(c_2507,plain,
! [U_568] :
( ~ ssItem(U_568)
| ( cons(U_568,nil) != nil ) ),
inference(resolution,[status(thm)],[c_398,c_1321]) ).
tff(c_2583,plain,
cons(sk5,nil) != nil,
inference(resolution,[status(thm)],[c_386,c_2507]) ).
tff(c_172,plain,
! [U_82,V_83] :
( ssList(cons(U_82,V_83))
| ~ ssList(V_83)
| ~ ssItem(U_82) ),
inference(cnfTransformation,[status(thm)],[f_342]) ).
tff(c_388,plain,
ssList(sk6),
inference(cnfTransformation,[status(thm)],[f_1653]) ).
tff(c_170,plain,
! [V_81,U_80] :
( ssList(app(V_81,U_80))
| ~ ssList(V_81)
| ~ ssList(U_80) ),
inference(cnfTransformation,[status(thm)],[f_334]) ).
tff(c_390,plain,
ssList(sk7),
inference(cnfTransformation,[status(thm)],[f_1654]) ).
tff(c_616,plain,
! [U_393] :
( ( app(U_393,nil) = U_393 )
| ~ ssList(U_393) ),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_741,plain,
app(sk7,nil) = sk7,
inference(resolution,[status(thm)],[c_390,c_616]) ).
tff(c_3760,plain,
! [U_642,V_643] :
( rearsegP(app(U_642,V_643),V_643)
| ~ ssList(app(U_642,V_643))
| ~ ssList(V_643)
| ~ ssList(U_642) ),
inference(cnfTransformation,[status(thm)],[f_961]) ).
tff(c_3876,plain,
( rearsegP(sk7,nil)
| ~ ssList(app(sk7,nil))
| ~ ssList(nil)
| ~ ssList(sk7) ),
inference(superposition,[status(thm),theory(equality)],[c_741,c_3760]) ).
tff(c_3966,plain,
rearsegP(sk7,nil),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_398,c_390,c_741,c_3876]) ).
tff(c_256,plain,
! [V_155,U_154] :
( ( V_155 = U_154 )
| ~ ssList(V_155)
| ~ ssList(U_154)
| ~ rearsegP(V_155,U_154)
| ~ rearsegP(U_154,V_155) ),
inference(cnfTransformation,[status(thm)],[f_770]) ).
tff(c_4033,plain,
( ( sk7 = nil )
| ~ ssList(sk7)
| ~ ssList(nil)
| ~ rearsegP(nil,sk7) ),
inference(resolution,[status(thm)],[c_3966,c_256]) ).
tff(c_4036,plain,
( ( sk7 = nil )
| ~ rearsegP(nil,sk7) ),
inference(demodulation,[status(thm),theory(equality)],[c_398,c_390,c_4033]) ).
tff(c_6251,plain,
~ rearsegP(nil,sk7),
inference(splitLeft,[status(thm)],[c_4036]) ).
tff(c_384,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1651]) ).
tff(c_395,plain,
sk1 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_380,c_384]) ).
tff(c_392,plain,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
inference(cnfTransformation,[status(thm)],[f_1655]) ).
tff(c_396,plain,
app(app(sk6,cons(sk5,nil)),sk7) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_395,c_392]) ).
tff(c_3870,plain,
( rearsegP(nil,sk7)
| ~ ssList(app(app(sk6,cons(sk5,nil)),sk7))
| ~ ssList(sk7)
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(superposition,[status(thm),theory(equality)],[c_396,c_3760]) ).
tff(c_3962,plain,
( rearsegP(nil,sk7)
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_398,c_396,c_3870]) ).
tff(c_15424,plain,
~ ssList(app(sk6,cons(sk5,nil))),
inference(negUnitSimplification,[status(thm)],[c_6251,c_3962]) ).
tff(c_15427,plain,
( ~ ssList(sk6)
| ~ ssList(cons(sk5,nil)) ),
inference(resolution,[status(thm)],[c_170,c_15424]) ).
tff(c_15430,plain,
~ ssList(cons(sk5,nil)),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_15427]) ).
tff(c_15433,plain,
( ~ ssList(nil)
| ~ ssItem(sk5) ),
inference(resolution,[status(thm)],[c_172,c_15430]) ).
tff(c_15437,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_386,c_398,c_15433]) ).
tff(c_15438,plain,
sk7 = nil,
inference(splitRight,[status(thm)],[c_4036]) ).
tff(c_15484,plain,
app(app(sk6,cons(sk5,nil)),nil) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_15438,c_396]) ).
tff(c_346,plain,
! [U_265,V_266,W_267] :
( segmentP(app(app(U_265,V_266),W_267),V_266)
| ~ ssList(app(app(U_265,V_266),W_267))
| ~ ssList(V_266)
| ~ ssList(U_265)
| ~ ssList(W_267) ),
inference(cnfTransformation,[status(thm)],[f_1371]) ).
tff(c_23558,plain,
( segmentP(nil,cons(sk5,nil))
| ~ ssList(app(app(sk6,cons(sk5,nil)),nil))
| ~ ssList(cons(sk5,nil))
| ~ ssList(sk6)
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_15484,c_346]) ).
tff(c_23611,plain,
( segmentP(nil,cons(sk5,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(demodulation,[status(thm),theory(equality)],[c_398,c_388,c_398,c_15484,c_23558]) ).
tff(c_40896,plain,
~ ssList(cons(sk5,nil)),
inference(splitLeft,[status(thm)],[c_23611]) ).
tff(c_40899,plain,
( ~ ssList(nil)
| ~ ssItem(sk5) ),
inference(resolution,[status(thm)],[c_172,c_40896]) ).
tff(c_40903,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_386,c_398,c_40899]) ).
tff(c_40905,plain,
ssList(cons(sk5,nil)),
inference(splitRight,[status(thm)],[c_23611]) ).
tff(c_40904,plain,
segmentP(nil,cons(sk5,nil)),
inference(splitRight,[status(thm)],[c_23611]) ).
tff(c_160,plain,
! [U_75] :
( ( nil = U_75 )
| ~ ssList(U_75)
| ~ segmentP(nil,U_75) ),
inference(cnfTransformation,[status(thm)],[f_294]) ).
tff(c_41088,plain,
( ( cons(sk5,nil) = nil )
| ~ ssList(cons(sk5,nil)) ),
inference(resolution,[status(thm)],[c_40904,c_160]) ).
tff(c_41098,plain,
cons(sk5,nil) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_40905,c_41088]) ).
tff(c_41100,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2583,c_41098]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC182-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/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.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 21:21:58 EDT 2023
% 0.14/0.35 % CPUTime :
% 31.26/16.94 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 31.26/16.95
% 31.26/16.95 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 31.26/16.98
% 31.26/16.98 Inference rules
% 31.26/16.98 ----------------------
% 31.26/16.98 #Ref : 0
% 31.26/16.98 #Sup : 8958
% 31.26/16.98 #Fact : 0
% 31.26/16.98 #Define : 0
% 31.26/16.98 #Split : 43
% 31.26/16.98 #Chain : 0
% 31.26/16.98 #Close : 0
% 31.26/16.98
% 31.26/16.98 Ordering : KBO
% 31.26/16.98
% 31.26/16.98 Simplification rules
% 31.26/16.98 ----------------------
% 31.26/16.98 #Subsume : 1824
% 31.26/16.98 #Demod : 10228
% 31.26/16.98 #Tautology : 2746
% 31.26/16.98 #SimpNegUnit : 112
% 31.26/16.98 #BackRed : 164
% 31.26/16.98
% 31.26/16.98 #Partial instantiations: 0
% 31.26/16.98 #Strategies tried : 1
% 31.26/16.98
% 31.26/16.98 Timing (in seconds)
% 31.26/16.98 ----------------------
% 31.26/16.98 Preprocessing : 0.86
% 31.26/16.98 Parsing : 0.45
% 31.26/16.98 CNF conversion : 0.06
% 31.26/16.98 Main loop : 15.06
% 31.26/16.98 Inferencing : 3.18
% 31.26/16.98 Reduction : 7.43
% 31.26/16.98 Demodulation : 5.63
% 31.26/16.98 BG Simplification : 0.12
% 31.26/16.98 Subsumption : 3.37
% 31.26/16.98 Abstraction : 0.16
% 31.26/16.99 MUC search : 0.00
% 31.26/16.99 Cooper : 0.00
% 31.26/16.99 Total : 15.98
% 31.26/16.99 Index Insertion : 0.00
% 31.26/16.99 Index Deletion : 0.00
% 31.26/16.99 Index Matching : 0.00
% 31.26/16.99 BG Taut test : 0.00
%------------------------------------------------------------------------------