↑ Up

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

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

% Computer : n016.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:26 AM UTC 2026

% Result   : Theorem 0.14s 0.58s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   26 (  12 unt;   0 def)
%            Number of atoms       :   56 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   49 (  19   ~;  10   |;  14   &)
%                                         (   1 <=>;   5  =>;   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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   50 (   7 sgn  21   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(apart2,axiom,
    ! [X] : ~ distinct_lines(X,X),
    file('theBenchmark.p',apart2) ).

fof(apart5,axiom,
    ! [X,Y,Z] :
      ( distinct_lines(X,Y)
     => ( distinct_lines(Y,Z)
        | distinct_lines(X,Z) ) ),
    file('theBenchmark.p',apart5) ).

fof(ceq2,axiom,
    ! [X,Y,Z] :
      ( apart_point_and_line(X,Y)
     => ( apart_point_and_line(X,Z)
        | distinct_lines(Y,Z) ) ),
    file('theBenchmark.p',ceq2) ).

fof(p1,axiom,
    ! [X,Y] :
      ( distinct_lines(X,Y)
     => convergent_lines(X,Y) ),
    file('theBenchmark.p',p1) ).

fof(cp1,axiom,
    ! [X,Y] : ~ convergent_lines(parallel_through_point(Y,X),Y),
    file('theBenchmark.p',cp1) ).

fof(cp2,axiom,
    ! [X,Y] : ~ apart_point_and_line(X,parallel_through_point(Y,X)),
    file('theBenchmark.p',cp2) ).

fof(a4,axiom,
    ! [X,Y] :
      ( incident_point_and_line(X,Y)
    <=> ~ apart_point_and_line(X,Y) ),
    file('theBenchmark.p',a4) ).

fof(con,conjecture,
    ! [X,Y,Z] :
      ( ( incident_point_and_line(intersection_point(X,Y),Z)
        & convergent_lines(X,Z)
        & convergent_lines(Z,Y)
        & convergent_lines(X,Y) )
     => incident_point_and_line(intersection_point(Y,X),Z) ),
    file('theBenchmark.p',con) ).

fof(con_neg,negated_conjecture,
    ~ ! [X,Y,Z] :
        ( ( incident_point_and_line(intersection_point(X,Y),Z)
          & convergent_lines(X,Z)
          & convergent_lines(Z,Y)
          & convergent_lines(X,Y) )
       => incident_point_and_line(intersection_point(Y,X),Z) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(nnf_36,plain,
    ? [X,Y,Z] :
      ( ~ incident_point_and_line(intersection_point(Y,X),Z)
      & incident_point_and_line(intersection_point(X,Y),Z)
      & convergent_lines(X,Z)
      & convergent_lines(Z,Y)
      & convergent_lines(X,Y) ),
    inference(fof_nnf,[status(thm)],[con_neg]) ).

fof(sk_con_neg,plain,
    ( ~ incident_point_and_line(intersection_point(sK0,sK1),sK2)
    & incident_point_and_line(intersection_point(sK1,sK0),sK2)
    & convergent_lines(sK1,sK2)
    & convergent_lines(sK2,sK0)
    & convergent_lines(sK1,sK0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK0,sK2]),skolemize(X,sK1),skolemize(Y,sK0),skolemize(Z,sK2)],[nnf_36]) ).

cnf(c_44,negated_conjecture,
    ~ incident_point_and_line(intersection_point(sK0,sK1),sK2),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_45,plain,
    ( apart_point_and_line(A,B)
    | incident_point_and_line(A,B) ),
    inference(clausify,[status(thm)],[a4]) ).

cnf(c_69,plain,
    ~ apart_point_and_line(A,parallel_through_point(B,A)),
    inference(clausify,[status(thm)],[cp2]) ).

cnf(c_70,plain,
    ~ convergent_lines(parallel_through_point(A,B),A),
    inference(clausify,[status(thm)],[cp1]) ).

cnf(c_71,plain,
    ( convergent_lines(A,B)
    | ~ distinct_lines(A,B) ),
    inference(clausify,[status(thm)],[p1]) ).

cnf(c_73,plain,
    ( apart_point_and_line(A,C)
    | distinct_lines(B,C)
    | ~ apart_point_and_line(A,B) ),
    inference(clausify,[status(thm)],[ceq2]) ).

cnf(c_81,plain,
    ( distinct_lines(B,C)
    | distinct_lines(A,C)
    | ~ distinct_lines(A,B) ),
    inference(clausify,[status(thm)],[apart5]) ).

cnf(c_84,plain,
    ~ distinct_lines(A,A),
    inference(clausify,[status(thm)],[apart2]) ).

cnf(c_86,negated_conjecture,
    apart_point_and_line(intersection_point(sK0,sK1),sK2),
    inference(resolve,[status(thm)],[c_45,c_44]) ).

cnf(c_95,plain,
    ~ distinct_lines(parallel_through_point(A,B),A),
    inference(resolve,[status(thm)],[c_71,c_70]) ).

cnf(c_182,plain,
    ( distinct_lines(B,A)
    | ~ distinct_lines(A,B) ),
    inference(resolve,[status(thm)],[c_81,c_84]) ).

cnf(c_113,plain,
    ~ distinct_lines(A,parallel_through_point(A,B)),
    inference(resolve,[status(thm)],[c_182,c_95]) ).

cnf(c_183,plain,
    ( apart_point_and_line(A,parallel_through_point(B,C))
    | ~ apart_point_and_line(A,B) ),
    inference(resolve,[status(thm)],[c_73,c_113]) ).

cnf(c_180,plain,
    ~ apart_point_and_line(A,B),
    inference(resolve,[status(thm)],[c_183,c_69]) ).

cnf(c_181,plain,
    $false,
    inference(resolve,[status(thm)],[c_180,c_86]) ).

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