TSTP Solution File: SWC275-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC275-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 : n002.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:53 EDT 2023
% Result : Unsatisfiable 8.67s 2.96s
% Output : CNFRefutation 9.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 84
% Syntax : Number of formulae : 115 ( 25 unt; 73 typ; 0 def)
% Number of atoms : 64 ( 23 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 47 ( 25 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 2 ( 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 : 6 (; 6 !; 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_52,axiom,
totalorderedP(nil),
file(unknown,unknown) ).
tff(f_1652,axiom,
~ totalorderedP(sk1),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1656,axiom,
( ( nil = sk3 )
| ( nil != sk4 ) ),
file(unknown,unknown) ).
tff(f_56,axiom,
ssList(nil),
file(unknown,unknown) ).
tff(f_1648,axiom,
ssList(sk4),
file(unknown,unknown) ).
tff(f_456,axiom,
! [U,V] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ),
file(unknown,unknown) ).
tff(f_1660,axiom,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_1664,axiom,
( ( cons(sk5,nil) = sk3 )
| ~ neq(sk4,nil) ),
file(unknown,unknown) ).
tff(f_212,axiom,
! [U] :
( ~ ssItem(U)
| totalorderedP(cons(U,nil)) ),
file(unknown,unknown) ).
tff(c_8,plain,
totalorderedP(nil),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_384,plain,
~ totalorderedP(sk1),
inference(cnfTransformation,[status(thm)],[f_1652]) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_386,plain,
( ( sk4 != nil )
| ( sk3 = nil ) ),
inference(cnfTransformation,[status(thm)],[f_1656]) ).
tff(c_393,plain,
( ( sk4 != nil )
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_386]) ).
tff(c_397,plain,
( ( sk2 != nil )
| ( sk1 = nil ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_393]) ).
tff(c_451,plain,
sk2 != nil,
inference(splitLeft,[status(thm)],[c_397]) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_378,plain,
ssList(sk4),
inference(cnfTransformation,[status(thm)],[f_1648]) ).
tff(c_399,plain,
ssList(sk2),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_378]) ).
tff(c_2148,plain,
! [V_540,U_541] :
( ( V_540 = U_541 )
| neq(V_540,U_541)
| ~ ssList(V_540)
| ~ ssList(U_541) ),
inference(cnfTransformation,[status(thm)],[f_456]) ).
tff(c_388,plain,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1660]) ).
tff(c_395,plain,
( ~ neq(sk2,nil)
| ssItem(sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_388]) ).
tff(c_465,plain,
~ neq(sk2,nil),
inference(splitLeft,[status(thm)],[c_395]) ).
tff(c_2151,plain,
( ( sk2 = nil )
| ~ ssList(sk2)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_2148,c_465]) ).
tff(c_2162,plain,
sk2 = nil,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_399,c_2151]) ).
tff(c_2164,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_451,c_2162]) ).
tff(c_2165,plain,
ssItem(sk5),
inference(splitRight,[status(thm)],[c_395]) ).
tff(c_2166,plain,
neq(sk2,nil),
inference(splitRight,[status(thm)],[c_395]) ).
tff(c_390,plain,
( ~ neq(sk4,nil)
| ( cons(sk5,nil) = sk3 ) ),
inference(cnfTransformation,[status(thm)],[f_1664]) ).
tff(c_394,plain,
( ~ neq(sk4,nil)
| ( cons(sk5,nil) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_390]) ).
tff(c_398,plain,
( ~ neq(sk2,nil)
| ( cons(sk5,nil) = sk1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_394]) ).
tff(c_2651,plain,
cons(sk5,nil) = sk1,
inference(demodulation,[status(thm),theory(equality)],[c_2166,c_398]) ).
tff(c_134,plain,
! [U_61] :
( totalorderedP(cons(U_61,nil))
| ~ ssItem(U_61) ),
inference(cnfTransformation,[status(thm)],[f_212]) ).
tff(c_2655,plain,
( totalorderedP(sk1)
| ~ ssItem(sk5) ),
inference(superposition,[status(thm),theory(equality)],[c_2651,c_134]) ).
tff(c_2677,plain,
totalorderedP(sk1),
inference(demodulation,[status(thm),theory(equality)],[c_2165,c_2655]) ).
tff(c_2679,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_384,c_2677]) ).
tff(c_2680,plain,
sk1 = nil,
inference(splitRight,[status(thm)],[c_397]) ).
tff(c_2684,plain,
~ totalorderedP(nil),
inference(demodulation,[status(thm),theory(equality)],[c_2680,c_384]) ).
tff(c_2688,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_2684]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWC275-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/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 : n002.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:44:01 EDT 2023
% 0.15/0.37 % CPUTime :
% 8.67/2.96 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.67/2.97
% 8.67/2.97 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.03/3.00
% 9.03/3.00 Inference rules
% 9.03/3.00 ----------------------
% 9.03/3.00 #Ref : 0
% 9.03/3.00 #Sup : 512
% 9.03/3.00 #Fact : 0
% 9.03/3.00 #Define : 0
% 9.03/3.00 #Split : 6
% 9.03/3.00 #Chain : 0
% 9.03/3.00 #Close : 0
% 9.03/3.00
% 9.03/3.00 Ordering : KBO
% 9.03/3.00
% 9.03/3.00 Simplification rules
% 9.03/3.00 ----------------------
% 9.03/3.00 #Subsume : 14
% 9.03/3.00 #Demod : 159
% 9.03/3.00 #Tautology : 151
% 9.03/3.00 #SimpNegUnit : 3
% 9.03/3.00 #BackRed : 3
% 9.03/3.00
% 9.03/3.00 #Partial instantiations: 0
% 9.03/3.00 #Strategies tried : 1
% 9.03/3.00
% 9.03/3.00 Timing (in seconds)
% 9.03/3.00 ----------------------
% 9.03/3.00 Preprocessing : 0.87
% 9.03/3.00 Parsing : 0.44
% 9.03/3.00 CNF conversion : 0.07
% 9.03/3.00 Main loop : 1.04
% 9.03/3.00 Inferencing : 0.34
% 9.03/3.00 Reduction : 0.37
% 9.03/3.00 Demodulation : 0.26
% 9.03/3.00 BG Simplification : 0.07
% 9.03/3.00 Subsumption : 0.19
% 9.03/3.00 Abstraction : 0.03
% 9.03/3.00 MUC search : 0.00
% 9.03/3.00 Cooper : 0.00
% 9.03/3.00 Total : 1.96
% 9.03/3.00 Index Insertion : 0.00
% 9.03/3.00 Index Deletion : 0.00
% 9.03/3.00 Index Matching : 0.00
% 9.03/3.00 BG Taut test : 0.00
%------------------------------------------------------------------------------