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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO265+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 : n016.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:56 EDT 2023

% Result   : Theorem 4.24s 2.07s
% Output   : CNFRefutation 4.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   31
% Syntax   : Number of formulae    :   46 (   6 unt;  24 typ;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   37 (  17   ~;  14   |;   1   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   45 (  22   >;  23   *;   0   +;   0  <<)
%            Number of predicates  :   19 (  18 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   34 (;  34   !;   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 > line_connecting > intersection_point > #nlpp > reverse_line > #skF_2 > #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_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(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_286,negated_conjecture,
    ~ ! [L,M] :
        ( equally_directed_lines(L,reverse_line(M))
       => equally_directed_opposite_lines(L,M) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

tff(f_155,axiom,
    ! [L,M] :
      ( unequally_directed_lines(L,M)
      | unequally_directed_lines(L,reverse_line(M)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax8_basics) ).

tff(f_66,axiom,
    ! [X,Y] :
      ( equally_directed_lines(X,Y)
    <=> ~ unequally_directed_lines(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a4_defns) ).

tff(f_71,axiom,
    ! [X,Y] :
      ( equally_directed_opposite_lines(X,Y)
    <=> ~ unequally_directed_opposite_lines(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a5_defns) ).

tff(f_53,axiom,
    ! [X,Y] :
      ( unequally_directed_opposite_lines(X,Y)
    <=> unequally_directed_lines(X,reverse_line(Y)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a1_defns) ).

tff(f_173,axiom,
    ! [L,M] :
      ~ ( left_convergent_lines(L,M)
        | left_convergent_lines(L,reverse_line(M)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax11_basics) ).

tff(f_163,axiom,
    ! [L,M] :
      ( ( unequally_directed_lines(L,M)
        & unequally_directed_lines(L,reverse_line(M)) )
     => ( left_convergent_lines(L,M)
        | left_convergent_lines(L,reverse_line(M)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax9_basics) ).

tff(c_134,plain,
    ~ equally_directed_opposite_lines('#skF_1','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_286]) ).

tff(c_136,plain,
    equally_directed_lines('#skF_1',reverse_line('#skF_2')),
    inference(cnfTransformation,[status(thm)],[f_286]) ).

tff(c_205,plain,
    ! [L_126,M_127] :
      ( unequally_directed_lines(L_126,reverse_line(M_127))
      | unequally_directed_lines(L_126,M_127) ),
    inference(cnfTransformation,[status(thm)],[f_155]) ).

tff(c_14,plain,
    ! [X_7,Y_8] :
      ( ~ unequally_directed_lines(X_7,Y_8)
      | ~ equally_directed_lines(X_7,Y_8) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_343,plain,
    ! [L_157,M_158] :
      ( ~ equally_directed_lines(L_157,reverse_line(M_158))
      | unequally_directed_lines(L_157,M_158) ),
    inference(resolution,[status(thm)],[c_205,c_14]) ).

tff(c_360,plain,
    unequally_directed_lines('#skF_1','#skF_2'),
    inference(resolution,[status(thm)],[c_136,c_343]) ).

tff(c_20,plain,
    ! [X_9,Y_10] :
      ( equally_directed_opposite_lines(X_9,Y_10)
      | unequally_directed_opposite_lines(X_9,Y_10) ),
    inference(cnfTransformation,[status(thm)],[f_71]) ).

tff(c_2,plain,
    ! [X_1,Y_2] :
      ( unequally_directed_lines(X_1,reverse_line(Y_2))
      | ~ unequally_directed_opposite_lines(X_1,Y_2) ),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_96,plain,
    ! [L_46,M_47] : ~ left_convergent_lines(L_46,M_47),
    inference(cnfTransformation,[status(thm)],[f_173]) ).

tff(c_90,plain,
    ! [L_42,M_43] :
      ( left_convergent_lines(L_42,reverse_line(M_43))
      | left_convergent_lines(L_42,M_43)
      | ~ unequally_directed_lines(L_42,reverse_line(M_43))
      | ~ unequally_directed_lines(L_42,M_43) ),
    inference(cnfTransformation,[status(thm)],[f_163]) ).

tff(c_252,plain,
    ! [L_141,M_142] :
      ( ~ unequally_directed_lines(L_141,reverse_line(M_142))
      | ~ unequally_directed_lines(L_141,M_142) ),
    inference(negUnitSimplification,[status(thm)],[c_96,c_96,c_90]) ).

tff(c_276,plain,
    ! [X_143,Y_144] :
      ( ~ unequally_directed_lines(X_143,Y_144)
      | ~ unequally_directed_opposite_lines(X_143,Y_144) ),
    inference(resolution,[status(thm)],[c_2,c_252]) ).

tff(c_287,plain,
    ! [X_9,Y_10] :
      ( ~ unequally_directed_lines(X_9,Y_10)
      | equally_directed_opposite_lines(X_9,Y_10) ),
    inference(resolution,[status(thm)],[c_20,c_276]) ).

tff(c_364,plain,
    equally_directed_opposite_lines('#skF_1','#skF_2'),
    inference(resolution,[status(thm)],[c_360,c_287]) ).

tff(c_371,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_134,c_364]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GEO265+3 : TPTP v8.1.2. Released v4.0.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.14/0.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Fri Aug  4 00:46:08 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 4.24/2.07  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.24/2.08  
% 4.24/2.08  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.35/2.10  
% 4.35/2.10  Inference rules
% 4.35/2.10  ----------------------
% 4.35/2.10  #Ref     : 0
% 4.35/2.10  #Sup     : 42
% 4.35/2.10  #Fact    : 0
% 4.35/2.10  #Define  : 0
% 4.35/2.10  #Split   : 1
% 4.35/2.10  #Chain   : 0
% 4.35/2.10  #Close   : 0
% 4.35/2.10  
% 4.35/2.10  Ordering : KBO
% 4.35/2.10  
% 4.35/2.10  Simplification rules
% 4.35/2.10  ----------------------
% 4.35/2.10  #Subsume      : 41
% 4.35/2.10  #Demod        : 0
% 4.35/2.10  #Tautology    : 7
% 4.35/2.10  #SimpNegUnit  : 17
% 4.35/2.10  #BackRed      : 0
% 4.35/2.10  
% 4.35/2.10  #Partial instantiations: 0
% 4.35/2.10  #Strategies tried      : 1
% 4.35/2.10  
% 4.35/2.10  Timing (in seconds)
% 4.35/2.10  ----------------------
% 4.35/2.11  Preprocessing        : 0.61
% 4.35/2.11  Parsing              : 0.34
% 4.35/2.11  CNF conversion       : 0.05
% 4.35/2.11  Main loop            : 0.36
% 4.35/2.11  Inferencing          : 0.12
% 4.35/2.11  Reduction            : 0.09
% 4.35/2.11  Demodulation         : 0.06
% 4.35/2.11  BG Simplification    : 0.03
% 4.35/2.11  Subsumption          : 0.09
% 4.35/2.11  Abstraction          : 0.01
% 4.35/2.11  MUC search           : 0.00
% 4.35/2.11  Cooper               : 0.00
% 4.35/2.11  Total                : 1.02
% 4.35/2.11  Index Insertion      : 0.00
% 4.35/2.11  Index Deletion       : 0.00
% 4.35/2.11  Index Matching       : 0.00
% 4.35/2.11  BG Taut test         : 0.00
%------------------------------------------------------------------------------