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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO085-1 : TPTP v8.1.2. Released v2.4.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 : n008.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:08 EDT 2023

% Result   : Unsatisfiable 4.27s 1.97s
% Output   : CNFRefutation 4.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   29
% Syntax   : Number of formulae    :   49 (   8 unt;  22 typ;   0 def)
%            Number of atoms       :   49 (  11 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   48 (  26   ~;  22   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   40 (  21   >;  19   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;   1 con; 0-3 aty)
%            Number of variables   :   25 (;  25   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ meet > part_of > inner_point > incident_c > end_point > open > closed > ax0_sk5 > ax0_sk2 > sum > ax0_sk9 > ax0_sk4 > ax0_sk3 > ax0_sk13 > ax0_sk12 > ax0_sk11 > ax0_sk10 > ax0_sk1 > #nlpp > ax0_sk8 > ax0_sk7 > ax0_sk6 > sk14

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(closed,type,
    closed: $i > $o ).

tff(ax0_sk8,type,
    ax0_sk8: $i > $i ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(ax0_sk7,type,
    ax0_sk7: $i > $i ).

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

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

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

tff(ax0_sk6,type,
    ax0_sk6: $i > $i ).

tff(open,type,
    open: $i > $o ).

tff(f_433,axiom,
    open(sk14),
    file(unknown,unknown) ).

tff(f_303,axiom,
    ! [A] :
      ( ~ open(A)
      | end_point(ax0_sk7(A),A) ),
    file(unknown,unknown) ).

tff(f_294,axiom,
    ! [A,B] :
      ( ~ closed(A)
      | ~ end_point(B,A) ),
    file(unknown,unknown) ).

tff(f_298,axiom,
    ! [A] :
      ( end_point(ax0_sk6(A),A)
      | closed(A) ),
    file(unknown,unknown) ).

tff(f_441,axiom,
    ! [A,B] :
      ( ( A = B )
      | ~ end_point(A,sk14)
      | ~ end_point(B,sk14) ),
    file(unknown,unknown) ).

tff(f_383,axiom,
    ! [A,B] :
      ( ~ end_point(A,B)
      | ( A != ax0_sk11(A,B) ) ),
    file(unknown,unknown) ).

tff(f_377,axiom,
    ! [A,B] :
      ( ~ end_point(A,B)
      | end_point(ax0_sk11(A,B),B) ),
    file(unknown,unknown) ).

tff(c_98,plain,
    open(sk14),
    inference(cnfTransformation,[status(thm)],[f_433]) ).

tff(c_66,plain,
    ! [A_88] :
      ( end_point(ax0_sk7(A_88),A_88)
      | ~ open(A_88) ),
    inference(cnfTransformation,[status(thm)],[f_303]) ).

tff(c_104,plain,
    ! [A_134] :
      ( end_point(ax0_sk7(A_134),A_134)
      | ~ open(A_134) ),
    inference(cnfTransformation,[status(thm)],[f_303]) ).

tff(c_62,plain,
    ! [B_86,A_85] :
      ( ~ end_point(B_86,A_85)
      | ~ closed(A_85) ),
    inference(cnfTransformation,[status(thm)],[f_294]) ).

tff(c_122,plain,
    ! [A_136] :
      ( ~ closed(A_136)
      | ~ open(A_136) ),
    inference(resolution,[status(thm)],[c_104,c_62]) ).

tff(c_126,plain,
    ~ closed(sk14),
    inference(resolution,[status(thm)],[c_98,c_122]) ).

tff(c_64,plain,
    ! [A_87] :
      ( closed(A_87)
      | end_point(ax0_sk6(A_87),A_87) ),
    inference(cnfTransformation,[status(thm)],[f_298]) ).

tff(c_157,plain,
    ! [B_156,A_157] :
      ( ~ end_point(B_156,sk14)
      | ~ end_point(A_157,sk14)
      | ( B_156 = A_157 ) ),
    inference(cnfTransformation,[status(thm)],[f_441]) ).

tff(c_160,plain,
    ! [A_157] :
      ( ~ end_point(A_157,sk14)
      | ( ax0_sk6(sk14) = A_157 )
      | closed(sk14) ),
    inference(resolution,[status(thm)],[c_64,c_157]) ).

tff(c_187,plain,
    ! [A_160] :
      ( ~ end_point(A_160,sk14)
      | ( ax0_sk6(sk14) = A_160 ) ),
    inference(negUnitSimplification,[status(thm)],[c_126,c_160]) ).

tff(c_199,plain,
    ( ( ax0_sk7(sk14) = ax0_sk6(sk14) )
    | ~ open(sk14) ),
    inference(resolution,[status(thm)],[c_66,c_187]) ).

tff(c_207,plain,
    ax0_sk7(sk14) = ax0_sk6(sk14),
    inference(demodulation,[status(thm),theory(equality)],[c_98,c_199]) ).

tff(c_211,plain,
    ( end_point(ax0_sk6(sk14),sk14)
    | ~ open(sk14) ),
    inference(superposition,[status(thm),theory(equality)],[c_207,c_66]) ).

tff(c_215,plain,
    end_point(ax0_sk6(sk14),sk14),
    inference(demodulation,[status(thm),theory(equality)],[c_98,c_211]) ).

tff(c_84,plain,
    ! [A_109,B_110] :
      ( ( ax0_sk11(A_109,B_110) != A_109 )
      | ~ end_point(A_109,B_110) ),
    inference(cnfTransformation,[status(thm)],[f_383]) ).

tff(c_234,plain,
    ax0_sk11(ax0_sk6(sk14),sk14) != ax0_sk6(sk14),
    inference(resolution,[status(thm)],[c_215,c_84]) ).

tff(c_82,plain,
    ! [A_107,B_108] :
      ( end_point(ax0_sk11(A_107,B_108),B_108)
      | ~ end_point(A_107,B_108) ),
    inference(cnfTransformation,[status(thm)],[f_377]) ).

tff(c_277,plain,
    ! [A_176] :
      ( ( ax0_sk11(A_176,sk14) = ax0_sk6(sk14) )
      | ~ end_point(A_176,sk14) ),
    inference(resolution,[status(thm)],[c_82,c_187]) ).

tff(c_280,plain,
    ax0_sk11(ax0_sk6(sk14),sk14) = ax0_sk6(sk14),
    inference(resolution,[status(thm)],[c_215,c_277]) ).

tff(c_296,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_234,c_280]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GEO085-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14  % 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 : n008.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:19:03 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 4.27/1.97  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.27/1.97  
% 4.27/1.97  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.27/2.00  
% 4.27/2.00  Inference rules
% 4.27/2.00  ----------------------
% 4.27/2.00  #Ref     : 0
% 4.27/2.00  #Sup     : 37
% 4.27/2.00  #Fact    : 0
% 4.27/2.00  #Define  : 0
% 4.27/2.00  #Split   : 0
% 4.27/2.00  #Chain   : 0
% 4.27/2.00  #Close   : 0
% 4.27/2.00  
% 4.27/2.00  Ordering : KBO
% 4.27/2.00  
% 4.27/2.00  Simplification rules
% 4.27/2.00  ----------------------
% 4.27/2.00  #Subsume      : 6
% 4.27/2.00  #Demod        : 7
% 4.27/2.00  #Tautology    : 14
% 4.27/2.00  #SimpNegUnit  : 3
% 4.27/2.00  #BackRed      : 0
% 4.27/2.00  
% 4.27/2.00  #Partial instantiations: 0
% 4.27/2.00  #Strategies tried      : 1
% 4.27/2.00  
% 4.27/2.00  Timing (in seconds)
% 4.27/2.00  ----------------------
% 4.27/2.00  Preprocessing        : 0.62
% 4.27/2.00  Parsing              : 0.32
% 4.27/2.00  CNF conversion       : 0.04
% 4.27/2.00  Main loop            : 0.27
% 4.27/2.00  Inferencing          : 0.09
% 4.27/2.00  Reduction            : 0.08
% 4.27/2.01  Demodulation         : 0.05
% 4.27/2.01  BG Simplification    : 0.03
% 4.27/2.01  Subsumption          : 0.06
% 4.27/2.01  Abstraction          : 0.01
% 4.27/2.01  MUC search           : 0.00
% 4.27/2.01  Cooper               : 0.00
% 4.27/2.01  Total                : 0.94
% 4.27/2.01  Index Insertion      : 0.00
% 4.27/2.01  Index Deletion       : 0.00
% 4.27/2.01  Index Matching       : 0.00
% 4.27/2.01  BG Taut test         : 0.00
%------------------------------------------------------------------------------