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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO258+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/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 : n005.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:55 EDT 2023

% Result   : Theorem 5.08s 2.30s
% Output   : CNFRefutation 5.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   47 (  11 unt;  20 typ;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   46 (  20   ~;  22   |;   2   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   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   :   36 (;  36   !;   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_282,negated_conjecture,
    ~ ! [L,A,B,C] :
        ( between_on_line(L,A,B,C)
       => between_on_line(L,C,B,A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

tff(f_100,axiom,
    ! [L,A,B,C] :
      ( between_on_line(L,A,B,C)
    <=> ( ( before_on_line(L,A,B)
          & before_on_line(L,B,C) )
        | ( before_on_line(L,C,B)
          & before_on_line(L,B,A) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',bet_def) ).

tff(c_120,plain,
    between_on_line('#skF_1','#skF_2','#skF_3','#skF_4'),
    inference(cnfTransformation,[status(thm)],[f_282]) ).

tff(c_391,plain,
    ! [L_169,A_170,B_171,C_172] :
      ( before_on_line(L_169,A_170,B_171)
      | before_on_line(L_169,B_171,A_170)
      | ~ between_on_line(L_169,A_170,B_171,C_172) ),
    inference(cnfTransformation,[status(thm)],[f_100]) ).

tff(c_395,plain,
    ( before_on_line('#skF_1','#skF_2','#skF_3')
    | before_on_line('#skF_1','#skF_3','#skF_2') ),
    inference(resolution,[status(thm)],[c_120,c_391]) ).

tff(c_396,plain,
    before_on_line('#skF_1','#skF_3','#skF_2'),
    inference(splitLeft,[status(thm)],[c_395]) ).

tff(c_918,plain,
    ! [L_200,B_201,C_202,A_203] :
      ( ~ before_on_line(L_200,B_201,C_202)
      | ~ before_on_line(L_200,A_203,B_201)
      | between_on_line(L_200,A_203,B_201,C_202) ),
    inference(cnfTransformation,[status(thm)],[f_100]) ).

tff(c_118,plain,
    ~ between_on_line('#skF_1','#skF_4','#skF_3','#skF_2'),
    inference(cnfTransformation,[status(thm)],[f_282]) ).

tff(c_927,plain,
    ( ~ before_on_line('#skF_1','#skF_3','#skF_2')
    | ~ before_on_line('#skF_1','#skF_4','#skF_3') ),
    inference(resolution,[status(thm)],[c_918,c_118]) ).

tff(c_932,plain,
    ~ before_on_line('#skF_1','#skF_4','#skF_3'),
    inference(demodulation,[status(thm),theory(equality)],[c_396,c_927]) ).

tff(c_1104,plain,
    ! [L_215,A_216,B_217,C_218] :
      ( before_on_line(L_215,A_216,B_217)
      | before_on_line(L_215,C_218,B_217)
      | ~ between_on_line(L_215,A_216,B_217,C_218) ),
    inference(cnfTransformation,[status(thm)],[f_100]) ).

tff(c_1110,plain,
    ( before_on_line('#skF_1','#skF_2','#skF_3')
    | before_on_line('#skF_1','#skF_4','#skF_3') ),
    inference(resolution,[status(thm)],[c_120,c_1104]) ).

tff(c_1114,plain,
    before_on_line('#skF_1','#skF_2','#skF_3'),
    inference(negUnitSimplification,[status(thm)],[c_932,c_1110]) ).

tff(c_1308,plain,
    ! [L_230,B_231,C_232,A_233] :
      ( before_on_line(L_230,B_231,C_232)
      | before_on_line(L_230,C_232,B_231)
      | ~ between_on_line(L_230,A_233,B_231,C_232) ),
    inference(cnfTransformation,[status(thm)],[f_100]) ).

tff(c_1314,plain,
    ( before_on_line('#skF_1','#skF_3','#skF_4')
    | before_on_line('#skF_1','#skF_4','#skF_3') ),
    inference(resolution,[status(thm)],[c_120,c_1308]) ).

tff(c_1318,plain,
    before_on_line('#skF_1','#skF_3','#skF_4'),
    inference(negUnitSimplification,[status(thm)],[c_932,c_1314]) ).

tff(c_1516,plain,
    ! [L_243,B_244,A_245,C_246] :
      ( ~ before_on_line(L_243,B_244,A_245)
      | ~ before_on_line(L_243,C_246,B_244)
      | between_on_line(L_243,A_245,B_244,C_246) ),
    inference(cnfTransformation,[status(thm)],[f_100]) ).

tff(c_1531,plain,
    ( ~ before_on_line('#skF_1','#skF_3','#skF_4')
    | ~ before_on_line('#skF_1','#skF_2','#skF_3') ),
    inference(resolution,[status(thm)],[c_1516,c_118]) ).

tff(c_1539,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1114,c_1318,c_1531]) ).

tff(c_1540,plain,
    before_on_line('#skF_1','#skF_2','#skF_3'),
    inference(splitRight,[status(thm)],[c_395]) ).

tff(c_1541,plain,
    ~ before_on_line('#skF_1','#skF_3','#skF_2'),
    inference(splitRight,[status(thm)],[c_395]) ).

tff(c_1729,plain,
    ! [L_255,B_256,C_257,A_258] :
      ( before_on_line(L_255,B_256,C_257)
      | before_on_line(L_255,B_256,A_258)
      | ~ between_on_line(L_255,A_258,B_256,C_257) ),
    inference(cnfTransformation,[status(thm)],[f_100]) ).

tff(c_1732,plain,
    ( before_on_line('#skF_1','#skF_3','#skF_4')
    | before_on_line('#skF_1','#skF_3','#skF_2') ),
    inference(resolution,[status(thm)],[c_120,c_1729]) ).

tff(c_1735,plain,
    before_on_line('#skF_1','#skF_3','#skF_4'),
    inference(negUnitSimplification,[status(thm)],[c_1541,c_1732]) ).

tff(c_1933,plain,
    ! [L_268,B_269,A_270,C_271] :
      ( ~ before_on_line(L_268,B_269,A_270)
      | ~ before_on_line(L_268,C_271,B_269)
      | between_on_line(L_268,A_270,B_269,C_271) ),
    inference(cnfTransformation,[status(thm)],[f_100]) ).

tff(c_1942,plain,
    ( ~ before_on_line('#skF_1','#skF_3','#skF_4')
    | ~ before_on_line('#skF_1','#skF_2','#skF_3') ),
    inference(resolution,[status(thm)],[c_1933,c_118]) ).

tff(c_1948,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_1540,c_1735,c_1942]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : GEO258+1 : TPTP v8.1.2. Bugfixed v6.4.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.18/0.36  % Computer : n005.cluster.edu
% 0.18/0.36  % Model    : x86_64 x86_64
% 0.18/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36  % Memory   : 8042.1875MB
% 0.18/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36  % CPULimit : 300
% 0.18/0.36  % WCLimit  : 300
% 0.18/0.36  % DateTime : Fri Aug  4 00:31:26 EDT 2023
% 0.18/0.36  % CPUTime  : 
% 5.08/2.30  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.08/2.31  
% 5.08/2.31  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.37/2.34  
% 5.37/2.34  Inference rules
% 5.37/2.34  ----------------------
% 5.37/2.34  #Ref     : 0
% 5.37/2.34  #Sup     : 252
% 5.37/2.34  #Fact    : 74
% 5.37/2.34  #Define  : 0
% 5.37/2.34  #Split   : 2
% 5.37/2.34  #Chain   : 0
% 5.37/2.34  #Close   : 0
% 5.37/2.34  
% 5.37/2.34  Ordering : KBO
% 5.37/2.34  
% 5.37/2.34  Simplification rules
% 5.37/2.34  ----------------------
% 5.37/2.34  #Subsume      : 134
% 5.37/2.34  #Demod        : 73
% 5.37/2.34  #Tautology    : 84
% 5.37/2.34  #SimpNegUnit  : 37
% 5.37/2.34  #BackRed      : 1
% 5.37/2.34  
% 5.37/2.34  #Partial instantiations: 0
% 5.37/2.34  #Strategies tried      : 1
% 5.37/2.34  
% 5.37/2.34  Timing (in seconds)
% 5.37/2.34  ----------------------
% 5.37/2.34  Preprocessing        : 0.57
% 5.37/2.34  Parsing              : 0.32
% 5.37/2.34  CNF conversion       : 0.04
% 5.37/2.34  Main loop            : 0.63
% 5.37/2.34  Inferencing          : 0.25
% 5.37/2.34  Reduction            : 0.15
% 5.37/2.34  Demodulation         : 0.09
% 5.37/2.34  BG Simplification    : 0.03
% 5.37/2.34  Subsumption          : 0.16
% 5.37/2.34  Abstraction          : 0.02
% 5.37/2.35  MUC search           : 0.00
% 5.37/2.35  Cooper               : 0.00
% 5.37/2.35  Total                : 1.25
% 5.37/2.35  Index Insertion      : 0.00
% 5.37/2.35  Index Deletion       : 0.00
% 5.37/2.35  Index Matching       : 0.00
% 5.37/2.35  BG Taut test         : 0.00
%------------------------------------------------------------------------------