TSTP Solution File: SWC004-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC004-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 : n031.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:41 EDT 2023
% Result : Unsatisfiable 21.34s 8.49s
% Output : CNFRefutation 21.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 88
% Syntax : Number of formulae : 126 ( 19 unt; 75 typ; 0 def)
% Number of atoms : 114 ( 30 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 136 ( 73 ~; 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 : 25 (; 25 !; 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_1653,axiom,
( neq(sk2,nil)
| neq(sk2,nil) ),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1717,axiom,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_56,axiom,
ssList(nil),
file(unknown,unknown) ).
tff(f_446,axiom,
! [U,V] :
( ( cons(U,V) != V )
| ~ 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_1721,axiom,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1725,axiom,
( ssList(sk7)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1733,axiom,
( ( app(sk6,sk7) = sk3 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1729,axiom,
( ( app(app(sk6,cons(sk5,nil)),sk7) = sk4 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1713,axiom,
! [A,B,C] :
( ~ ssList(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(A,B),C) != sk2 )
| ( app(A,C) != sk1 )
| ~ neq(B,nil)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_456,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ),
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_402,plain,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1717]) ).
tff(c_422,plain,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_402]) ).
tff(c_432,plain,
ssItem(sk5),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_422]) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_1792,plain,
! [V_474,U_475] :
( ~ ssList(V_474)
| ~ ssItem(U_475)
| ( cons(U_475,V_474) != V_474 ) ),
inference(cnfTransformation,[status(thm)],[f_446]) ).
tff(c_2487,plain,
! [U_546] :
( ~ ssItem(U_546)
| ( cons(U_546,nil) != nil ) ),
inference(resolution,[status(thm)],[c_16,c_1792]) ).
tff(c_2563,plain,
cons(sk5,nil) != nil,
inference(resolution,[status(thm)],[c_432,c_2487]) ).
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_404,plain,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(cnfTransformation,[status(thm)],[f_1721]) ).
tff(c_419,plain,
( ~ neq(sk2,nil)
| ssList(sk6) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_404]) ).
tff(c_426,plain,
ssList(sk6),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_419]) ).
tff(c_406,plain,
( ~ neq(sk4,nil)
| ssList(sk7) ),
inference(cnfTransformation,[status(thm)],[f_1725]) ).
tff(c_423,plain,
( ~ neq(sk2,nil)
| ssList(sk7) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_406]) ).
tff(c_434,plain,
ssList(sk7),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_423]) ).
tff(c_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_410,plain,
( ~ neq(sk4,nil)
| ( app(sk6,sk7) = sk3 ) ),
inference(cnfTransformation,[status(thm)],[f_1733]) ).
tff(c_418,plain,
( ~ neq(sk4,nil)
| ( app(sk6,sk7) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_410]) ).
tff(c_420,plain,
( ~ neq(sk2,nil)
| ( app(sk6,sk7) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_418]) ).
tff(c_428,plain,
app(sk6,sk7) = sk1,
inference(demodulation,[status(thm),theory(equality)],[c_384,c_420]) ).
tff(c_408,plain,
( ~ neq(sk4,nil)
| ( app(app(sk6,cons(sk5,nil)),sk7) = sk4 ) ),
inference(cnfTransformation,[status(thm)],[f_1729]) ).
tff(c_424,plain,
( ~ neq(sk2,nil)
| ( app(app(sk6,cons(sk5,nil)),sk7) = sk2 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_408]) ).
tff(c_436,plain,
app(app(sk6,cons(sk5,nil)),sk7) = sk2,
inference(demodulation,[status(thm),theory(equality)],[c_384,c_424]) ).
tff(c_400,plain,
! [B_331,A_330,C_332] :
( ~ neq(sk4,nil)
| ~ neq(B_331,nil)
| ( app(A_330,C_332) != sk1 )
| ( app(app(A_330,B_331),C_332) != sk2 )
| ~ ssList(C_332)
| ~ ssList(B_331)
| ~ ssList(A_330) ),
inference(cnfTransformation,[status(thm)],[f_1713]) ).
tff(c_421,plain,
! [B_331,A_330,C_332] :
( ~ neq(sk2,nil)
| ~ neq(B_331,nil)
| ( app(A_330,C_332) != sk1 )
| ( app(app(A_330,B_331),C_332) != sk2 )
| ~ ssList(C_332)
| ~ ssList(B_331)
| ~ ssList(A_330) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_400]) ).
tff(c_10413,plain,
! [B_895,A_896,C_897] :
( ~ neq(B_895,nil)
| ( app(A_896,C_897) != sk1 )
| ( app(app(A_896,B_895),C_897) != sk2 )
| ~ ssList(C_897)
| ~ ssList(B_895)
| ~ ssList(A_896) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_421]) ).
tff(c_10570,plain,
( ~ neq(cons(sk5,nil),nil)
| ( app(sk6,sk7) != sk1 )
| ~ ssList(sk7)
| ~ ssList(cons(sk5,nil))
| ~ ssList(sk6) ),
inference(superposition,[status(thm),theory(equality)],[c_436,c_10413]) ).
tff(c_10726,plain,
( ~ neq(cons(sk5,nil),nil)
| ~ ssList(cons(sk5,nil)) ),
inference(demodulation,[status(thm),theory(equality)],[c_426,c_434,c_428,c_10570]) ).
tff(c_17584,plain,
~ ssList(cons(sk5,nil)),
inference(splitLeft,[status(thm)],[c_10726]) ).
tff(c_17587,plain,
( ~ ssList(nil)
| ~ ssItem(sk5) ),
inference(resolution,[status(thm)],[c_172,c_17584]) ).
tff(c_17591,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_432,c_16,c_17587]) ).
tff(c_17593,plain,
ssList(cons(sk5,nil)),
inference(splitRight,[status(thm)],[c_10726]) ).
tff(c_200,plain,
! [V_102,U_101] :
( ( V_102 = U_101 )
| neq(V_102,U_101)
| ~ ssList(V_102)
| ~ ssList(U_101) ),
inference(cnfTransformation,[status(thm)],[f_456]) ).
tff(c_17592,plain,
~ neq(cons(sk5,nil),nil),
inference(splitRight,[status(thm)],[c_10726]) ).
tff(c_17703,plain,
( ( cons(sk5,nil) = nil )
| ~ ssList(cons(sk5,nil))
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_200,c_17592]) ).
tff(c_17709,plain,
cons(sk5,nil) = nil,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_17593,c_17703]) ).
tff(c_17711,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2563,c_17709]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : SWC004-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.15 % 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.15/0.37 % Computer : n031.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 21:45:30 EDT 2023
% 0.15/0.37 % CPUTime :
% 21.34/8.49 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.52/8.50
% 21.52/8.50 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 21.52/8.53
% 21.52/8.53 Inference rules
% 21.52/8.53 ----------------------
% 21.52/8.53 #Ref : 0
% 21.52/8.53 #Sup : 3620
% 21.52/8.53 #Fact : 0
% 21.52/8.53 #Define : 0
% 21.52/8.53 #Split : 30
% 21.52/8.53 #Chain : 0
% 21.52/8.53 #Close : 0
% 21.52/8.53
% 21.52/8.53 Ordering : KBO
% 21.52/8.53
% 21.52/8.53 Simplification rules
% 21.52/8.53 ----------------------
% 21.52/8.53 #Subsume : 406
% 21.52/8.53 #Demod : 4342
% 21.52/8.53 #Tautology : 884
% 21.52/8.53 #SimpNegUnit : 63
% 21.52/8.53 #BackRed : 235
% 21.52/8.53
% 21.52/8.53 #Partial instantiations: 0
% 21.52/8.53 #Strategies tried : 1
% 21.52/8.53
% 21.52/8.53 Timing (in seconds)
% 21.52/8.53 ----------------------
% 21.52/8.53 Preprocessing : 0.89
% 21.52/8.53 Parsing : 0.46
% 21.52/8.53 CNF conversion : 0.07
% 21.52/8.53 Main loop : 6.55
% 21.52/8.53 Inferencing : 1.47
% 21.52/8.53 Reduction : 3.16
% 21.52/8.53 Demodulation : 2.36
% 21.52/8.53 BG Simplification : 0.10
% 21.52/8.53 Subsumption : 1.34
% 21.52/8.53 Abstraction : 0.09
% 21.52/8.53 MUC search : 0.00
% 21.52/8.53 Cooper : 0.00
% 21.52/8.53 Total : 7.49
% 21.52/8.53 Index Insertion : 0.00
% 21.52/8.53 Index Deletion : 0.00
% 21.52/8.53 Index Matching : 0.00
% 21.52/8.53 BG Taut test : 0.00
%------------------------------------------------------------------------------