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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO056-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 : n023.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:38:03 EDT 2023

% Result   : Unsatisfiable 3.33s 1.74s
% Output   : CNFRefutation 3.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   27 (  12 unt;  13 typ;   0 def)
%            Number of atoms       :   16 (  11 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    7 (   5   ~;   2   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   34 (   8   >;  26   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-6 aty)
%            Number of variables   :   22 (;  22   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > reflection > #nlpp > 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(lower_dimension_point_2,type,
    lower_dimension_point_2: $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(reflection,type,
    reflection: ( $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_78,axiom,
    ! [Y,X,W,V] : equidistant(Y,extension(X,Y,W,V),W,V),
    file(unknown,unknown) ).

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

tff(f_245,axiom,
    ! [U,V] : ( reflection(U,V) = extension(U,V,U,V) ),
    file(unknown,unknown) ).

tff(f_248,axiom,
    u = v,
    file(unknown,unknown) ).

tff(f_250,axiom,
    v != reflection(u,v),
    file(unknown,unknown) ).

tff(c_71,plain,
    ! [Y_89,X_90,W_91,V_92] : equidistant(Y_89,extension(X_90,Y_89,W_91,V_92),W_91,V_92),
    inference(cnfTransformation,[status(thm)],[f_78]) ).

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

tff(c_80,plain,
    ! [X_93,Y_94,V_95] : ( extension(X_93,Y_94,V_95,V_95) = Y_94 ),
    inference(resolution,[status(thm)],[c_71,c_6]) ).

tff(c_38,plain,
    ! [U_72,V_73] : ( extension(U_72,V_73,U_72,V_73) = reflection(U_72,V_73) ),
    inference(cnfTransformation,[status(thm)],[f_245]) ).

tff(c_93,plain,
    ! [V_95] : ( reflection(V_95,V_95) = V_95 ),
    inference(superposition,[status(thm),theory(equality)],[c_80,c_38]) ).

tff(c_40,plain,
    v = u,
    inference(cnfTransformation,[status(thm)],[f_248]) ).

tff(c_42,plain,
    reflection(u,v) != v,
    inference(cnfTransformation,[status(thm)],[f_250]) ).

tff(c_43,plain,
    reflection(u,u) != u,
    inference(demodulation,[status(thm),theory(equality)],[c_40,c_40,c_42]) ).

tff(c_112,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_93,c_43]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GEO056-2 : TPTP v8.1.2. Released v1.0.0.
% 0.07/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.33  % Computer : n023.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % 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:30:37 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 3.33/1.74  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.33/1.74  
% 3.33/1.74  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.62/1.77  
% 3.62/1.77  Inference rules
% 3.62/1.77  ----------------------
% 3.62/1.77  #Ref     : 0
% 3.62/1.77  #Sup     : 15
% 3.62/1.77  #Fact    : 0
% 3.62/1.77  #Define  : 0
% 3.62/1.77  #Split   : 0
% 3.62/1.77  #Chain   : 0
% 3.62/1.77  #Close   : 0
% 3.62/1.77  
% 3.62/1.77  Ordering : KBO
% 3.62/1.77  
% 3.62/1.77  Simplification rules
% 3.62/1.77  ----------------------
% 3.62/1.77  #Subsume      : 0
% 3.62/1.77  #Demod        : 3
% 3.62/1.77  #Tautology    : 8
% 3.62/1.77  #SimpNegUnit  : 0
% 3.62/1.77  #BackRed      : 1
% 3.62/1.77  
% 3.62/1.77  #Partial instantiations: 0
% 3.62/1.77  #Strategies tried      : 1
% 3.62/1.77  
% 3.62/1.77  Timing (in seconds)
% 3.62/1.77  ----------------------
% 3.62/1.77  Preprocessing        : 0.54
% 3.62/1.77  Parsing              : 0.31
% 3.62/1.77  CNF conversion       : 0.03
% 3.62/1.77  Main loop            : 0.19
% 3.62/1.77  Inferencing          : 0.07
% 3.62/1.77  Reduction            : 0.06
% 3.62/1.77  Demodulation         : 0.04
% 3.62/1.77  BG Simplification    : 0.02
% 3.62/1.77  Subsumption          : 0.04
% 3.62/1.77  Abstraction          : 0.01
% 3.62/1.77  MUC search           : 0.00
% 3.62/1.77  Cooper               : 0.00
% 3.62/1.77  Total                : 0.78
% 3.62/1.77  Index Insertion      : 0.00
% 3.62/1.77  Index Deletion       : 0.00
% 3.62/1.77  Index Matching       : 0.00
% 3.62/1.77  BG Taut test         : 0.00
%------------------------------------------------------------------------------