TSTP Solution File: GEO038-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO038-3 : TPTP v8.1.2. Released v1.0.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 : n027.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:59 EDT 2023
% Result : Unsatisfiable 3.38s 1.74s
% Output : CNFRefutation 3.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 18
% Syntax : Number of formulae : 23 ( 8 unt; 15 typ; 0 def)
% Number of atoms : 8 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 7 >; 25 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-6 aty)
% Number of variables : 8 (; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > #nlpp > y > x > w > v > u > lower_dimension_point_3 > lower_dimension_point_2 > lower_dimension_point_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(lower_dimension_point_1,type,
lower_dimension_point_1: $i ).
tff(euclid2,type,
euclid2: ( $i * $i * $i * $i * $i ) > $i ).
tff(x,type,
x: $i ).
tff(lower_dimension_point_2,type,
lower_dimension_point_2: $i ).
tff(w,type,
w: $i ).
tff(equidistant,type,
equidistant: ( $i * $i * $i * $i ) > $o ).
tff(u,type,
u: $i ).
tff(lower_dimension_point_3,type,
lower_dimension_point_3: $i ).
tff(y,type,
y: $i ).
tff(v,type,
v: $i ).
tff(extension,type,
extension: ( $i * $i * $i * $i ) > $i ).
tff(euclid1,type,
euclid1: ( $i * $i * $i * $i * $i ) > $i ).
tff(between,type,
between: ( $i * $i * $i ) > $o ).
tff(inner_pasch,type,
inner_pasch: ( $i * $i * $i * $i * $i ) > $i ).
tff(continuous,type,
continuous: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(f_271,axiom,
~ between(u,v,y),
file(unknown,unknown) ).
tff(f_269,axiom,
y = extension(u,v,w,x),
file(unknown,unknown) ).
tff(f_75,axiom,
! [X,Y,W,V] : between(X,Y,extension(X,Y,W,V)),
file(unknown,unknown) ).
tff(c_60,plain,
~ between(u,v,y),
inference(cnfTransformation,[status(thm)],[f_271]) ).
tff(c_58,plain,
extension(u,v,w,x) = y,
inference(cnfTransformation,[status(thm)],[f_269]) ).
tff(c_90,plain,
! [X_123,Y_124,W_125,V_126] : between(X_123,Y_124,extension(X_123,Y_124,W_125,V_126)),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_93,plain,
between(u,v,y),
inference(superposition,[status(thm),theory(equality)],[c_58,c_90]) ).
tff(c_98,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_60,c_93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO038-3 : TPTP v8.1.2. Released v1.0.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 : n027.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 : Fri Aug 4 00:46:54 EDT 2023
% 0.14/0.34 % CPUTime :
% 3.38/1.74 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.38/1.75
% 3.38/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.38/1.78
% 3.38/1.78 Inference rules
% 3.38/1.78 ----------------------
% 3.38/1.78 #Ref : 0
% 3.38/1.78 #Sup : 8
% 3.38/1.78 #Fact : 0
% 3.38/1.78 #Define : 0
% 3.38/1.78 #Split : 0
% 3.38/1.78 #Chain : 0
% 3.38/1.78 #Close : 0
% 3.38/1.78
% 3.38/1.78 Ordering : KBO
% 3.38/1.78
% 3.38/1.78 Simplification rules
% 3.38/1.78 ----------------------
% 3.38/1.78 #Subsume : 0
% 3.38/1.78 #Demod : 0
% 3.38/1.78 #Tautology : 6
% 3.38/1.78 #SimpNegUnit : 1
% 3.38/1.78 #BackRed : 0
% 3.38/1.78
% 3.38/1.78 #Partial instantiations: 0
% 3.38/1.78 #Strategies tried : 1
% 3.38/1.78
% 3.38/1.78 Timing (in seconds)
% 3.38/1.78 ----------------------
% 3.60/1.78 Preprocessing : 0.51
% 3.60/1.78 Parsing : 0.27
% 3.60/1.78 CNF conversion : 0.03
% 3.60/1.78 Main loop : 0.21
% 3.60/1.78 Inferencing : 0.06
% 3.60/1.78 Reduction : 0.06
% 3.60/1.78 Demodulation : 0.04
% 3.60/1.78 BG Simplification : 0.02
% 3.60/1.78 Subsumption : 0.06
% 3.60/1.78 Abstraction : 0.01
% 3.60/1.78 MUC search : 0.00
% 3.60/1.78 Cooper : 0.00
% 3.60/1.79 Total : 0.77
% 3.60/1.79 Index Insertion : 0.00
% 3.60/1.79 Index Deletion : 0.00
% 3.60/1.79 Index Matching : 0.00
% 3.60/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------