TSTP Solution File: GEO019-3 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO019-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 : n006.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.05s 1.70s
% Output   : CNFRefutation 3.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   25 (   7 unt;  14 typ;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   10 (   6   ~;   4   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 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   :   16 (;  16   !;   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_238,axiom,
    ~ equidistant(w,x,v,u),
    file(unknown,unknown) ).

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

tff(f_235,axiom,
    ! [U,V,W,X] :
      ( ~ equidistant(U,V,W,X)
      | equidistant(V,U,W,X) ),
    file(unknown,unknown) ).

tff(f_230,axiom,
    ! [U,V,W,X] :
      ( ~ equidistant(U,V,W,X)
      | equidistant(W,X,U,V) ),
    file(unknown,unknown) ).

tff(c_46,plain,
    ~ equidistant(w,x,v,u),
    inference(cnfTransformation,[status(thm)],[f_238]) ).

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

tff(c_98,plain,
    ! [V_106,U_107,W_108,X_109] :
      ( equidistant(V_106,U_107,W_108,X_109)
      | ~ equidistant(U_107,V_106,W_108,X_109) ),
    inference(cnfTransformation,[status(thm)],[f_235]) ).

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

tff(c_40,plain,
    ! [W_76,X_77,U_74,V_75] :
      ( equidistant(W_76,X_77,U_74,V_75)
      | ~ equidistant(U_74,V_75,W_76,X_77) ),
    inference(cnfTransformation,[status(thm)],[f_230]) ).

tff(c_137,plain,
    equidistant(w,x,v,u),
    inference(resolution,[status(thm)],[c_116,c_40]) ).

tff(c_143,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_46,c_137]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GEO019-3 : TPTP v8.1.2. Released v1.0.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.15/0.35  % Computer : n006.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Fri Aug  4 00:26:28 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 3.05/1.70  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.05/1.70  
% 3.05/1.70  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.22/1.73  
% 3.22/1.73  Inference rules
% 3.22/1.73  ----------------------
% 3.22/1.73  #Ref     : 0
% 3.22/1.73  #Sup     : 21
% 3.22/1.73  #Fact    : 0
% 3.22/1.73  #Define  : 0
% 3.22/1.73  #Split   : 0
% 3.22/1.73  #Chain   : 0
% 3.22/1.73  #Close   : 0
% 3.22/1.73  
% 3.22/1.73  Ordering : KBO
% 3.22/1.73  
% 3.22/1.73  Simplification rules
% 3.22/1.73  ----------------------
% 3.22/1.73  #Subsume      : 0
% 3.22/1.73  #Demod        : 6
% 3.22/1.73  #Tautology    : 12
% 3.22/1.73  #SimpNegUnit  : 1
% 3.22/1.73  #BackRed      : 0
% 3.22/1.73  
% 3.22/1.73  #Partial instantiations: 0
% 3.22/1.73  #Strategies tried      : 1
% 3.22/1.73  
% 3.22/1.73  Timing (in seconds)
% 3.22/1.73  ----------------------
% 3.22/1.74  Preprocessing        : 0.46
% 3.22/1.74  Parsing              : 0.25
% 3.22/1.74  CNF conversion       : 0.03
% 3.22/1.74  Main loop            : 0.22
% 3.22/1.74  Inferencing          : 0.07
% 3.22/1.74  Reduction            : 0.07
% 3.22/1.74  Demodulation         : 0.05
% 3.22/1.74  BG Simplification    : 0.02
% 3.22/1.74  Subsumption          : 0.05
% 3.22/1.74  Abstraction          : 0.01
% 3.22/1.74  MUC search           : 0.00
% 3.22/1.74  Cooper               : 0.00
% 3.22/1.74  Total                : 0.72
% 3.22/1.74  Index Insertion      : 0.00
% 3.22/1.74  Index Deletion       : 0.00
% 3.22/1.74  Index Matching       : 0.00
% 3.22/1.74  BG Taut test         : 0.00
%------------------------------------------------------------------------------