TSTP Solution File: GEO002-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO002-1 : TPTP v8.1.2. Bugfixed v2.5.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 : n021.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:50 EDT 2023

% Result   : Unsatisfiable 4.50s 2.12s
% Output   : CNFRefutation 4.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   34 (  11 unt;  12 typ;   0 def)
%            Number of atoms       :   39 (   8 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   36 (  19   ~;  17   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 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    :   10 (  10 usr;   5 con; 0-6 aty)
%            Number of variables   :   64 (;  64   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > outer_pasch > euclid2 > euclid1 > extension > #nlpp > lower_dimension_point_3 > lower_dimension_point_2 > lower_dimension_point_1 > b > a

%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(a,type,
    a: $i ).

tff(outer_pasch,type,
    outer_pasch: ( $i * $i * $i * $i * $i ) > $i ).

tff(lower_dimension_point_2,type,
    lower_dimension_point_2: $i ).

tff(equidistant,type,
    equidistant: ( $i * $i * $i * $i ) > $o ).

tff(b,type,
    b: $i ).

tff(lower_dimension_point_3,type,
    lower_dimension_point_3: $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(continuous,type,
    continuous: ( $i * $i * $i * $i * $i * $i ) > $i ).

tff(f_166,axiom,
    ! [Y,X,W,V] : equidistant(Y,extension(X,Y,W,V),W,V),
    file(unknown,unknown) ).

tff(f_86,axiom,
    ! [X,Y,Z] :
      ( ~ equidistant(X,Y,Z,Z)
      | ( X = Y ) ),
    file(unknown,unknown) ).

tff(f_164,axiom,
    ! [X,Y,W,V] : between(X,Y,extension(X,Y,W,V)),
    file(unknown,unknown) ).

tff(f_102,axiom,
    ! [W,Z,X,Y,V] :
      ( ~ between(X,W,V)
      | ~ between(Y,V,Z)
      | between(X,outer_pasch(W,X,Y,Z,V),Y) ),
    file(unknown,unknown) ).

tff(f_59,axiom,
    ! [X,Y] :
      ( ~ between(X,Y,X)
      | ( X = Y ) ),
    file(unknown,unknown) ).

tff(f_110,axiom,
    ! [W,Z,X,Y,V] :
      ( ~ between(X,W,V)
      | ~ between(Y,V,Z)
      | between(Z,W,outer_pasch(W,X,Y,Z,V)) ),
    file(unknown,unknown) ).

tff(f_221,axiom,
    ~ between(a,a,b),
    file(unknown,unknown) ).

tff(c_53,plain,
    ! [Y_91,X_92,W_93,V_94] : equidistant(Y_91,extension(X_92,Y_91,W_93,V_94),W_93,V_94),
    inference(cnfTransformation,[status(thm)],[f_166]) ).

tff(c_10,plain,
    ! [Y_14,X_13,Z_15] :
      ( ( Y_14 = X_13 )
      | ~ equidistant(X_13,Y_14,Z_15,Z_15) ),
    inference(cnfTransformation,[status(thm)],[f_86]) ).

tff(c_63,plain,
    ! [X_99,Y_100,V_101] : ( extension(X_99,Y_100,V_101,V_101) = Y_100 ),
    inference(resolution,[status(thm)],[c_53,c_10]) ).

tff(c_26,plain,
    ! [X_55,Y_56,W_57,V_58] : between(X_55,Y_56,extension(X_55,Y_56,W_57,V_58)),
    inference(cnfTransformation,[status(thm)],[f_164]) ).

tff(c_72,plain,
    ! [X_99,Y_100] : between(X_99,Y_100,Y_100),
    inference(superposition,[status(thm),theory(equality)],[c_63,c_26]) ).

tff(c_154,plain,
    ! [W_136,X_133,Y_134,V_132,Z_135] :
      ( between(X_133,outer_pasch(W_136,X_133,Y_134,Z_135,V_132),Y_134)
      | ~ between(Y_134,V_132,Z_135)
      | ~ between(X_133,W_136,V_132) ),
    inference(cnfTransformation,[status(thm)],[f_102]) ).

tff(c_2,plain,
    ! [Y_2,X_1] :
      ( ( Y_2 = X_1 )
      | ~ between(X_1,Y_2,X_1) ),
    inference(cnfTransformation,[status(thm)],[f_59]) ).

tff(c_1126,plain,
    ! [W_327,Y_328,Z_329,V_330] :
      ( ( outer_pasch(W_327,Y_328,Y_328,Z_329,V_330) = Y_328 )
      | ~ between(Y_328,V_330,Z_329)
      | ~ between(Y_328,W_327,V_330) ),
    inference(resolution,[status(thm)],[c_154,c_2]) ).

tff(c_1148,plain,
    ! [W_331,X_332,Y_333] :
      ( ( outer_pasch(W_331,X_332,X_332,Y_333,Y_333) = X_332 )
      | ~ between(X_332,W_331,Y_333) ),
    inference(resolution,[status(thm)],[c_72,c_1126]) ).

tff(c_1170,plain,
    ! [Y_334,X_335] : ( outer_pasch(Y_334,X_335,X_335,Y_334,Y_334) = X_335 ),
    inference(resolution,[status(thm)],[c_72,c_1148]) ).

tff(c_16,plain,
    ! [W_27,Z_28,X_29,V_31,Y_30] :
      ( between(Z_28,W_27,outer_pasch(W_27,X_29,Y_30,Z_28,V_31))
      | ~ between(Y_30,V_31,Z_28)
      | ~ between(X_29,W_27,V_31) ),
    inference(cnfTransformation,[status(thm)],[f_110]) ).

tff(c_1179,plain,
    ! [Y_334,X_335] :
      ( between(Y_334,Y_334,X_335)
      | ~ between(X_335,Y_334,Y_334)
      | ~ between(X_335,Y_334,Y_334) ),
    inference(superposition,[status(thm),theory(equality)],[c_1170,c_16]) ).

tff(c_1187,plain,
    ! [Y_334,X_335] : between(Y_334,Y_334,X_335),
    inference(demodulation,[status(thm),theory(equality)],[c_72,c_72,c_1179]) ).

tff(c_42,plain,
    ~ between(a,a,b),
    inference(cnfTransformation,[status(thm)],[f_221]) ).

tff(c_1191,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1187,c_42]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GEO002-1 : TPTP v8.1.2. Bugfixed v2.5.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.13/0.35  % Computer : n021.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Fri Aug  4 00:43:22 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 4.50/2.12  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.50/2.12  
% 4.50/2.12  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.50/2.15  
% 4.50/2.15  Inference rules
% 4.50/2.15  ----------------------
% 4.50/2.15  #Ref     : 0
% 4.50/2.15  #Sup     : 270
% 4.50/2.15  #Fact    : 0
% 4.50/2.15  #Define  : 0
% 4.50/2.15  #Split   : 0
% 4.50/2.15  #Chain   : 0
% 4.50/2.15  #Close   : 0
% 4.50/2.15  
% 4.50/2.15  Ordering : KBO
% 4.50/2.15  
% 4.50/2.15  Simplification rules
% 4.50/2.15  ----------------------
% 4.50/2.15  #Subsume      : 3
% 4.50/2.15  #Demod        : 160
% 4.50/2.15  #Tautology    : 119
% 4.50/2.15  #SimpNegUnit  : 0
% 4.50/2.15  #BackRed      : 1
% 4.50/2.15  
% 4.50/2.15  #Partial instantiations: 0
% 4.50/2.15  #Strategies tried      : 1
% 4.50/2.15  
% 4.50/2.15  Timing (in seconds)
% 4.50/2.15  ----------------------
% 4.50/2.16  Preprocessing        : 0.49
% 4.50/2.16  Parsing              : 0.28
% 4.50/2.16  CNF conversion       : 0.03
% 4.50/2.16  Main loop            : 0.59
% 4.50/2.16  Inferencing          : 0.23
% 4.50/2.16  Reduction            : 0.16
% 4.50/2.16  Demodulation         : 0.12
% 4.50/2.16  BG Simplification    : 0.03
% 4.50/2.16  Subsumption          : 0.14
% 4.50/2.16  Abstraction          : 0.03
% 4.50/2.16  MUC search           : 0.00
% 4.50/2.16  Cooper               : 0.00
% 4.50/2.16  Total                : 1.13
% 4.50/2.16  Index Insertion      : 0.00
% 4.50/2.16  Index Deletion       : 0.00
% 4.50/2.16  Index Matching       : 0.00
% 4.50/2.16  BG Taut test         : 0.00
%------------------------------------------------------------------------------