TSTP Solution File: SWC242-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC242-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 : n032.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:45 EDT 2023
% Result : Unsatisfiable 16.48s 5.71s
% Output : CNFRefutation 16.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 86
% Syntax : Number of formulae : 112 ( 12 unt; 76 typ; 0 def)
% Number of atoms : 89 ( 27 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 99 ( 46 ~; 53 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 85 ( 66 >; 19 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 57 ( 57 usr; 10 con; 0-3 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ segmentP > rearsegP > neq > memberP > lt > leq > gt > geq > frontsegP > totalorderedP > totalorderP > strictorderedP > strictorderP > ssList > ssItem > singletonP > equalelemsP > duplicatefreeP > cyclefreeP > sk5 > 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 > sk8 > sk7 > 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(sk5,type,
sk5: ( $i * $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(sk8,type,
sk8: $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(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,
nil != sk1,
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1726,axiom,
( ( nil = sk3 )
| ssItem(sk6) ),
file(unknown,unknown) ).
tff(f_1729,axiom,
( ( nil = sk3 )
| ssList(sk7) ),
file(unknown,unknown) ).
tff(f_1732,axiom,
( ( nil = sk3 )
| ssList(sk8) ),
file(unknown,unknown) ).
tff(f_1735,axiom,
( ( nil = sk3 )
| ( app(app(sk7,cons(sk6,nil)),sk8) = sk3 ) ),
file(unknown,unknown) ).
tff(f_1666,axiom,
! [A,B,C] :
( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk1 )
| ssItem(sk5(C,B,A)) ),
file(unknown,unknown) ).
tff(f_1708,axiom,
! [A,B,C] :
( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk1 )
| lt(A,sk5(C,B,A)) ),
file(unknown,unknown) ).
tff(f_485,axiom,
! [U,V] :
( ~ lt(U,V)
| ~ ssItem(V)
| ~ ssItem(U)
| leq(U,V) ),
file(unknown,unknown) ).
tff(f_1723,axiom,
! [A,B,C] :
( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk1 )
| ~ leq(A,sk5(C,B,A)) ),
file(unknown,unknown) ).
tff(c_384,plain,
sk1 != nil,
inference(cnfTransformation,[status(thm)],[f_1652]) ).
tff(c_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_396,plain,
( ssItem(sk6)
| ( sk3 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1726]) ).
tff(c_409,plain,
( ssItem(sk6)
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_396]) ).
tff(c_414,plain,
ssItem(sk6),
inference(negUnitSimplification,[status(thm)],[c_384,c_409]) ).
tff(c_398,plain,
( ssList(sk7)
| ( sk3 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1729]) ).
tff(c_408,plain,
( ssList(sk7)
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_398]) ).
tff(c_413,plain,
ssList(sk7),
inference(negUnitSimplification,[status(thm)],[c_384,c_408]) ).
tff(c_400,plain,
( ssList(sk8)
| ( sk3 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1732]) ).
tff(c_405,plain,
( ssList(sk8)
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_400]) ).
tff(c_410,plain,
ssList(sk8),
inference(negUnitSimplification,[status(thm)],[c_384,c_405]) ).
tff(c_402,plain,
( ( app(app(sk7,cons(sk6,nil)),sk8) = sk3 )
| ( sk3 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1735]) ).
tff(c_406,plain,
( ( app(app(sk7,cons(sk6,nil)),sk8) = sk1 )
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_382,c_402]) ).
tff(c_411,plain,
app(app(sk7,cons(sk6,nil)),sk8) = sk1,
inference(negUnitSimplification,[status(thm)],[c_384,c_406]) ).
tff(c_8715,plain,
! [C_885,B_886,A_887] :
( ssItem(sk5(C_885,B_886,A_887))
| ( app(app(B_886,cons(A_887,nil)),C_885) != sk1 )
| ~ ssList(C_885)
| ~ ssList(B_886)
| ~ ssItem(A_887) ),
inference(cnfTransformation,[status(thm)],[f_1666]) ).
tff(c_8749,plain,
( ssItem(sk5(sk8,sk7,sk6))
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ ssItem(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_411,c_8715]) ).
tff(c_8760,plain,
ssItem(sk5(sk8,sk7,sk6)),
inference(demodulation,[status(thm),theory(equality)],[c_414,c_413,c_410,c_8749]) ).
tff(c_9930,plain,
! [A_929,C_930,B_931] :
( lt(A_929,sk5(C_930,B_931,A_929))
| ( app(app(B_931,cons(A_929,nil)),C_930) != sk1 )
| ~ ssList(C_930)
| ~ ssList(B_931)
| ~ ssItem(A_929) ),
inference(cnfTransformation,[status(thm)],[f_1708]) ).
tff(c_9955,plain,
( lt(sk6,sk5(sk8,sk7,sk6))
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ ssItem(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_411,c_9930]) ).
tff(c_9966,plain,
lt(sk6,sk5(sk8,sk7,sk6)),
inference(demodulation,[status(thm),theory(equality)],[c_414,c_413,c_410,c_9955]) ).
tff(c_206,plain,
! [U_106,V_107] :
( leq(U_106,V_107)
| ~ ssItem(U_106)
| ~ ssItem(V_107)
| ~ lt(U_106,V_107) ),
inference(cnfTransformation,[status(thm)],[f_485]) ).
tff(c_10007,plain,
( leq(sk6,sk5(sk8,sk7,sk6))
| ~ ssItem(sk6)
| ~ ssItem(sk5(sk8,sk7,sk6)) ),
inference(resolution,[status(thm)],[c_9966,c_206]) ).
tff(c_10021,plain,
leq(sk6,sk5(sk8,sk7,sk6)),
inference(demodulation,[status(thm),theory(equality)],[c_8760,c_414,c_10007]) ).
tff(c_394,plain,
! [A_339,C_341,B_340] :
( ~ leq(A_339,sk5(C_341,B_340,A_339))
| ( app(app(B_340,cons(A_339,nil)),C_341) != sk1 )
| ~ ssList(C_341)
| ~ ssList(B_340)
| ~ ssItem(A_339) ),
inference(cnfTransformation,[status(thm)],[f_1723]) ).
tff(c_11311,plain,
( ( app(app(sk7,cons(sk6,nil)),sk8) != sk1 )
| ~ ssList(sk8)
| ~ ssList(sk7)
| ~ ssItem(sk6) ),
inference(resolution,[status(thm)],[c_10021,c_394]) ).
tff(c_11322,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_414,c_413,c_410,c_411,c_11311]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC242-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.11 % 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.12/0.31 % Computer : n032.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Thu Aug 3 21:28:51 EDT 2023
% 0.12/0.32 % CPUTime :
% 16.48/5.71 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.66/5.71
% 16.66/5.71 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 16.66/5.74
% 16.66/5.74 Inference rules
% 16.66/5.74 ----------------------
% 16.66/5.74 #Ref : 0
% 16.66/5.74 #Sup : 2388
% 16.66/5.74 #Fact : 0
% 16.66/5.74 #Define : 0
% 16.66/5.74 #Split : 15
% 16.66/5.74 #Chain : 0
% 16.66/5.74 #Close : 0
% 16.66/5.74
% 16.66/5.74 Ordering : KBO
% 16.66/5.74
% 16.66/5.74 Simplification rules
% 16.66/5.74 ----------------------
% 16.66/5.74 #Subsume : 169
% 16.66/5.74 #Demod : 2598
% 16.66/5.74 #Tautology : 577
% 16.66/5.74 #SimpNegUnit : 10
% 16.66/5.74 #BackRed : 0
% 16.66/5.74
% 16.66/5.74 #Partial instantiations: 0
% 16.66/5.74 #Strategies tried : 1
% 16.66/5.74
% 16.66/5.74 Timing (in seconds)
% 16.66/5.74 ----------------------
% 16.66/5.75 Preprocessing : 0.87
% 16.66/5.75 Parsing : 0.44
% 16.66/5.75 CNF conversion : 0.07
% 16.66/5.75 Main loop : 3.85
% 16.66/5.75 Inferencing : 0.91
% 16.66/5.75 Reduction : 1.88
% 16.66/5.75 Demodulation : 1.43
% 16.66/5.75 BG Simplification : 0.10
% 16.66/5.75 Subsumption : 0.76
% 16.66/5.75 Abstraction : 0.07
% 16.66/5.75 MUC search : 0.00
% 16.66/5.75 Cooper : 0.00
% 16.66/5.75 Total : 4.78
% 16.66/5.75 Index Insertion : 0.00
% 16.66/5.75 Index Deletion : 0.00
% 16.66/5.75 Index Matching : 0.00
% 16.66/5.75 BG Taut test : 0.00
%------------------------------------------------------------------------------