↑ Up

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(apart3,axiom,
    ! [X] : ~ convergent_lines(X,X),
    file('theBenchmark.p',apart3) ).

fof(con,conjecture,
    ! [X] : ~ convergent_lines(X,X),
    file('theBenchmark.p',con) ).

fof(con_neg,negated_conjecture,
    ~ ! [X] : ~ convergent_lines(X,X),
    inference(assume_negation,[status(cth)],[con]) ).

fof(nnf_36,plain,
    ? [X] : convergent_lines(X,X),
    inference(fof_nnf,[status(thm)],[con_neg]) ).

fof(sk_con_neg,plain,
    convergent_lines(sK0,sK0),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X,sK0)],[nnf_36]) ).

cnf(c_47,negated_conjecture,
    convergent_lines(sK0,sK0),
    inference(split_conjunct,[status(thm)],[sk_con_neg]) ).

cnf(c_79,plain,
    ~ convergent_lines(A,A),
    inference(clausify,[status(thm)],[apart3]) ).

cnf(c_80,plain,
    $false,
    inference(resolve,[status(thm)],[c_79,c_47]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO207+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.10/0.53  % Computer : n013.cluster.edu
% 0.10/0.53  % Model    : x86_64 x86_64
% 0.10/0.53  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.53  % Memory   : 8046.5625MB
% 0.10/0.53  % OS       : Linux 6.8.0-71-generic
% 0.10/0.53  % CPULimit : 300
% 0.10/0.53  % WCLimit  : 300
% 0.10/0.53  % DateTime : Fri Sep 25 13:05:21 UTC 2026
% 0.10/0.53  % CPUTime  : 
% 0.10/0.54  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.54  % Process 488663 was started by sandbox on n013,
% 0.10/0.54  % Fri Sep 25 13:05:21 2026
% 0.10/0.54  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.55  
% 0.10/0.55  % From the command line: assign(max_seconds, 300).
% 0.15/0.56  
% 0.15/0.56  % SZS status Theorem for theBenchmark
% 0.15/0.56  
% 0.15/0.56  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/0.56  % Length of proof is 5.
% 0.15/0.56  % Level of proof is 2.
% 0.15/0.56  % Maximum clause weight is 3.000.
% 0.15/0.56  % Given clauses 0.
% 0.15/0.56  
% 0.15/0.56  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------