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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO264+1 : TPTP v8.1.2. Bugfixed v6.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 : n032.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 3.13s 1.69s
% Output   : CNFRefutation 3.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   25 (   3 unt;  20 typ;   0 def)
%            Number of atoms       :    9 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :    7 (   3   ~;   1   |;   1   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   33 (  16   >;  17   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :    8 (;   8   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ between_on_line > divides_points > before_on_line > unequally_directed_lines > left_convergent_lines > left_apart_point > 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_3 > #skF_1 > #skF_4

%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(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(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('#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('#skF_4',type,
    '#skF_4': $i ).

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(f_161,axiom,
    ! [A,L] :
      ~ ( left_apart_point(A,L)
        | left_apart_point(A,reverse_line(L)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag10) ).

tff(f_286,negated_conjecture,
    ~ ! [A,B,C,D] :
        ( left_apart_point(C,line_connecting(A,B))
       => ( ( left_apart_point(D,reverse_line(line_connecting(B,C)))
            & left_apart_point(D,reverse_line(line_connecting(C,A))) )
         => left_apart_point(D,line_connecting(A,B)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

tff(c_78,plain,
    ! [A_34,L_35] : ~ left_apart_point(A_34,reverse_line(L_35)),
    inference(cnfTransformation,[status(thm)],[f_161]) ).

tff(c_122,plain,
    left_apart_point('#skF_4',reverse_line(line_connecting('#skF_2','#skF_3'))),
    inference(cnfTransformation,[status(thm)],[f_286]) ).

tff(c_127,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_78,c_122]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : GEO264+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.00/0.12  % 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.12/0.32  % Computer : n032.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Fri Aug  4 00:41:51 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 3.13/1.69  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.13/1.69  
% 3.13/1.69  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.13/1.72  
% 3.13/1.72  Inference rules
% 3.13/1.72  ----------------------
% 3.13/1.72  #Ref     : 0
% 3.13/1.72  #Sup     : 0
% 3.13/1.72  #Fact    : 0
% 3.13/1.72  #Define  : 0
% 3.13/1.72  #Split   : 0
% 3.13/1.72  #Chain   : 0
% 3.13/1.72  #Close   : 0
% 3.13/1.72  
% 3.13/1.72  Ordering : KBO
% 3.13/1.72  
% 3.13/1.73  Simplification rules
% 3.13/1.73  ----------------------
% 3.13/1.73  #Subsume      : 61
% 3.13/1.73  #Demod        : 0
% 3.13/1.73  #Tautology    : 0
% 3.13/1.73  #SimpNegUnit  : 6
% 3.13/1.73  #BackRed      : 0
% 3.13/1.73  
% 3.13/1.73  #Partial instantiations: 0
% 3.13/1.73  #Strategies tried      : 1
% 3.13/1.73  
% 3.13/1.73  Timing (in seconds)
% 3.13/1.73  ----------------------
% 3.13/1.73  Preprocessing        : 0.57
% 3.13/1.73  Parsing              : 0.31
% 3.13/1.73  CNF conversion       : 0.04
% 3.13/1.73  Main loop            : 0.11
% 3.13/1.73  Inferencing          : 0.00
% 3.13/1.73  Reduction            : 0.05
% 3.13/1.73  Demodulation         : 0.04
% 3.13/1.73  BG Simplification    : 0.03
% 3.13/1.73  Subsumption          : 0.05
% 3.13/1.73  Abstraction          : 0.01
% 3.13/1.73  MUC search           : 0.00
% 3.13/1.73  Cooper               : 0.00
% 3.13/1.73  Total                : 0.74
% 3.13/1.73  Index Insertion      : 0.00
% 3.13/1.73  Index Deletion       : 0.00
% 3.13/1.73  Index Matching       : 0.00
% 3.13/1.73  BG Taut test         : 0.00
%------------------------------------------------------------------------------