TSTP Solution File: GEO022-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO022-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/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 : n023.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:56 EDT 2023
% Result : Unsatisfiable 4.26s 2.05s
% Output : CNFRefutation 4.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 22
% Syntax : Number of formulae : 33 ( 10 unt; 16 typ; 0 def)
% Number of atoms : 26 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 7 >; 25 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-6 aty)
% Number of variables : 30 (; 30 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > #nlpp > z > 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(z,type,
z: $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_263,axiom,
~ equidistant(u,v,y,z),
file(unknown,unknown) ).
tff(f_260,axiom,
equidistant(u,v,w,x),
file(unknown,unknown) ).
tff(f_244,axiom,
! [U,V,W,X] :
( ~ equidistant(U,V,W,X)
| equidistant(V,U,X,W) ),
file(unknown,unknown) ).
tff(f_259,axiom,
! [U,V,W,X] :
( ~ equidistant(U,V,W,X)
| equidistant(X,W,V,U) ),
file(unknown,unknown) ).
tff(f_261,axiom,
equidistant(w,x,y,z),
file(unknown,unknown) ).
tff(f_66,axiom,
! [W,Z,X,Y,V,V2] :
( ~ equidistant(X,Y,Z,V)
| ~ equidistant(X,Y,V2,W)
| equidistant(Z,V,V2,W) ),
file(unknown,unknown) ).
tff(c_58,plain,
~ equidistant(u,v,y,z),
inference(cnfTransformation,[status(thm)],[f_263]) ).
tff(c_54,plain,
equidistant(u,v,w,x),
inference(cnfTransformation,[status(thm)],[f_260]) ).
tff(c_215,plain,
! [V_138,U_139,X_140,W_141] :
( equidistant(V_138,U_139,X_140,W_141)
| ~ equidistant(U_139,V_138,W_141,X_140) ),
inference(cnfTransformation,[status(thm)],[f_244]) ).
tff(c_257,plain,
equidistant(v,u,x,w),
inference(resolution,[status(thm)],[c_54,c_215]) ).
tff(c_52,plain,
! [X_101,W_100,V_99,U_98] :
( equidistant(X_101,W_100,V_99,U_98)
| ~ equidistant(U_98,V_99,W_100,X_101) ),
inference(cnfTransformation,[status(thm)],[f_259]) ).
tff(c_272,plain,
equidistant(w,x,u,v),
inference(resolution,[status(thm)],[c_257,c_52]) ).
tff(c_56,plain,
equidistant(w,x,y,z),
inference(cnfTransformation,[status(thm)],[f_261]) ).
tff(c_683,plain,
! [W_162,X_163,Z_160,Y_161,V_158,V2_159] :
( equidistant(Z_160,V_158,V2_159,W_162)
| ~ equidistant(X_163,Y_161,V2_159,W_162)
| ~ equidistant(X_163,Y_161,Z_160,V_158) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_1030,plain,
! [Z_219,V_220] :
( equidistant(Z_219,V_220,y,z)
| ~ equidistant(w,x,Z_219,V_220) ),
inference(resolution,[status(thm)],[c_56,c_683]) ).
tff(c_1041,plain,
equidistant(u,v,y,z),
inference(resolution,[status(thm)],[c_272,c_1030]) ).
tff(c_1063,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_58,c_1041]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GEO022-3 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % 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.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri Aug 4 00:55:37 EDT 2023
% 0.21/0.36 % CPUTime :
% 4.26/2.05 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.26/2.06
% 4.26/2.06 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.56/2.10
% 4.56/2.10 Inference rules
% 4.56/2.10 ----------------------
% 4.56/2.10 #Ref : 0
% 4.56/2.10 #Sup : 254
% 4.56/2.10 #Fact : 0
% 4.56/2.10 #Define : 0
% 4.56/2.10 #Split : 0
% 4.56/2.10 #Chain : 0
% 4.56/2.10 #Close : 0
% 4.56/2.10
% 4.56/2.10 Ordering : KBO
% 4.56/2.10
% 4.56/2.10 Simplification rules
% 4.56/2.10 ----------------------
% 4.56/2.10 #Subsume : 2
% 4.56/2.10 #Demod : 178
% 4.56/2.10 #Tautology : 184
% 4.56/2.10 #SimpNegUnit : 1
% 4.56/2.10 #BackRed : 0
% 4.56/2.10
% 4.56/2.10 #Partial instantiations: 0
% 4.56/2.10 #Strategies tried : 1
% 4.56/2.10
% 4.56/2.10 Timing (in seconds)
% 4.56/2.10 ----------------------
% 4.56/2.10 Preprocessing : 0.51
% 4.56/2.10 Parsing : 0.28
% 4.56/2.10 CNF conversion : 0.03
% 4.56/2.10 Main loop : 0.51
% 4.56/2.10 Inferencing : 0.18
% 4.56/2.10 Reduction : 0.16
% 4.56/2.10 Demodulation : 0.11
% 4.56/2.10 BG Simplification : 0.03
% 4.56/2.10 Subsumption : 0.12
% 4.56/2.10 Abstraction : 0.02
% 4.56/2.10 MUC search : 0.00
% 4.56/2.10 Cooper : 0.00
% 4.56/2.10 Total : 1.08
% 4.56/2.10 Index Insertion : 0.00
% 4.56/2.10 Index Deletion : 0.00
% 4.56/2.10 Index Matching : 0.00
% 4.56/2.10 BG Taut test : 0.00
%------------------------------------------------------------------------------