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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO001-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/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 : n003.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.12s 2.01s
% Output   : CNFRefutation 4.12s
% 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 > inner_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(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(inner_pasch,type,
    inner_pasch: ( $i * $i * $i * $i * $i ) > $i ).

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

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

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

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

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

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

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

tff(f_127,axiom,
    ! [W,U,X,Y,V] :
      ( ~ between(U,V,W)
      | ~ between(Y,X,W)
      | between(X,inner_pasch(U,V,W,X,Y),U) ),
    file(unknown,unknown) ).

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

tff(f_118,axiom,
    ! [W,U,X,Y,V] :
      ( ~ between(U,V,W)
      | ~ between(Y,X,W)
      | between(V,inner_pasch(U,V,W,X,Y),Y) ),
    file(unknown,unknown) ).

tff(c_40,plain,
    ~ between(c,b,a),
    inference(cnfTransformation,[status(thm)],[f_225]) ).

tff(c_51,plain,
    ! [Y_83,X_84,W_85,V_86] : equidistant(Y_83,extension(X_84,Y_83,W_85,V_86),W_85,V_86),
    inference(cnfTransformation,[status(thm)],[f_79]) ).

tff(c_6,plain,
    ! [Y_10,X_9,Z_11] :
      ( ( Y_10 = X_9 )
      | ~ equidistant(X_9,Y_10,Z_11,Z_11) ),
    inference(cnfTransformation,[status(thm)],[f_72]) ).

tff(c_57,plain,
    ! [X_87,Y_88,V_89] : ( extension(X_87,Y_88,V_89,V_89) = Y_88 ),
    inference(resolution,[status(thm)],[c_51,c_6]) ).

tff(c_8,plain,
    ! [X_12,Y_13,W_14,V_15] : between(X_12,Y_13,extension(X_12,Y_13,W_14,V_15)),
    inference(cnfTransformation,[status(thm)],[f_76]) ).

tff(c_66,plain,
    ! [X_87,Y_88] : between(X_87,Y_88,Y_88),
    inference(superposition,[status(thm),theory(equality)],[c_57,c_8]) ).

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

tff(c_106,plain,
    ! [V_104,U_106,X_105,Y_107,W_108] :
      ( between(X_105,inner_pasch(U_106,V_104,W_108,X_105,Y_107),U_106)
      | ~ between(Y_107,X_105,W_108)
      | ~ between(U_106,V_104,W_108) ),
    inference(cnfTransformation,[status(thm)],[f_127]) ).

tff(c_14,plain,
    ! [Y_29,X_28] :
      ( ( Y_29 = X_28 )
      | ~ between(X_28,Y_29,X_28) ),
    inference(cnfTransformation,[status(thm)],[f_108]) ).

tff(c_1191,plain,
    ! [U_316,V_317,W_318,Y_319] :
      ( ( inner_pasch(U_316,V_317,W_318,U_316,Y_319) = U_316 )
      | ~ between(Y_319,U_316,W_318)
      | ~ between(U_316,V_317,W_318) ),
    inference(resolution,[status(thm)],[c_106,c_14]) ).

tff(c_1216,plain,
    ! [V_320] :
      ( ( inner_pasch(b,V_320,c,b,a) = b )
      | ~ between(b,V_320,c) ),
    inference(resolution,[status(thm)],[c_38,c_1191]) ).

tff(c_1231,plain,
    inner_pasch(b,c,c,b,a) = b,
    inference(resolution,[status(thm)],[c_66,c_1216]) ).

tff(c_16,plain,
    ! [U_31,X_32,Y_33,W_30,V_34] :
      ( between(V_34,inner_pasch(U_31,V_34,W_30,X_32,Y_33),Y_33)
      | ~ between(Y_33,X_32,W_30)
      | ~ between(U_31,V_34,W_30) ),
    inference(cnfTransformation,[status(thm)],[f_118]) ).

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

tff(c_1242,plain,
    between(c,b,a),
    inference(demodulation,[status(thm),theory(equality)],[c_66,c_38,c_1235]) ).

tff(c_1244,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_40,c_1242]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : GEO001-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12  % 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.12/0.34  % Computer : n003.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Fri Aug  4 00:45:08 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 4.12/2.01  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.12/2.01  
% 4.12/2.01  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.12/2.04  
% 4.12/2.04  Inference rules
% 4.12/2.04  ----------------------
% 4.12/2.04  #Ref     : 0
% 4.12/2.04  #Sup     : 278
% 4.12/2.04  #Fact    : 0
% 4.12/2.04  #Define  : 0
% 4.12/2.04  #Split   : 0
% 4.12/2.04  #Chain   : 0
% 4.12/2.04  #Close   : 0
% 4.12/2.04  
% 4.12/2.04  Ordering : KBO
% 4.12/2.04  
% 4.12/2.04  Simplification rules
% 4.12/2.04  ----------------------
% 4.12/2.04  #Subsume      : 5
% 4.12/2.04  #Demod        : 190
% 4.12/2.04  #Tautology    : 128
% 4.12/2.04  #SimpNegUnit  : 1
% 4.12/2.04  #BackRed      : 0
% 4.12/2.04  
% 4.12/2.04  #Partial instantiations: 0
% 4.12/2.04  #Strategies tried      : 1
% 4.12/2.04  
% 4.12/2.04  Timing (in seconds)
% 4.12/2.04  ----------------------
% 4.12/2.05  Preprocessing        : 0.48
% 4.12/2.05  Parsing              : 0.28
% 4.12/2.05  CNF conversion       : 0.03
% 4.12/2.05  Main loop            : 0.59
% 4.12/2.05  Inferencing          : 0.23
% 4.12/2.05  Reduction            : 0.16
% 4.12/2.05  Demodulation         : 0.13
% 4.12/2.05  BG Simplification    : 0.03
% 4.12/2.05  Subsumption          : 0.13
% 4.12/2.05  Abstraction          : 0.02
% 4.12/2.05  MUC search           : 0.00
% 4.12/2.05  Cooper               : 0.00
% 4.12/2.05  Total                : 1.12
% 4.12/2.05  Index Insertion      : 0.00
% 4.12/2.05  Index Deletion       : 0.00
% 4.12/2.05  Index Matching       : 0.00
% 4.12/2.05  BG Taut test         : 0.00
%------------------------------------------------------------------------------