↑ Up

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

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

% Computer : n018.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.17s 0.47s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    8 (   3 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    9 (   5 avg)
%            Number of connectives :   38 (   5   ~;   1   |;  30   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   8 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-1 aty)
%            Number of variables   :   22 (   2 sgn  14   !;   6   ?)

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

fof(con,conjecture,
    ! [A,B,C,D,L,M] :
      ( ( left_apart_point(D,M)
        & left_apart_point(D,reverse_line(L))
        & left_apart_point(C,reverse_line(M))
        & left_apart_point(C,L)
        & left_apart_point(B,reverse_line(M))
        & left_apart_point(B,reverse_line(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)
          & left_apart_point(D,reverse_line(L))
          & left_apart_point(C,reverse_line(M))
          & left_apart_point(C,L)
          & left_apart_point(B,reverse_line(M))
          & left_apart_point(B,reverse_line(L))
          & left_apart_point(A,M)
          & left_apart_point(A,L) )
       => convergent_lines(L,M) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(nnf_32,plain,
    ? [A,B,C,D,L,M] :
      ( ~ convergent_lines(L,M)
      & left_apart_point(D,M)
      & left_apart_point(D,reverse_line(L))
      & left_apart_point(C,reverse_line(M))
      & left_apart_point(C,L)
      & left_apart_point(B,reverse_line(M))
      & left_apart_point(B,reverse_line(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)
    & left_apart_point(sK5,reverse_line(sK1))
    & left_apart_point(sK4,reverse_line(sK3))
    & left_apart_point(sK4,sK1)
    & left_apart_point(sK0,reverse_line(sK3))
    & left_apart_point(sK0,reverse_line(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_32]) ).

cnf(c_79,negated_conjecture,
    left_apart_point(sK0,reverse_line(sK1)),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_96,plain,
    ~ left_apart_point(A,reverse_line(B)),
    inference(clausify,[status(thm)],[oag10]) ).

cnf(c_97,plain,
    $false,
    inference(resolve,[status(thm)],[c_96,c_79]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GEO247+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.44  % Computer : n018.cluster.edu
% 0.17/0.44  % Model    : x86_64 x86_64
% 0.17/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44  % Memory   : 8046.5625MB
% 0.17/0.44  % OS       : Linux 6.8.0-71-generic
% 0.17/0.44  % CPULimit : 300
% 0.17/0.44  % WCLimit  : 300
% 0.17/0.44  % DateTime : Fri Sep 25 13:12:20 UTC 2026
% 0.17/0.44  % CPUTime  : 
% 0.17/0.44  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.44  % Process 2033114 was started by sandbox2 on n018,
% 0.17/0.44  % Fri Sep 25 13:12:20 2026
% 0.17/0.44  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.45  
% 0.17/0.45  % From the command line: assign(max_seconds, 300).
% 0.17/0.47  
% 0.17/0.47  % SZS status Theorem for theBenchmark
% 0.17/0.47  
% 0.17/0.47  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.17/0.47  % Length of proof is 5.
% 0.17/0.47  % Level of proof is 2.
% 0.17/0.47  % Maximum clause weight is 4.000.
% 0.17/0.47  % Given clauses 0.
% 0.17/0.47  
% 0.17/0.47  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------