↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : GEO247+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 : n013.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:41 AM UTC 2026

% Result   : Theorem 0.09s 0.37s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   4 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    9 (   4 avg)
%            Number of connectives :   41 (   6   ~;   2   |;  30   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-1 aty)
%            Number of variables   :   26 (   2 sgn  16   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(a2_defns,axiom,
    ! [X,Y] :
      ( right_apart_point(X,Y)
    <=> left_apart_point(X,reverse_line(Y)) ),
    file('theBenchmark.p',a2_defns) ).

fof(ax10_basics,axiom,
    ! [A,L] :
      ~ ( left_apart_point(A,reverse_line(L))
        | left_apart_point(A,L) ),
    file('theBenchmark.p',ax10_basics) ).

fof(con,conjecture,
    ! [A,B,C,D,L,M] :
      ( ( left_apart_point(D,M)
        & right_apart_point(D,L)
        & right_apart_point(C,M)
        & left_apart_point(C,L)
        & right_apart_point(B,M)
        & right_apart_point(B,L)
        & left_apart_point(A,M)
        & left_apart_point(A,L) )
     => convergent_lines(L,M) ),
    file('theBenchmark.p',con) ).

fof(con_neg,negated_conjecture,
    ~ ! [A,B,C,D,L,M] :
        ( ( left_apart_point(D,M)
          & right_apart_point(D,L)
          & right_apart_point(C,M)
          & left_apart_point(C,L)
          & right_apart_point(B,M)
          & right_apart_point(B,L)
          & left_apart_point(A,M)
          & left_apart_point(A,L) )
       => convergent_lines(L,M) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(nnf_37,plain,
    ? [A,B,C,D,L,M] :
      ( ~ convergent_lines(L,M)
      & left_apart_point(D,M)
      & right_apart_point(D,L)
      & right_apart_point(C,M)
      & left_apart_point(C,L)
      & right_apart_point(B,M)
      & right_apart_point(B,L)
      & left_apart_point(A,M)
      & left_apart_point(A,L) ),
    inference(fof_nnf,[status(thm)],[con_neg]) ).

fof(sk_con_neg,plain,
    ( ~ convergent_lines(sK1,sK3)
    & left_apart_point(sK5,sK3)
    & right_apart_point(sK5,sK1)
    & right_apart_point(sK4,sK3)
    & left_apart_point(sK4,sK1)
    & right_apart_point(sK0,sK3)
    & right_apart_point(sK0,sK1)
    & left_apart_point(sK2,sK3)
    & left_apart_point(sK2,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK1,sK3,sK0,sK4,sK5]),skolemize(A,sK2),skolemize(B,sK0),skolemize(C,sK4),skolemize(D,sK5),skolemize(L,sK1),skolemize(M,sK3)],[nnf_37]) ).

cnf(c_85,negated_conjecture,
    right_apart_point(sK0,sK1),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_87,plain,
    ( left_apart_point(A,reverse_line(B))
    | ~ right_apart_point(A,B) ),
    inference(clausify,[status(thm)],[a2_defns]) ).

cnf(c_106,negated_conjecture,
    left_apart_point(sK0,reverse_line(sK1)),
    inference(resolve,[status(thm)],[c_87,c_85]) ).

cnf(c_122,plain,
    ~ left_apart_point(A,B),
    inference(clausify,[status(thm)],[ax10_basics]) ).

cnf(c_123,plain,
    $false,
    inference(resolve,[status(thm)],[c_122,c_106]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO247+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.09/0.34  % Computer : n013.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit : 300
% 0.09/0.34  % WCLimit  : 300
% 0.09/0.34  % DateTime : Fri Sep 25 13:10:06 UTC 2026
% 0.09/0.34  % CPUTime  : 
% 0.09/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35  % Process 502184 was started by sandbox2 on n013,
% 0.09/0.35  % Fri Sep 25 13:10:06 2026
% 0.09/0.35  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.36  
% 0.09/0.36  % From the command line: assign(max_seconds, 300).
% 0.09/0.37  
% 0.09/0.37  % SZS status Theorem for theBenchmark
% 0.09/0.37  
% 0.09/0.37  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.09/0.37  % Length of proof is 8.
% 0.09/0.37  % Level of proof is 3.
% 0.09/0.37  % Maximum clause weight is 4.000.
% 0.09/0.37  % Given clauses 0.
% 0.09/0.37  
% 0.09/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------