↑ Up

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

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

% Computer : n002.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:39 AM UTC 2026

% Result   : Theorem 0.12s 0.38s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   15 (   5 unt;   0 def)
%            Number of atoms       :   33 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   26 (   8   ~;   6   |;   8   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   28 (   5 sgn  15   !;   4   ?)

% 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(a8_defns,axiom,
    ! [A,B,L] :
      ( divides_points(L,A,B)
    <=> ( ( left_apart_point(B,L)
          & right_apart_point(A,L) )
        | ( right_apart_point(B,L)
          & left_apart_point(A,L) ) ) ),
    file('theBenchmark.p',a8_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,L] :
      ( ( divides_points(L,A,C)
        & divides_points(L,A,B) )
     => ~ divides_points(L,B,C) ),
    file('theBenchmark.p',con) ).

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

cnf(c_71,plain,
    ( left_apart_point(C,A)
    | right_apart_point(C,A)
    | ~ divides_points(A,B,C) ),
    inference(clausify,[status(thm)],[a8_defns]) ).

fof(nnf_37,plain,
    ? [A,B,C,L] :
      ( divides_points(L,B,C)
      & divides_points(L,A,C)
      & divides_points(L,A,B) ),
    inference(fof_nnf,[status(thm)],[con_neg]) ).

fof(sk_con_neg,plain,
    ( divides_points(sK0,sK2,sK3)
    & divides_points(sK0,sK1,sK3)
    & divides_points(sK0,sK1,sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(A,sK1),skolemize(B,sK2),skolemize(C,sK3),skolemize(L,sK0)],[nnf_37]) ).

cnf(c_76,negated_conjecture,
    divides_points(sK0,sK1,sK2),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_100,negated_conjecture,
    ( left_apart_point(sK2,sK0)
    | right_apart_point(sK2,sK0) ),
    inference(resolve,[status(thm)],[c_76,c_71]) ).

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

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

cnf(c_137,plain,
    ~ right_apart_point(A,B),
    inference(resolve,[status(thm)],[c_127,c_136]) ).

cnf(c_141,negated_conjecture,
    left_apart_point(sK2,sK0),
    inference(resolve,[status(thm)],[c_137,c_100]) ).

cnf(c_140,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_127,c_141]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO238+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n002.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Fri Sep 25 13:12:04 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35  % Process 3344753 was started by sandbox on n002,
% 0.08/0.35  % Fri Sep 25 13:12:04 2026
% 0.08/0.35  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.37  
% 0.08/0.37  % From the command line: assign(max_seconds, 300).
% 0.12/0.38  
% 0.12/0.38  % SZS status Theorem for theBenchmark
% 0.12/0.38  
% 0.12/0.38  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.12/0.38  % Length of proof is 11.
% 0.12/0.38  % Level of proof is 3.
% 0.12/0.38  % Maximum clause weight is 6.000.
% 0.12/0.38  % Given clauses 0.
% 0.12/0.38  
% 0.12/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------