↑ Up

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

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(cup1,axiom,
    ! [X,Y,Z] :
      ( distinct_lines(Y,Z)
     => ( convergent_lines(Y,Z)
        | apart_point_and_line(X,Z)
        | apart_point_and_line(X,Y) ) ),
    file('theBenchmark.p',cup1) ).

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

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

cnf(c_33,plain,
    ( convergent_lines(A,B)
    | apart_point_and_line(C,B)
    | apart_point_and_line(C,A)
    | ~ distinct_lines(A,B) ),
    inference(clausify,[status(thm)],[cup1]) ).

fof(nnf_16,plain,
    ? [X,Y,Z] :
      ( distinct_lines(Y,Z)
      & ~ convergent_lines(Y,Z)
      & ~ apart_point_and_line(X,Z)
      & ~ apart_point_and_line(X,Y) ),
    inference(fof_nnf,[status(thm)],[con_neg]) ).

fof(sk_con_neg,plain,
    ( distinct_lines(sK1,sK2)
    & ~ convergent_lines(sK1,sK2)
    & ~ apart_point_and_line(sK0,sK2)
    & ~ apart_point_and_line(sK0,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X,sK0),skolemize(Y,sK1),skolemize(Z,sK2)],[nnf_16]) ).

cnf(c_34,negated_conjecture,
    ~ apart_point_and_line(sK0,sK1),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_35,negated_conjecture,
    ~ apart_point_and_line(sK0,sK2),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_36,negated_conjecture,
    ~ convergent_lines(sK1,sK2),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_37,negated_conjecture,
    distinct_lines(sK1,sK2),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_44,negated_conjecture,
    ( convergent_lines(sK1,A)
    | apart_point_and_line(sK0,A)
    | ~ distinct_lines(sK1,A) ),
    inference(resolve,[status(thm)],[c_33,c_34]) ).

cnf(c_45,negated_conjecture,
    ( convergent_lines(sK1,sK2)
    | ~ distinct_lines(sK1,sK2) ),
    inference(resolve,[status(thm)],[c_44,c_35]) ).

cnf(c_46,negated_conjecture,
    ~ distinct_lines(sK1,sK2),
    inference(resolve,[status(thm)],[c_45,c_36]) ).

cnf(c_43,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_37,c_46]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GEO208+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.08/0.36  % Computer : n011.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Fri Sep 25 13:05:44 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36  % Process 2080817 was started by sandbox on n011,
% 0.08/0.36  % Fri Sep 25 13:05:44 2026
% 0.08/0.36  % 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.08/0.38  
% 0.08/0.38  % SZS status Theorem for theBenchmark
% 0.08/0.38  
% 0.08/0.38  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/0.38  % Length of proof is 8.
% 0.08/0.38  % Level of proof is 2.
% 0.08/0.38  % Maximum clause weight is 12.000.
% 0.08/0.38  % Given clauses 20.
% 0.08/0.38  
% 0.08/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------