↑ Up

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

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

% Computer : n005.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:17 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(con1,axiom,
    ! [X,Y,Z] :
      ( distinct_points(X,Y)
     => ( apart_point_and_line(Z,line_connecting(X,Y))
       => ( distinct_points(Z,Y)
          & distinct_points(Z,X) ) ) ),
    file('theBenchmark.p',con1) ).

fof(con,conjecture,
    ! [X,Y,Z] :
      ( ( apart_point_and_line(Z,line_connecting(X,Y))
        & distinct_points(X,Y) )
     => ( distinct_points(Z,Y)
        & distinct_points(Z,X) ) ),
    file('theBenchmark.p',con) ).

fof(con_neg,negated_conjecture,
    ~ ! [X,Y,Z] :
        ( ( apart_point_and_line(Z,line_connecting(X,Y))
          & distinct_points(X,Y) )
       => ( distinct_points(Z,Y)
          & distinct_points(Z,X) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

cnf(c_20,plain,
    ( distinct_points(C,A)
    | ~ apart_point_and_line(C,line_connecting(A,B))
    | ~ distinct_points(A,B) ),
    inference(clausify,[status(thm)],[con1]) ).

cnf(c_21,plain,
    ( distinct_points(C,B)
    | ~ apart_point_and_line(C,line_connecting(A,B))
    | ~ distinct_points(A,B) ),
    inference(clausify,[status(thm)],[con1]) ).

fof(nnf_13,plain,
    ? [X,Y,Z] :
      ( ( ~ distinct_points(Z,Y)
        | ~ distinct_points(Z,X) )
      & apart_point_and_line(Z,line_connecting(X,Y))
      & distinct_points(X,Y) ),
    inference(fof_nnf,[status(thm)],[con_neg]) ).

fof(sk_con_neg,plain,
    ( ( ~ distinct_points(sK2,sK1)
      | ~ distinct_points(sK2,sK0) )
    & apart_point_and_line(sK2,line_connecting(sK0,sK1))
    & distinct_points(sK0,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X,sK0),skolemize(Y,sK1),skolemize(Z,sK2)],[nnf_13]) ).

cnf(c_28,negated_conjecture,
    distinct_points(sK0,sK1),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

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

cnf(c_30,negated_conjecture,
    ( ~ distinct_points(sK2,sK1)
    | ~ distinct_points(sK2,sK0) ),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_31,plain,
    ( distinct_points(A,sK1)
    | ~ apart_point_and_line(A,line_connecting(sK0,sK1)) ),
    inference(resolve,[status(thm)],[c_28,c_21]) ).

cnf(c_38,plain,
    distinct_points(sK2,sK1),
    inference(resolve,[status(thm)],[c_31,c_29]) ).

cnf(c_39,negated_conjecture,
    ~ distinct_points(sK2,sK0),
    inference(resolve,[status(thm)],[c_38,c_30]) ).

cnf(c_41,negated_conjecture,
    ( distinct_points(sK2,sK0)
    | ~ distinct_points(sK0,sK1) ),
    inference(resolve,[status(thm)],[c_20,c_29]) ).

cnf(c_42,negated_conjecture,
    ~ distinct_points(sK0,sK1),
    inference(resolve,[status(thm)],[c_41,c_39]) ).

cnf(c_40,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_28,c_42]) ).

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