TSTP Solution File: GEO020-2 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO020-2 : 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 : 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 10:37:55 EDT 2023

% Result   : Unsatisfiable 3.35s 1.85s
% Output   : CNFRefutation 3.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   28 (  10 unt;  14 typ;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   14 (   8   ~;   6   |;   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    :   12 (  12 usr;   7 con; 0-6 aty)
%            Number of variables   :   24 (;  24   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > #nlpp > 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(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_226,axiom,
    ~ equidistant(x,w,u,v),
    file(unknown,unknown) ).

tff(f_224,axiom,
    equidistant(u,v,w,x),
    file(unknown,unknown) ).

tff(f_58,axiom,
    ! [X,Y] : equidistant(X,Y,Y,X),
    file(unknown,unknown) ).

tff(f_67,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_40,plain,
    ~ equidistant(x,w,u,v),
    inference(cnfTransformation,[status(thm)],[f_226]) ).

tff(c_38,plain,
    equidistant(u,v,w,x),
    inference(cnfTransformation,[status(thm)],[f_224]) ).

tff(c_2,plain,
    ! [X_1,Y_2] : equidistant(X_1,Y_2,Y_2,X_1),
    inference(cnfTransformation,[status(thm)],[f_58]) ).

tff(c_85,plain,
    ! [V_94,V2_95,X_99,W_98,Y_97,Z_96] :
      ( equidistant(Z_96,V_94,V2_95,W_98)
      | ~ equidistant(X_99,Y_97,V2_95,W_98)
      | ~ equidistant(X_99,Y_97,Z_96,V_94) ),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_98,plain,
    ! [Z_100,V_101,Y_102,X_103] :
      ( equidistant(Z_100,V_101,Y_102,X_103)
      | ~ equidistant(X_103,Y_102,Z_100,V_101) ),
    inference(resolution,[status(thm)],[c_2,c_85]) ).

tff(c_111,plain,
    equidistant(w,x,v,u),
    inference(resolution,[status(thm)],[c_38,c_98]) ).

tff(c_96,plain,
    ! [Z_96,V_94,Y_2,X_1] :
      ( equidistant(Z_96,V_94,Y_2,X_1)
      | ~ equidistant(X_1,Y_2,Z_96,V_94) ),
    inference(resolution,[status(thm)],[c_2,c_85]) ).

tff(c_136,plain,
    equidistant(v,u,x,w),
    inference(resolution,[status(thm)],[c_111,c_96]) ).

tff(c_139,plain,
    equidistant(x,w,u,v),
    inference(resolution,[status(thm)],[c_136,c_96]) ).

tff(c_145,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_40,c_139]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO020-2 : TPTP v8.1.2. Released v1.0.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.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Fri Aug  4 00:12:22 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 3.35/1.85  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.52/1.86  
% 3.52/1.86  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.54/1.90  
% 3.54/1.90  Inference rules
% 3.54/1.90  ----------------------
% 3.54/1.90  #Ref     : 0
% 3.54/1.90  #Sup     : 24
% 3.54/1.90  #Fact    : 0
% 3.54/1.90  #Define  : 0
% 3.54/1.90  #Split   : 0
% 3.54/1.90  #Chain   : 0
% 3.54/1.90  #Close   : 0
% 3.54/1.90  
% 3.54/1.90  Ordering : KBO
% 3.54/1.90  
% 3.54/1.90  Simplification rules
% 3.54/1.90  ----------------------
% 3.54/1.90  #Subsume      : 0
% 3.54/1.90  #Demod        : 2
% 3.54/1.90  #Tautology    : 8
% 3.54/1.90  #SimpNegUnit  : 1
% 3.54/1.90  #BackRed      : 0
% 3.54/1.90  
% 3.54/1.90  #Partial instantiations: 0
% 3.54/1.90  #Strategies tried      : 1
% 3.54/1.90  
% 3.54/1.90  Timing (in seconds)
% 3.54/1.90  ----------------------
% 3.54/1.90  Preprocessing        : 0.55
% 3.54/1.90  Parsing              : 0.29
% 3.54/1.90  CNF conversion       : 0.03
% 3.54/1.90  Main loop            : 0.28
% 3.54/1.90  Inferencing          : 0.10
% 3.54/1.90  Reduction            : 0.08
% 3.54/1.90  Demodulation         : 0.05
% 3.54/1.90  BG Simplification    : 0.03
% 3.54/1.90  Subsumption          : 0.07
% 3.54/1.90  Abstraction          : 0.01
% 3.54/1.90  MUC search           : 0.00
% 3.54/1.90  Cooper               : 0.00
% 3.54/1.90  Total                : 0.88
% 3.54/1.90  Index Insertion      : 0.00
% 3.54/1.90  Index Deletion       : 0.00
% 3.54/1.90  Index Matching       : 0.00
% 3.54/1.90  BG Taut test         : 0.00
%------------------------------------------------------------------------------