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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO039-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/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 : n019.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:00 EDT 2023

% Result   : Unsatisfiable 3.78s 1.85s
% Output   : CNFRefutation 3.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   30 (  13 unt;  15 typ;   0 def)
%            Number of atoms       :   17 (   5 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    8 (   6   ~;   2   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    1 (   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    :   13 (  13 usr;   7 con; 0-6 aty)
%            Number of variables   :    8 (;   8   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > reflection > #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(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_368,axiom,
    ! [U,V] : between(U,V,V),
    file(unknown,unknown) ).

tff(f_370,axiom,
    u = x,
    file(unknown,unknown) ).

tff(f_369,axiom,
    between(u,w,x),
    file(unknown,unknown) ).

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

tff(f_372,axiom,
    ~ between(v,w,x),
    file(unknown,unknown) ).

tff(c_88,plain,
    ! [U_154,V_155] : between(U_154,V_155,V_155),
    inference(cnfTransformation,[status(thm)],[f_368]) ).

tff(c_92,plain,
    x = u,
    inference(cnfTransformation,[status(thm)],[f_370]) ).

tff(c_90,plain,
    between(u,w,x),
    inference(cnfTransformation,[status(thm)],[f_369]) ).

tff(c_96,plain,
    between(u,w,u),
    inference(demodulation,[status(thm),theory(equality)],[c_92,c_90]) ).

tff(c_133,plain,
    ! [Y_170,X_171] :
      ( ( Y_170 = X_171 )
      | ~ between(X_171,Y_170,X_171) ),
    inference(cnfTransformation,[status(thm)],[f_107]) ).

tff(c_141,plain,
    w = u,
    inference(resolution,[status(thm)],[c_96,c_133]) ).

tff(c_94,plain,
    ~ between(v,w,x),
    inference(cnfTransformation,[status(thm)],[f_372]) ).

tff(c_95,plain,
    ~ between(v,w,u),
    inference(demodulation,[status(thm),theory(equality)],[c_92,c_94]) ).

tff(c_145,plain,
    ~ between(v,u,u),
    inference(demodulation,[status(thm),theory(equality)],[c_141,c_95]) ).

tff(c_149,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_88,c_145]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.15/0.14  % Problem  : GEO039-3 : TPTP v8.1.2. Released v1.0.0.
% 0.15/0.15  % 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.16/0.37  % Computer : n019.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Fri Aug  4 00:32:31 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 3.78/1.85  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.78/1.85  
% 3.78/1.85  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.78/1.88  
% 3.78/1.88  Inference rules
% 3.78/1.88  ----------------------
% 3.78/1.88  #Ref     : 0
% 3.78/1.88  #Sup     : 9
% 3.78/1.88  #Fact    : 0
% 3.78/1.88  #Define  : 0
% 3.78/1.88  #Split   : 0
% 3.78/1.88  #Chain   : 0
% 3.78/1.88  #Close   : 0
% 3.78/1.88  
% 3.78/1.88  Ordering : KBO
% 3.78/1.88  
% 3.78/1.88  Simplification rules
% 3.78/1.88  ----------------------
% 3.78/1.88  #Subsume      : 0
% 3.78/1.88  #Demod        : 12
% 3.78/1.88  #Tautology    : 12
% 3.78/1.88  #SimpNegUnit  : 0
% 3.78/1.88  #BackRed      : 2
% 3.78/1.88  
% 3.78/1.88  #Partial instantiations: 0
% 3.78/1.88  #Strategies tried      : 1
% 3.78/1.88  
% 3.78/1.88  Timing (in seconds)
% 3.78/1.88  ----------------------
% 3.78/1.88  Preprocessing        : 0.59
% 3.78/1.88  Parsing              : 0.27
% 3.78/1.88  CNF conversion       : 0.04
% 3.78/1.88  Main loop            : 0.22
% 3.78/1.88  Inferencing          : 0.05
% 3.78/1.88  Reduction            : 0.08
% 3.78/1.88  Demodulation         : 0.06
% 3.78/1.88  BG Simplification    : 0.02
% 3.78/1.88  Subsumption          : 0.06
% 3.78/1.88  Abstraction          : 0.01
% 3.78/1.88  MUC search           : 0.00
% 3.78/1.88  Cooper               : 0.00
% 3.78/1.88  Total                : 0.85
% 3.78/1.88  Index Insertion      : 0.00
% 3.78/1.88  Index Deletion       : 0.00
% 3.78/1.88  Index Matching       : 0.00
% 3.78/1.88  BG Taut test         : 0.00
%------------------------------------------------------------------------------