TSTP Solution File: SWC097-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC097-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 : n019.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 7.70s 2.77s
% Output : CNFRefutation 7.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 79
% Syntax : Number of formulae : 94 ( 9 unt; 73 typ; 0 def)
% Number of atoms : 36 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 19 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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 : 54 ( 54 usr; 8 con; 0-2 aty)
% Number of variables : 4 (; 4 !; 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 > 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(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_1684,axiom,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1688,axiom,
( ( app(sk3,cons(sk5,nil)) = sk4 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1680,axiom,
! [A] :
( ~ ssItem(A)
| ( app(sk1,cons(A,nil)) != sk2 )
| ~ neq(sk4,nil) ),
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_396,plain,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1684]) ).
tff(c_405,plain,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_396]) ).
tff(c_410,plain,
ssItem(sk5),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_405]) ).
tff(c_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_398,plain,
( ~ neq(sk4,nil)
| ( app(sk3,cons(sk5,nil)) = sk4 ) ),
inference(cnfTransformation,[status(thm)],[f_1688]) ).
tff(c_403,plain,
( ~ neq(sk4,nil)
| ( app(sk1,cons(sk5,nil)) = sk4 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_398]) ).
tff(c_406,plain,
( ~ neq(sk2,nil)
| ( app(sk1,cons(sk5,nil)) = sk2 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_403]) ).
tff(c_412,plain,
app(sk1,cons(sk5,nil)) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_384,c_406]) ).
tff(c_394,plain,
! [A_328] :
( ~ neq(sk4,nil)
| ( app(sk1,cons(A_328,nil)) != sk2 )
| ~ ssItem(A_328) ),
inference(cnfTransformation,[status(thm)],[f_1680]) ).
tff(c_404,plain,
! [A_328] :
( ~ neq(sk2,nil)
| ( app(sk1,cons(A_328,nil)) != sk2 )
| ~ ssItem(A_328) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_394]) ).
tff(c_1653,plain,
! [A_470] :
( ( app(sk1,cons(A_470,nil)) != sk2 )
| ~ ssItem(A_470) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_404]) ).
tff(c_1656,plain,
~ ssItem(sk5),
inference(superposition,[status(thm),theory(equality)],[c_412,c_1653]) ).
tff(c_1660,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_410,c_1656]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC097-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.36 % Computer : n019.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu Aug 3 21:28:31 EDT 2023
% 0.13/0.36 % CPUTime :
% 7.70/2.77 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.74/2.78
% 7.74/2.78 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.74/2.80
% 7.74/2.80 Inference rules
% 7.74/2.80 ----------------------
% 7.74/2.80 #Ref : 0
% 7.74/2.80 #Sup : 291
% 7.74/2.80 #Fact : 0
% 7.74/2.80 #Define : 0
% 7.74/2.80 #Split : 1
% 7.74/2.80 #Chain : 0
% 7.74/2.80 #Close : 0
% 7.74/2.80
% 7.74/2.80 Ordering : KBO
% 7.74/2.80
% 7.74/2.80 Simplification rules
% 7.74/2.80 ----------------------
% 7.74/2.80 #Subsume : 10
% 7.74/2.80 #Demod : 88
% 7.74/2.80 #Tautology : 82
% 7.74/2.80 #SimpNegUnit : 0
% 7.74/2.80 #BackRed : 0
% 7.74/2.80
% 7.74/2.80 #Partial instantiations: 0
% 7.74/2.80 #Strategies tried : 1
% 7.74/2.80
% 7.74/2.80 Timing (in seconds)
% 7.74/2.80 ----------------------
% 7.74/2.81 Preprocessing : 0.87
% 7.74/2.81 Parsing : 0.45
% 7.74/2.81 CNF conversion : 0.07
% 7.74/2.81 Main loop : 0.74
% 7.74/2.81 Inferencing : 0.21
% 7.74/2.81 Reduction : 0.27
% 7.74/2.81 Demodulation : 0.20
% 7.74/2.81 BG Simplification : 0.06
% 7.74/2.81 Subsumption : 0.14
% 7.74/2.81 Abstraction : 0.03
% 7.74/2.81 MUC search : 0.00
% 7.74/2.81 Cooper : 0.00
% 7.74/2.81 Total : 1.65
% 7.74/2.81 Index Insertion : 0.00
% 7.74/2.81 Index Deletion : 0.00
% 7.74/2.81 Index Matching : 0.00
% 7.74/2.81 BG Taut test : 0.00
%------------------------------------------------------------------------------