TSTP Solution File: GEO203+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO203+1 : TPTP v8.1.2. Released v3.3.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 : n025.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:38 EDT 2023

% Result   : Theorem 4.51s 2.23s
% Output   : CNFRefutation 5.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   38 (  16 unt;   9 typ;   0 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   47 (  18   ~;  21   |;   3   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   12 (   6   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   25 (;  25   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ distinct_points > distinct_lines > convergent_lines > apart_point_and_line > line_connecting > intersection_point > #nlpp > #skF_2 > #skF_3 > #skF_1

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(line_connecting,type,
    line_connecting: ( $i * $i ) > $i ).

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

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

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

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

tff('#skF_2',type,
    '#skF_2': $i ).

tff('#skF_3',type,
    '#skF_3': $i ).

tff('#skF_1',type,
    '#skF_1': $i ).

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

tff(f_144,negated_conjecture,
    ~ ! [X,Y,Z] :
        ( ( convergent_lines(X,Y)
          & convergent_lines(X,Z)
          & distinct_points(intersection_point(X,Y),intersection_point(X,Z)) )
       => ~ distinct_lines(line_connecting(intersection_point(X,Y),intersection_point(X,Z)),X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

tff(f_113,axiom,
    ! [X,Y,U,V] :
      ( ( distinct_points(X,Y)
        & distinct_lines(U,V) )
     => ( apart_point_and_line(X,U)
        | apart_point_and_line(X,V)
        | apart_point_and_line(Y,U)
        | apart_point_and_line(Y,V) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',cu1) ).

tff(f_85,axiom,
    ! [X,Y] :
      ( distinct_points(X,Y)
     => ~ apart_point_and_line(X,line_connecting(X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci1) ).

tff(f_95,axiom,
    ! [X,Y] :
      ( convergent_lines(X,Y)
     => ~ apart_point_and_line(intersection_point(X,Y),X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci3) ).

tff(f_90,axiom,
    ! [X,Y] :
      ( distinct_points(X,Y)
     => ~ apart_point_and_line(Y,line_connecting(X,Y)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci2) ).

tff(c_32,plain,
    distinct_points(intersection_point('#skF_1','#skF_2'),intersection_point('#skF_1','#skF_3')),
    inference(cnfTransformation,[status(thm)],[f_144]) ).

tff(c_36,plain,
    convergent_lines('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_144]) ).

tff(c_34,plain,
    convergent_lines('#skF_1','#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_144]) ).

tff(c_30,plain,
    distinct_lines(line_connecting(intersection_point('#skF_1','#skF_2'),intersection_point('#skF_1','#skF_3')),'#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_144]) ).

tff(c_168,plain,
    ! [Y_72,V_73,U_74,X_75] :
      ( apart_point_and_line(Y_72,V_73)
      | apart_point_and_line(Y_72,U_74)
      | apart_point_and_line(X_75,V_73)
      | apart_point_and_line(X_75,U_74)
      | ~ distinct_lines(U_74,V_73)
      | ~ distinct_points(X_75,Y_72) ),
    inference(cnfTransformation,[status(thm)],[f_113]) ).

tff(c_410,plain,
    ! [Y_87,X_88] :
      ( apart_point_and_line(Y_87,'#skF_1')
      | apart_point_and_line(Y_87,line_connecting(intersection_point('#skF_1','#skF_2'),intersection_point('#skF_1','#skF_3')))
      | apart_point_and_line(X_88,'#skF_1')
      | apart_point_and_line(X_88,line_connecting(intersection_point('#skF_1','#skF_2'),intersection_point('#skF_1','#skF_3')))
      | ~ distinct_points(X_88,Y_87) ),
    inference(resolution,[status(thm)],[c_30,c_168]) ).

tff(c_419,plain,
    ( apart_point_and_line(intersection_point('#skF_1','#skF_3'),'#skF_1')
    | apart_point_and_line(intersection_point('#skF_1','#skF_3'),line_connecting(intersection_point('#skF_1','#skF_2'),intersection_point('#skF_1','#skF_3')))
    | apart_point_and_line(intersection_point('#skF_1','#skF_2'),'#skF_1')
    | apart_point_and_line(intersection_point('#skF_1','#skF_2'),line_connecting(intersection_point('#skF_1','#skF_2'),intersection_point('#skF_1','#skF_3'))) ),
    inference(resolution,[status(thm)],[c_32,c_410]) ).

tff(c_553,plain,
    apart_point_and_line(intersection_point('#skF_1','#skF_2'),line_connecting(intersection_point('#skF_1','#skF_2'),intersection_point('#skF_1','#skF_3'))),
    inference(splitLeft,[status(thm)],[c_419]) ).

tff(c_14,plain,
    ! [X_13,Y_14] :
      ( ~ apart_point_and_line(X_13,line_connecting(X_13,Y_14))
      | ~ distinct_points(X_13,Y_14) ),
    inference(cnfTransformation,[status(thm)],[f_85]) ).

tff(c_689,plain,
    ~ distinct_points(intersection_point('#skF_1','#skF_2'),intersection_point('#skF_1','#skF_3')),
    inference(resolution,[status(thm)],[c_553,c_14]) ).

tff(c_695,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_32,c_689]) ).

tff(c_696,plain,
    ( apart_point_and_line(intersection_point('#skF_1','#skF_2'),'#skF_1')
    | apart_point_and_line(intersection_point('#skF_1','#skF_3'),line_connecting(intersection_point('#skF_1','#skF_2'),intersection_point('#skF_1','#skF_3')))
    | apart_point_and_line(intersection_point('#skF_1','#skF_3'),'#skF_1') ),
    inference(splitRight,[status(thm)],[c_419]) ).

tff(c_1587,plain,
    apart_point_and_line(intersection_point('#skF_1','#skF_3'),'#skF_1'),
    inference(splitLeft,[status(thm)],[c_696]) ).

tff(c_18,plain,
    ! [X_17,Y_18] :
      ( ~ apart_point_and_line(intersection_point(X_17,Y_18),X_17)
      | ~ convergent_lines(X_17,Y_18) ),
    inference(cnfTransformation,[status(thm)],[f_95]) ).

tff(c_1600,plain,
    ~ convergent_lines('#skF_1','#skF_3'),
    inference(resolution,[status(thm)],[c_1587,c_18]) ).

tff(c_1606,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_34,c_1600]) ).

tff(c_1607,plain,
    ( apart_point_and_line(intersection_point('#skF_1','#skF_3'),line_connecting(intersection_point('#skF_1','#skF_2'),intersection_point('#skF_1','#skF_3')))
    | apart_point_and_line(intersection_point('#skF_1','#skF_2'),'#skF_1') ),
    inference(splitRight,[status(thm)],[c_696]) ).

tff(c_1653,plain,
    apart_point_and_line(intersection_point('#skF_1','#skF_2'),'#skF_1'),
    inference(splitLeft,[status(thm)],[c_1607]) ).

tff(c_1660,plain,
    ~ convergent_lines('#skF_1','#skF_2'),
    inference(resolution,[status(thm)],[c_1653,c_18]) ).

tff(c_1666,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_36,c_1660]) ).

tff(c_1667,plain,
    apart_point_and_line(intersection_point('#skF_1','#skF_3'),line_connecting(intersection_point('#skF_1','#skF_2'),intersection_point('#skF_1','#skF_3'))),
    inference(splitRight,[status(thm)],[c_1607]) ).

tff(c_16,plain,
    ! [Y_16,X_15] :
      ( ~ apart_point_and_line(Y_16,line_connecting(X_15,Y_16))
      | ~ distinct_points(X_15,Y_16) ),
    inference(cnfTransformation,[status(thm)],[f_90]) ).

tff(c_1811,plain,
    ~ distinct_points(intersection_point('#skF_1','#skF_2'),intersection_point('#skF_1','#skF_3')),
    inference(resolution,[status(thm)],[c_1667,c_16]) ).

tff(c_1817,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_32,c_1811]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GEO203+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14  % 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.15/0.36  % Computer : n025.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Fri Aug  4 00:45:20 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 4.51/2.23  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.51/2.24  
% 4.51/2.24  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.23/2.27  
% 5.23/2.27  Inference rules
% 5.23/2.27  ----------------------
% 5.23/2.27  #Ref     : 0
% 5.23/2.27  #Sup     : 335
% 5.23/2.27  #Fact    : 52
% 5.23/2.27  #Define  : 0
% 5.23/2.27  #Split   : 7
% 5.23/2.27  #Chain   : 0
% 5.23/2.27  #Close   : 0
% 5.23/2.27  
% 5.23/2.27  Ordering : KBO
% 5.23/2.27  
% 5.23/2.27  Simplification rules
% 5.23/2.27  ----------------------
% 5.23/2.27  #Subsume      : 52
% 5.23/2.27  #Demod        : 84
% 5.23/2.27  #Tautology    : 75
% 5.23/2.27  #SimpNegUnit  : 5
% 5.23/2.27  #BackRed      : 0
% 5.23/2.27  
% 5.23/2.27  #Partial instantiations: 0
% 5.23/2.27  #Strategies tried      : 1
% 5.23/2.27  
% 5.23/2.27  Timing (in seconds)
% 5.23/2.27  ----------------------
% 5.23/2.27  Preprocessing        : 0.47
% 5.23/2.27  Parsing              : 0.27
% 5.23/2.27  CNF conversion       : 0.03
% 5.23/2.27  Main loop            : 0.75
% 5.23/2.27  Inferencing          : 0.30
% 5.23/2.27  Reduction            : 0.18
% 5.23/2.27  Demodulation         : 0.12
% 5.23/2.27  BG Simplification    : 0.03
% 5.23/2.27  Subsumption          : 0.18
% 5.23/2.27  Abstraction          : 0.02
% 5.23/2.27  MUC search           : 0.00
% 5.23/2.27  Cooper               : 0.00
% 5.23/2.27  Total                : 1.27
% 5.23/2.27  Index Insertion      : 0.00
% 5.23/2.27  Index Deletion       : 0.00
% 5.23/2.27  Index Matching       : 0.00
% 5.23/2.27  BG Taut test         : 0.00
%------------------------------------------------------------------------------