↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : GEO226+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n014.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 : Fri Sep 25 01:17:37 PM UTC 2026

% Result   : Theorem 3.92s 0.99s
% Output   : Proof 3.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   5 unt;   0 def)
%            Number of atoms       :   47 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   50 (  21   ~;   9   |;  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   :   27 (   0 sgn  18   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f9,axiom,
    ! [X,Y] :
      ( convergent_lines(X,Y)
     => ~ apart_point_and_line(intersection_point(X,Y),Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci4) ).

fof(f9_nnf,plain,
    ! [X,Y] :
      ( ~ apart_point_and_line(intersection_point(X,Y),Y)
      | ~ convergent_lines(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f9]) ).

fof(f9_sk,plain,
    ! [X,Y] :
      ( ~ apart_point_and_line(intersection_point(X,Y),Y)
      | ~ convergent_lines(X,Y) ),
    inference(skolemisation,[status(esa)],[f9_nnf]) ).

cnf(c9,plain,
    ( ~ apart_point_and_line(intersection_point(X0,X1),X1)
    | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

fof(f18,conjecture,
    ! [L,M] :
      ( ( convergent_lines(L,M)
        & line(M)
        & line(L) )
     => ? [X] :
          ( point(X)
         => ( ~ apart_point_and_line(X,M)
            & ~ apart_point_and_line(X,L) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(f18_neg,negated_conjecture,
    ~ ! [L,M] :
        ( ( convergent_lines(L,M)
          & line(M)
          & line(L) )
       => ? [X] :
            ( point(X)
           => ( ~ apart_point_and_line(X,M)
              & ~ apart_point_and_line(X,L) ) ) ),
    inference(negated_conjecture,[status(cth)],[f18]) ).

fof(f18_nnf,plain,
    ? [L,M] :
      ( ! [X] :
          ( ( apart_point_and_line(X,M)
            | apart_point_and_line(X,L) )
          & point(X) )
      & convergent_lines(L,M)
      & line(M)
      & line(L) ),
    inference(nnf_transformation,[status(thm)],[f18_neg]) ).

fof(f18_sk,plain,
    ! [X] :
      ( ( apart_point_and_line(X,sk1)
        | apart_point_and_line(X,sk0) )
      & point(X)
      & convergent_lines(sk0,sk1)
      & line(sk1)
      & line(sk0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f18_nnf]) ).

cnf(c20,plain,
    convergent_lines(sk0,sk1),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(p24,plain,
    ~ apart_point_and_line(intersection_point(sk0,sk1),sk1),
    inference(resolution,[status(thm)],[c9,c20]) ).

cnf(c22,plain,
    ( apart_point_and_line(X2,sk1)
    | apart_point_and_line(X2,sk0) ),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(p25,plain,
    apart_point_and_line(intersection_point(sk0,sk1),sk0),
    inference(resolution,[status(thm)],[p24,c22]) ).

fof(f8,axiom,
    ! [X,Y] :
      ( convergent_lines(X,Y)
     => ~ apart_point_and_line(intersection_point(X,Y),X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ci3) ).

fof(f8_nnf,plain,
    ! [X,Y] :
      ( ~ apart_point_and_line(intersection_point(X,Y),X)
      | ~ convergent_lines(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ! [X,Y] :
      ( ~ apart_point_and_line(intersection_point(X,Y),X)
      | ~ convergent_lines(X,Y) ),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    ( ~ apart_point_and_line(intersection_point(X0,X1),X0)
    | ~ convergent_lines(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(p23,plain,
    ~ apart_point_and_line(intersection_point(sk0,sk1),sk0),
    inference(resolution,[status(thm)],[c8,c20]) ).

cnf(p26,plain,
    $false,
    inference(resolution,[status(thm)],[p25,p23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO226+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.38  % Computer : n014.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Wed Sep 23 11:34:20 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.92/0.99  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.92/0.99  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------