TSTP Solution File: SWC365-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC365-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 : n020.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:02:19 EDT 2023
% Result : Unsatisfiable 4.95s 2.09s
% Output : CNFRefutation 5.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 77
% Syntax : Number of formulae : 86 ( 10 unt; 72 typ; 0 def)
% Number of atoms : 18 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 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 : 0 (; 0 !; 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_1653,axiom,
~ rearsegP(sk2,sk1),
file(unknown,unknown) ).
tff(f_1651,axiom,
neq(sk2,nil),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1665,axiom,
( ~ neq(sk4,nil)
| rearsegP(sk4,sk3) ),
file(unknown,unknown) ).
tff(c_386,plain,
~ rearsegP(sk2,sk1),
inference(cnfTransformation,[status(thm)],[f_1653]) ).
tff(c_384,plain,
neq(sk2,nil),
inference(cnfTransformation,[status(thm)],[f_1651]) ).
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_392,plain,
( rearsegP(sk4,sk3)
| ~ neq(sk4,nil) ),
inference(cnfTransformation,[status(thm)],[f_1665]) ).
tff(c_393,plain,
( rearsegP(sk4,sk1)
| ~ neq(sk4,nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_392]) ).
tff(c_396,plain,
( rearsegP(sk2,sk1)
| ~ neq(sk2,nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_393]) ).
tff(c_400,plain,
rearsegP(sk2,sk1),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_396]) ).
tff(c_401,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_386,c_400]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC365-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.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 21:39:22 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.95/2.09 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.12/2.09
% 5.12/2.09 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.12/2.12
% 5.12/2.12 Inference rules
% 5.12/2.12 ----------------------
% 5.12/2.12 #Ref : 0
% 5.12/2.12 #Sup : 0
% 5.12/2.12 #Fact : 0
% 5.12/2.12 #Define : 0
% 5.12/2.12 #Split : 0
% 5.12/2.12 #Chain : 0
% 5.12/2.12 #Close : 0
% 5.12/2.12
% 5.12/2.12 Ordering : KBO
% 5.12/2.12
% 5.12/2.12 Simplification rules
% 5.12/2.12 ----------------------
% 5.12/2.12 #Subsume : 195
% 5.12/2.12 #Demod : 8
% 5.12/2.12 #Tautology : 0
% 5.12/2.12 #SimpNegUnit : 1
% 5.12/2.12 #BackRed : 0
% 5.12/2.12
% 5.12/2.12 #Partial instantiations: 0
% 5.12/2.12 #Strategies tried : 1
% 5.12/2.12
% 5.12/2.12 Timing (in seconds)
% 5.12/2.12 ----------------------
% 5.12/2.12 Preprocessing : 0.95
% 5.12/2.12 Parsing : 0.47
% 5.12/2.12 CNF conversion : 0.08
% 5.12/2.12 Main loop : 0.09
% 5.12/2.12 Inferencing : 0.00
% 5.12/2.12 Reduction : 0.04
% 5.12/2.12 Demodulation : 0.03
% 5.12/2.12 BG Simplification : 0.07
% 5.12/2.12 Subsumption : 0.04
% 5.12/2.12 Abstraction : 0.02
% 5.12/2.12 MUC search : 0.00
% 5.12/2.12 Cooper : 0.00
% 5.12/2.13 Total : 1.09
% 5.12/2.13 Index Insertion : 0.00
% 5.12/2.13 Index Deletion : 0.00
% 5.12/2.13 Index Matching : 0.00
% 5.12/2.13 BG Taut test : 0.00
%------------------------------------------------------------------------------