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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO001-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/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 : n029.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:49 EDT 2023

% Result   : Unsatisfiable 4.59s 2.22s
% Output   : CNFRefutation 5.32s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   37 (  13 unt;  13 typ;   0 def)
%            Number of atoms       :   41 (   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    :   11 (  11 usr;   6 con; 0-6 aty)
%            Number of variables   :   56 (;  56   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > outer_pasch > euclid2 > euclid1 > extension > #nlpp > lower_dimension_point_3 > lower_dimension_point_2 > lower_dimension_point_1 > c > 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(c,type,
    c: $i ).

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

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

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

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

tff(f_222,axiom,
    between(a,b,c),
    file(unknown,unknown) ).

tff(f_104,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_61,axiom,
    ! [X,Y] :
      ( ~ between(X,Y,X)
      | ( X = Y ) ),
    file(unknown,unknown) ).

tff(f_112,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(c_44,plain,
    ~ between(c,b,a),
    inference(cnfTransformation,[status(thm)],[f_224]) ).

tff(c_55,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_168]) ).

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_88]) ).

tff(c_61,plain,
    ! [X_95,Y_96,V_97] : ( extension(X_95,Y_96,V_97,V_97) = Y_96 ),
    inference(resolution,[status(thm)],[c_55,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_166]) ).

tff(c_70,plain,
    ! [X_95,Y_96] : between(X_95,Y_96,Y_96),
    inference(superposition,[status(thm),theory(equality)],[c_61,c_26]) ).

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

tff(c_249,plain,
    ! [X_149,V_148,W_152,Y_150,Z_151] :
      ( between(X_149,outer_pasch(W_152,X_149,Y_150,Z_151,V_148),Y_150)
      | ~ between(Y_150,V_148,Z_151)
      | ~ between(X_149,W_152,V_148) ),
    inference(cnfTransformation,[status(thm)],[f_104]) ).

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

tff(c_1250,plain,
    ! [W_343,Y_344,Z_345,V_346] :
      ( ( outer_pasch(W_343,Y_344,Y_344,Z_345,V_346) = Y_344 )
      | ~ between(Y_344,V_346,Z_345)
      | ~ between(Y_344,W_343,V_346) ),
    inference(resolution,[status(thm)],[c_249,c_2]) ).

tff(c_1364,plain,
    ! [W_351] :
      ( ( outer_pasch(W_351,a,a,c,b) = a )
      | ~ between(a,W_351,b) ),
    inference(resolution,[status(thm)],[c_42,c_1250]) ).

tff(c_1381,plain,
    outer_pasch(b,a,a,c,b) = a,
    inference(resolution,[status(thm)],[c_70,c_1364]) ).

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_112]) ).

tff(c_1388,plain,
    ( between(c,b,a)
    | ~ between(a,b,c)
    | ~ between(a,b,b) ),
    inference(superposition,[status(thm),theory(equality)],[c_1381,c_16]) ).

tff(c_1394,plain,
    between(c,b,a),
    inference(demodulation,[status(thm),theory(equality)],[c_70,c_42,c_1388]) ).

tff(c_1396,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_44,c_1394]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO001-1 : TPTP v8.1.2. Bugfixed v2.5.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.35  % Computer : n029.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:58:22 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 4.59/2.22  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.59/2.22  
% 4.59/2.22  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.32/2.25  
% 5.32/2.25  Inference rules
% 5.32/2.25  ----------------------
% 5.32/2.25  #Ref     : 0
% 5.32/2.25  #Sup     : 312
% 5.32/2.25  #Fact    : 2
% 5.32/2.25  #Define  : 0
% 5.32/2.25  #Split   : 2
% 5.32/2.25  #Chain   : 0
% 5.32/2.25  #Close   : 0
% 5.32/2.25  
% 5.32/2.25  Ordering : KBO
% 5.32/2.25  
% 5.32/2.25  Simplification rules
% 5.32/2.25  ----------------------
% 5.32/2.26  #Subsume      : 5
% 5.32/2.26  #Demod        : 205
% 5.32/2.26  #Tautology    : 137
% 5.32/2.26  #SimpNegUnit  : 1
% 5.32/2.26  #BackRed      : 3
% 5.32/2.26  
% 5.32/2.26  #Partial instantiations: 0
% 5.32/2.26  #Strategies tried      : 1
% 5.32/2.26  
% 5.32/2.26  Timing (in seconds)
% 5.32/2.26  ----------------------
% 5.32/2.26  Preprocessing        : 0.52
% 5.32/2.26  Parsing              : 0.29
% 5.32/2.26  CNF conversion       : 0.03
% 5.32/2.26  Main loop            : 0.67
% 5.32/2.26  Inferencing          : 0.25
% 5.32/2.26  Reduction            : 0.19
% 5.32/2.26  Demodulation         : 0.14
% 5.32/2.26  BG Simplification    : 0.03
% 5.32/2.26  Subsumption          : 0.16
% 5.32/2.26  Abstraction          : 0.03
% 5.32/2.26  MUC search           : 0.00
% 5.32/2.26  Cooper               : 0.00
% 5.32/2.26  Total                : 1.24
% 5.32/2.26  Index Insertion      : 0.00
% 5.32/2.26  Index Deletion       : 0.00
% 5.32/2.26  Index Matching       : 0.00
% 5.32/2.26  BG Taut test         : 0.00
%------------------------------------------------------------------------------