TSTP Solution File: GEG021_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEG021_1 : TPTP v8.1.2. Bugfixed v5.2.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 : n001.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 10:37:49 EDT 2023
% Result : Theorem 2.61s 1.61s
% Output : CNFRefutation 2.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of formulae : 16 ( 6 unt; 9 typ; 0 def)
% Number of atoms : 22 ( 16 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 17 ( 2 ~; 0 |; 14 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 25 ( 5 atm; 1 fun; 19 num; 0 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 8 usr; 20 con; 0-2 aty)
% Number of variables : 8 (; 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
%$ d > #nlpp > saarbruecken > munich > kiel > hamburg > frankfurt > cologne > berlin
%Foreground sorts:
tff(city,type,
city: $tType ).
%Background operators:
%Foreground operators:
tff(munich,type,
munich: city ).
tff(kiel,type,
kiel: city ).
tff(d,type,
d: ( city * city ) > $int ).
tff(frankfurt,type,
frankfurt: city ).
tff(berlin,type,
berlin: city ).
tff(cologne,type,
cologne: city ).
tff(saarbruecken,type,
saarbruecken: city ).
tff(hamburg,type,
hamburg: city ).
tff(f_63,negated_conjecture,
~ ( ( ! [X: city,Y: city] : ( d(X,Y) = d(Y,X) )
& ! [X: city,Y: city,Z: city] : $lesseq(d(X,Z),$sum(d(X,Y),d(Y,Z)))
& ! [X: city] : ( d(X,X) = 0 )
& ( d(berlin,munich) = 510 )
& ( d(berlin,cologne) = 480 )
& ( d(berlin,frankfurt) = 420 )
& ( d(saarbruecken,frankfurt) = 160 )
& ( d(saarbruecken,cologne) = 190 )
& ( d(hamburg,cologne) = 360 )
& ( d(hamburg,frankfurt) = 390 )
& ( d(cologne,frankfurt) = 150 )
& ( d(hamburg,kiel) = 90 )
& ( d(hamburg,berlin) = 250 )
& ( d(munich,frankfurt) = 300 )
& ( d(munich,saarbruecken) = 360 ) )
=> $lesseq(d(cologne,berlin),500) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',city_distance_1) ).
tff(c_39,plain,
d(berlin,cologne) = 480,
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_35,plain,
! [Y_2: city,X_1: city] : ( d(Y_2,X_1) = d(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_2,plain,
~ $lesseq(d(cologne,berlin),500),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_50,plain,
$less(500,d(cologne,berlin)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_51,plain,
$less(500,480),
inference(demodulation,[status(thm),theory(equality)],[c_39,c_35,c_50]) ).
tff(c_53,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEG021_1 : TPTP v8.1.2. Bugfixed v5.2.0.
% 0.00/0.13 % 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.35 % Computer : n001.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Thu Aug 3 20:35:25 EDT 2023
% 0.12/0.35 % CPUTime :
% 2.61/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.61/1.61
% 2.61/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.61/1.63
% 2.61/1.63 Inference rules
% 2.61/1.63 ----------------------
% 2.61/1.63 #Ref : 0
% 2.61/1.63 #Sup : 0
% 2.61/1.63 #Fact : 0
% 2.61/1.63 #Define : 0
% 2.61/1.63 #Split : 0
% 2.61/1.63 #Chain : 0
% 2.61/1.63 #Close : 0
% 2.61/1.63
% 2.61/1.63 Ordering : LPO
% 2.61/1.63
% 2.61/1.63 Simplification rules
% 2.61/1.63 ----------------------
% 2.61/1.63 #Subsume : 15
% 2.61/1.63 #Demod : 2
% 2.61/1.63 #Tautology : 0
% 2.61/1.63 #SimpNegUnit : 0
% 2.61/1.63 #BackRed : 0
% 2.61/1.63
% 2.61/1.63 #Partial instantiations: 0
% 2.61/1.63 #Strategies tried : 1
% 2.61/1.63
% 2.61/1.63 Timing (in seconds)
% 2.61/1.63 ----------------------
% 2.61/1.64 Preprocessing : 0.48
% 2.61/1.64 Parsing : 0.27
% 2.61/1.64 CNF conversion : 0.03
% 2.61/1.64 Main loop : 0.11
% 2.61/1.64 Inferencing : 0.00
% 2.61/1.64 Reduction : 0.06
% 2.61/1.64 Demodulation : 0.05
% 2.61/1.64 BG Simplification : 0.03
% 2.61/1.64 Subsumption : 0.04
% 2.61/1.64 Abstraction : 0.01
% 2.61/1.64 MUC search : 0.00
% 2.61/1.64 Cooper : 0.00
% 2.61/1.64 Total : 0.63
% 2.61/1.64 Index Insertion : 0.00
% 2.61/1.64 Index Deletion : 0.00
% 2.61/1.64 Index Matching : 0.00
% 2.61/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------