↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : GEO245+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 : n012.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.07s 0.34s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    8 (   3 unt;   0 def)
%            Number of atoms       :   17 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   14 (   5   ~;   1   |;   4   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   13 (   2 sgn   8   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
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] :
      ( distinct_points(A,B)
     => ( left_apart_point(C,line_connecting(A,B))
       => right_apart_point(B,line_connecting(A,C)) ) ),
    file('theBenchmark.p',con) ).

fof(con_neg,negated_conjecture,
    ~ ! [A,B,C] :
        ( distinct_points(A,B)
       => ( left_apart_point(C,line_connecting(A,B))
         => right_apart_point(B,line_connecting(A,C)) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

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

fof(nnf_37,plain,
    ? [A,B,C] :
      ( ~ right_apart_point(B,line_connecting(A,C))
      & left_apart_point(C,line_connecting(A,B))
      & distinct_points(A,B) ),
    inference(fof_nnf,[status(thm)],[con_neg]) ).

fof(sk_con_neg,plain,
    ( ~ right_apart_point(sK2,line_connecting(sK1,sK0))
    & left_apart_point(sK0,line_connecting(sK1,sK2))
    & distinct_points(sK1,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK0]),skolemize(A,sK1),skolemize(B,sK2),skolemize(C,sK0)],[nnf_37]) ).

cnf(c_128,negated_conjecture,
    left_apart_point(sK0,line_connecting(sK1,sK2)),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_129,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_114,c_128]) ).

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