↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : GEO225+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 07:17:35 AM UTC 2026

% Result   : Theorem 0.10s 0.38s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (   5 unt;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   38 (  13   ~;   5   |;  14   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn  10   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ci1,axiom,
    ! [X,Y] :
      ( distinct_points(X,Y)
     => ~ apart_point_and_line(X,line_connecting(X,Y)) ),
    file('theBenchmark.p',ci1) ).

fof(ci2,axiom,
    ! [X,Y] :
      ( distinct_points(X,Y)
     => ~ apart_point_and_line(Y,line_connecting(X,Y)) ),
    file('theBenchmark.p',ci2) ).

fof(con,conjecture,
    ! [A,B] :
      ( ( distinct_points(A,B)
        & point(B)
        & point(A) )
     => ? [X] :
          ( line(X)
         => ( ~ apart_point_and_line(B,X)
            & ~ apart_point_and_line(A,X) ) ) ),
    file('theBenchmark.p',con) ).

fof(con_neg,negated_conjecture,
    ~ ! [A,B] :
        ( ( distinct_points(A,B)
          & point(B)
          & point(A) )
       => ? [X] :
            ( line(X)
           => ( ~ apart_point_and_line(B,X)
              & ~ apart_point_and_line(A,X) ) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

cnf(c_26,plain,
    ( ~ apart_point_and_line(A,line_connecting(A,B))
    | ~ distinct_points(A,B) ),
    inference(clausify,[status(thm)],[ci1]) ).

cnf(c_27,plain,
    ( ~ apart_point_and_line(B,line_connecting(A,B))
    | ~ distinct_points(A,B) ),
    inference(clausify,[status(thm)],[ci2]) ).

fof(nnf_19,plain,
    ? [A,B] :
      ( ! [X] :
          ( ( apart_point_and_line(B,X)
            | apart_point_and_line(A,X) )
          & line(X) )
      & distinct_points(A,B)
      & point(B)
      & point(A) ),
    inference(fof_nnf,[status(thm)],[con_neg]) ).

fof(sk_con_neg,plain,
    ( ! [X] :
        ( ( apart_point_and_line(sK1,X)
          | apart_point_and_line(sK0,X) )
        & line(X) )
    & distinct_points(sK0,sK1)
    & point(sK1)
    & point(sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(A,sK0),skolemize(B,sK1)],[nnf_19]) ).

cnf(c_40,negated_conjecture,
    distinct_points(sK0,sK1),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_42,negated_conjecture,
    ( apart_point_and_line(sK1,A)
    | apart_point_and_line(sK0,A) ),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_44,plain,
    ~ apart_point_and_line(sK1,line_connecting(sK0,sK1)),
    inference(resolve,[status(thm)],[c_40,c_27]) ).

cnf(c_45,plain,
    ~ apart_point_and_line(sK0,line_connecting(sK0,sK1)),
    inference(resolve,[status(thm)],[c_40,c_26]) ).

cnf(c_51,negated_conjecture,
    apart_point_and_line(sK0,line_connecting(sK0,sK1)),
    inference(resolve,[status(thm)],[c_44,c_42]) ).

cnf(c_50,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_45,c_51]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO225+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.35  % Computer : n004.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Fri Sep 25 13:08:21 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.35  % Process 3234185 was started by sandbox2 on n004,
% 0.10/0.35  % Fri Sep 25 13:08:21 2026
% 0.10/0.35  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.36  
% 0.10/0.36  % From the command line: assign(max_seconds, 300).
% 0.10/0.38  
% 0.10/0.38  % SZS status Theorem for theBenchmark
% 0.10/0.38  
% 0.10/0.38  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.38  % Length of proof is 10.
% 0.10/0.38  % Level of proof is 3.
% 0.10/0.38  % Maximum clause weight is 8.000.
% 0.10/0.38  % Given clauses 21.
% 0.10/0.38  
% 0.10/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------