TSTP Solution File: GEO248+3 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO248+3 : TPTP v8.1.2. Released v4.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 : n020.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:52 EDT 2023

% Result   : Theorem 3.22s 1.77s
% Output   : CNFRefutation 3.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   30
% Syntax   : Number of formulae    :   38 (   5 unt;  26 typ;   0 def)
%            Number of atoms       :   22 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   18 (   8   ~;   6   |;   1   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   47 (  23   >;  24   *;   0   +;   0  <<)
%            Number of predicates  :   19 (  18 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   21 (;  21   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ between_on_line > divides_points > before_on_line > unequally_directed_opposite_lines > unequally_directed_lines > right_convergent_lines > right_apart_point > left_convergent_lines > left_apart_point > incident_point_and_line > equally_directed_opposite_lines > equally_directed_lines > distinct_points > distinct_lines > convergent_lines > apart_point_and_line > point > line > parallel_through_point > parallel_lines > line_connecting > intersection_point > #nlpp > reverse_line > #skF_2 > #skF_3 > #skF_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

tff(parallel_through_point,type,
    parallel_through_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(equally_directed_opposite_lines,type,
    equally_directed_opposite_lines: ( $i * $i ) > $o ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_168,axiom,
    ! [A,L] :
      ~ ( left_apart_point(A,L)
        | left_apart_point(A,reverse_line(L)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax10_basics) ).

tff(f_57,axiom,
    ! [X,Y] :
      ( right_apart_point(X,Y)
    <=> left_apart_point(X,reverse_line(Y)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a2_defns) ).

tff(f_77,axiom,
    ! [A,L] :
      ( apart_point_and_line(A,L)
    <=> ( left_apart_point(A,L)
        | right_apart_point(A,L) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a6_defns) ).

tff(f_288,negated_conjecture,
    ~ ! [A,B,L] :
        ( ( apart_point_and_line(A,L)
          & incident_point_and_line(B,parallel_lines(L,A)) )
       => apart_point_and_line(B,L) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

tff(c_92,plain,
    ! [A_44,L_45] : ~ left_apart_point(A_44,L_45),
    inference(cnfTransformation,[status(thm)],[f_168]) ).

tff(c_6,plain,
    ! [X_3,Y_4] :
      ( left_apart_point(X_3,reverse_line(Y_4))
      | ~ right_apart_point(X_3,Y_4) ),
    inference(cnfTransformation,[status(thm)],[f_57]) ).

tff(c_152,plain,
    ! [X_3,Y_4] : ~ right_apart_point(X_3,Y_4),
    inference(negUnitSimplification,[status(thm)],[c_92,c_6]) ).

tff(c_22,plain,
    ! [A_11,L_12] :
      ( right_apart_point(A_11,L_12)
      | left_apart_point(A_11,L_12)
      | ~ apart_point_and_line(A_11,L_12) ),
    inference(cnfTransformation,[status(thm)],[f_77]) ).

tff(c_150,plain,
    ! [A_11,L_12] :
      ( right_apart_point(A_11,L_12)
      | ~ apart_point_and_line(A_11,L_12) ),
    inference(negUnitSimplification,[status(thm)],[c_92,c_22]) ).

tff(c_153,plain,
    ! [A_11,L_12] : ~ apart_point_and_line(A_11,L_12),
    inference(negUnitSimplification,[status(thm)],[c_152,c_150]) ).

tff(c_138,plain,
    apart_point_and_line('#skF_1','#skF_3'),
    inference(cnfTransformation,[status(thm)],[f_288]) ).

tff(c_154,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_153,c_138]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : GEO248+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15  % 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 : n020.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:20:07 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 3.22/1.77  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.22/1.77  
% 3.22/1.77  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.39/1.81  
% 3.39/1.81  Inference rules
% 3.39/1.81  ----------------------
% 3.39/1.81  #Ref     : 0
% 3.39/1.81  #Sup     : 0
% 3.39/1.81  #Fact    : 0
% 3.39/1.81  #Define  : 0
% 3.39/1.81  #Split   : 0
% 3.39/1.81  #Chain   : 0
% 3.39/1.81  #Close   : 0
% 3.39/1.81  
% 3.39/1.81  Ordering : KBO
% 3.39/1.81  
% 3.39/1.81  Simplification rules
% 3.39/1.81  ----------------------
% 3.39/1.81  #Subsume      : 68
% 3.39/1.81  #Demod        : 0
% 3.39/1.81  #Tautology    : 0
% 3.39/1.81  #SimpNegUnit  : 16
% 3.39/1.81  #BackRed      : 0
% 3.39/1.81  
% 3.39/1.81  #Partial instantiations: 0
% 3.39/1.81  #Strategies tried      : 1
% 3.39/1.81  
% 3.39/1.81  Timing (in seconds)
% 3.39/1.81  ----------------------
% 3.39/1.81  Preprocessing        : 0.57
% 3.39/1.81  Parsing              : 0.31
% 3.39/1.81  CNF conversion       : 0.05
% 3.39/1.81  Main loop            : 0.15
% 3.39/1.81  Inferencing          : 0.00
% 3.39/1.81  Reduction            : 0.07
% 3.39/1.81  Demodulation         : 0.05
% 3.39/1.81  BG Simplification    : 0.03
% 3.39/1.81  Subsumption          : 0.06
% 3.39/1.81  Abstraction          : 0.01
% 3.39/1.81  MUC search           : 0.00
% 3.39/1.81  Cooper               : 0.00
% 3.39/1.81  Total                : 0.77
% 3.39/1.81  Index Insertion      : 0.00
% 3.39/1.81  Index Deletion       : 0.00
% 3.39/1.82  Index Matching       : 0.00
% 3.39/1.82  BG Taut test         : 0.00
%------------------------------------------------------------------------------