TSTP Solution File: SWC008-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC008-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 : n026.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:42 EDT 2023
% Result : Unsatisfiable 63.12s 47.45s
% Output : CNFRefutation 63.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 82
% Syntax : Number of formulae : 104 ( 21 unt; 72 typ; 0 def)
% Number of atoms : 67 ( 21 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 77 ( 42 ~; 35 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 24 (; 24 !; 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_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1648,axiom,
ssList(sk4),
file(unknown,unknown) ).
tff(f_245,axiom,
! [U] :
( ~ ssList(U)
| ( app(U,nil) = U ) ),
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1651,axiom,
frontsegP(sk4,sk3),
file(unknown,unknown) ).
tff(f_1647,axiom,
ssList(sk3),
file(unknown,unknown) ).
tff(f_56,axiom,
ssList(nil),
file(unknown,unknown) ).
tff(f_140,axiom,
! [U,V] : ssList(skaf45(U,V)),
file(unknown,unknown) ).
tff(f_820,axiom,
! [U,V] :
( ~ frontsegP(U,V)
| ~ ssList(V)
| ~ ssList(U)
| ( app(V,skaf45(U,V)) = U ) ),
file(unknown,unknown) ).
tff(f_1667,axiom,
! [A,B,C] :
( ~ ssList(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(A,B),C) != sk2 )
| ( app(A,C) != sk1 ) ),
file(unknown,unknown) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_378,plain,
ssList(sk4),
inference(cnfTransformation,[status(thm)],[f_1648]) ).
tff(c_396,plain,
ssList(sk2),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_378]) ).
tff(c_602,plain,
! [U_399] :
( ( app(U_399,nil) = U_399 )
| ~ ssList(U_399) ),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_722,plain,
app(sk2,nil) = sk2,
inference(resolution,[status(thm)],[c_396,c_602]) ).
tff(c_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_384,plain,
frontsegP(sk4,sk3),
inference(cnfTransformation,[status(thm)],[f_1651]) ).
tff(c_392,plain,
frontsegP(sk4,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_384]) ).
tff(c_394,plain,
frontsegP(sk2,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_392]) ).
tff(c_376,plain,
ssList(sk3),
inference(cnfTransformation,[status(thm)],[f_1647]) ).
tff(c_397,plain,
ssList(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_376]) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_723,plain,
app(sk1,nil) = sk1,
inference(resolution,[status(thm)],[c_397,c_602]) ).
tff(c_102,plain,
! [U_43,V_44] : ssList(skaf45(U_43,V_44)),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_264,plain,
! [V_163,U_162] :
( ( app(V_163,skaf45(U_162,V_163)) = U_162 )
| ~ ssList(U_162)
| ~ ssList(V_163)
| ~ frontsegP(U_162,V_163) ),
inference(cnfTransformation,[status(thm)],[f_820]) ).
tff(c_6544,plain,
! [A_792,C_793,B_794] :
( ( app(A_792,C_793) != sk1 )
| ( app(app(A_792,B_794),C_793) != sk2 )
| ~ ssList(C_793)
| ~ ssList(B_794)
| ~ ssList(A_792) ),
inference(cnfTransformation,[status(thm)],[f_1667]) ).
tff(c_6550,plain,
! [V_163,C_793,U_162] :
( ( app(V_163,C_793) != sk1 )
| ( app(U_162,C_793) != sk2 )
| ~ ssList(C_793)
| ~ ssList(skaf45(U_162,V_163))
| ~ ssList(V_163)
| ~ ssList(U_162)
| ~ ssList(V_163)
| ~ frontsegP(U_162,V_163) ),
inference(superposition,[status(thm),theory(equality)],[c_264,c_6544]) ).
tff(c_73751,plain,
! [V_4393,C_4394,U_4395] :
( ( app(V_4393,C_4394) != sk1 )
| ( app(U_4395,C_4394) != sk2 )
| ~ ssList(C_4394)
| ~ ssList(U_4395)
| ~ ssList(V_4393)
| ~ frontsegP(U_4395,V_4393) ),
inference(demodulation,[status(thm),theory(equality)],[c_102,c_6550]) ).
tff(c_73919,plain,
! [U_4395] :
( ( app(U_4395,nil) != sk2 )
| ~ ssList(nil)
| ~ ssList(U_4395)
| ~ ssList(sk1)
| ~ frontsegP(U_4395,sk1) ),
inference(superposition,[status(thm),theory(equality)],[c_723,c_73751]) ).
tff(c_76124,plain,
! [U_4484] :
( ( app(U_4484,nil) != sk2 )
| ~ ssList(U_4484)
| ~ frontsegP(U_4484,sk1) ),
inference(demodulation,[status(thm),theory(equality)],[c_397,c_16,c_73919]) ).
tff(c_76266,plain,
( ( app(sk2,nil) != sk2 )
| ~ ssList(sk2) ),
inference(resolution,[status(thm)],[c_394,c_76124]) ).
tff(c_76376,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_396,c_722,c_76266]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC008-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/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.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 21:59:32 EDT 2023
% 0.14/0.35 % CPUTime :
% 63.12/47.45 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 63.12/47.46
% 63.12/47.46 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 63.12/47.49
% 63.12/47.49 Inference rules
% 63.12/47.49 ----------------------
% 63.12/47.49 #Ref : 9
% 63.12/47.49 #Sup : 18907
% 63.12/47.49 #Fact : 0
% 63.12/47.49 #Define : 0
% 63.12/47.49 #Split : 19
% 63.12/47.49 #Chain : 0
% 63.12/47.49 #Close : 0
% 63.12/47.49
% 63.12/47.49 Ordering : KBO
% 63.12/47.49
% 63.12/47.49 Simplification rules
% 63.12/47.49 ----------------------
% 63.12/47.49 #Subsume : 3648
% 63.12/47.49 #Demod : 13890
% 63.12/47.49 #Tautology : 3129
% 63.12/47.49 #SimpNegUnit : 221
% 63.12/47.49 #BackRed : 15
% 63.12/47.49
% 63.12/47.49 #Partial instantiations: 0
% 63.12/47.49 #Strategies tried : 1
% 63.12/47.49
% 63.12/47.49 Timing (in seconds)
% 63.12/47.49 ----------------------
% 63.12/47.49 Preprocessing : 0.92
% 63.12/47.49 Parsing : 0.49
% 63.12/47.49 CNF conversion : 0.07
% 63.12/47.49 Main loop : 45.35
% 63.12/47.49 Inferencing : 7.44
% 63.12/47.49 Reduction : 21.06
% 63.12/47.49 Demodulation : 15.03
% 63.12/47.49 BG Simplification : 0.20
% 63.12/47.49 Subsumption : 13.56
% 63.12/47.49 Abstraction : 0.38
% 63.12/47.49 MUC search : 0.00
% 63.12/47.49 Cooper : 0.00
% 63.12/47.50 Total : 46.33
% 63.12/47.50 Index Insertion : 0.00
% 63.12/47.50 Index Deletion : 0.00
% 63.12/47.50 Index Matching : 0.00
% 63.12/47.50 BG Taut test : 0.00
%------------------------------------------------------------------------------