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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO232+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 : n018.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:48 EDT 2023

% Result   : Theorem 4.03s 2.22s
% Output   : CNFRefutation 4.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   28
% Syntax   : Number of formulae    :   37 (   7 unt;  23 typ;   0 def)
%            Number of atoms       :   21 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   14 (   7   ~;   5   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 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    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   17 (;  17   !;   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_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(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_133,axiom,
    ! [L] : equally_directed_lines(L,L),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax5_basics) ).

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_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_284,negated_conjecture,
    ~ ! [L] : unequally_directed_opposite_lines(L,L),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

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(c_76,plain,
    ! [L_33] : equally_directed_lines(L_33,L_33),
    inference(cnfTransformation,[status(thm)],[f_133]) ).

tff(c_88,plain,
    ! [L_40,M_41] :
      ( unequally_directed_lines(L_40,reverse_line(M_41))
      | unequally_directed_lines(L_40,M_41) ),
    inference(cnfTransformation,[status(thm)],[f_155]) ).

tff(c_217,plain,
    ! [X_131,Y_132] :
      ( unequally_directed_opposite_lines(X_131,Y_132)
      | ~ unequally_directed_lines(X_131,reverse_line(Y_132)) ),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_232,plain,
    ! [L_133,M_134] :
      ( unequally_directed_opposite_lines(L_133,M_134)
      | unequally_directed_lines(L_133,M_134) ),
    inference(resolution,[status(thm)],[c_88,c_217]) ).

tff(c_134,plain,
    ~ unequally_directed_opposite_lines('#skF_1','#skF_1'),
    inference(cnfTransformation,[status(thm)],[f_284]) ).

tff(c_240,plain,
    unequally_directed_lines('#skF_1','#skF_1'),
    inference(resolution,[status(thm)],[c_232,c_134]) ).

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_243,plain,
    ~ equally_directed_lines('#skF_1','#skF_1'),
    inference(resolution,[status(thm)],[c_240,c_14]) ).

tff(c_247,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_76,c_243]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : GEO232+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10  % 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.11/0.30  % Computer : n018.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8042.1875MB
% 0.11/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30  % CPULimit : 300
% 0.11/0.30  % WCLimit  : 300
% 0.11/0.30  % DateTime : Fri Aug  4 00:23:36 EDT 2023
% 0.11/0.30  % CPUTime  : 
% 4.03/2.22  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.10/2.23  
% 4.10/2.23  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.10/2.25  
% 4.10/2.25  Inference rules
% 4.10/2.25  ----------------------
% 4.10/2.25  #Ref     : 0
% 4.10/2.25  #Sup     : 16
% 4.10/2.25  #Fact    : 0
% 4.10/2.25  #Define  : 0
% 4.10/2.25  #Split   : 1
% 4.10/2.25  #Chain   : 0
% 4.10/2.25  #Close   : 0
% 4.10/2.25  
% 4.10/2.25  Ordering : KBO
% 4.10/2.25  
% 4.10/2.25  Simplification rules
% 4.10/2.25  ----------------------
% 4.10/2.25  #Subsume      : 28
% 4.10/2.25  #Demod        : 1
% 4.10/2.25  #Tautology    : 2
% 4.10/2.25  #SimpNegUnit  : 15
% 4.10/2.25  #BackRed      : 0
% 4.10/2.25  
% 4.10/2.25  #Partial instantiations: 0
% 4.10/2.25  #Strategies tried      : 1
% 4.10/2.25  
% 4.10/2.25  Timing (in seconds)
% 4.10/2.25  ----------------------
% 4.10/2.26  Preprocessing        : 0.81
% 4.10/2.26  Parsing              : 0.44
% 4.10/2.26  CNF conversion       : 0.06
% 4.10/2.26  Main loop            : 0.31
% 4.10/2.26  Inferencing          : 0.10
% 4.10/2.26  Reduction            : 0.08
% 4.10/2.26  Demodulation         : 0.05
% 4.10/2.26  BG Simplification    : 0.04
% 4.10/2.26  Subsumption          : 0.09
% 4.10/2.26  Abstraction          : 0.01
% 4.10/2.26  MUC search           : 0.00
% 4.10/2.26  Cooper               : 0.00
% 4.10/2.26  Total                : 1.18
% 4.10/2.26  Index Insertion      : 0.00
% 4.10/2.26  Index Deletion       : 0.00
% 4.10/2.26  Index Matching       : 0.00
% 4.10/2.26  BG Taut test         : 0.00
%------------------------------------------------------------------------------