↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : LCL666+1.001 : 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 : n018.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:59:25 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(reflexivity,axiom,
    ! [X] : r1(X,X),
    file('theBenchmark.p',reflexivity) ).

fof(main,conjecture,
    ~ ? [X] :
        ~ ( ~ ( p101(X)
              & p201(X) )
          | ~ ! [Y] :
                ( ~ ( p101(Y)
                    & p201(Y) )
                | ~ r1(X,Y) ) ),
    file('theBenchmark.p',main) ).

fof(main_neg,negated_conjecture,
    ~ ~ ? [X] :
          ~ ( ~ ( p101(X)
                & p201(X) )
            | ~ ! [Y] :
                  ( ~ ( p101(Y)
                      & p201(Y) )
                  | ~ r1(X,Y) ) ),
    inference(assume_negation,[status(cth)],[main]) ).

fof(nnf_2,plain,
    ? [X] :
      ( p101(X)
      & p201(X)
      & ! [Y] :
          ( ~ p101(Y)
          | ~ p201(Y)
          | ~ r1(X,Y) ) ),
    inference(fof_nnf,[status(thm)],[main_neg]) ).

fof(sk_main_neg,plain,
    ( p101(sK0)
    & p201(sK0)
    & ! [Y] :
        ( ~ p101(Y)
        | ~ p201(Y)
        | ~ r1(sK0,Y) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X,sK0)],[nnf_2]) ).

cnf(c_3,negated_conjecture,
    ( ~ p101(A)
    | ~ p201(A)
    | ~ r1(sK0,A) ),
    inference(split_conjunct,[status(thm)],[sk_main_neg]) ).

cnf(c_4,plain,
    r1(A,A),
    inference(clausify,[status(thm)],[reflexivity]) ).

cnf(c_5,negated_conjecture,
    p201(sK0),
    inference(split_conjunct,[status(thm)],[sk_main_neg]) ).

cnf(c_6,negated_conjecture,
    ( ~ p101(sK0)
    | ~ p201(sK0) ),
    inference(resolve,[status(thm)],[c_3,c_4]) ).

cnf(c_7,negated_conjecture,
    p101(sK0),
    inference(split_conjunct,[status(thm)],[sk_main_neg]) ).

cnf(c_8,negated_conjecture,
    ~ p101(sK0),
    inference(resolve,[status(thm)],[c_5,c_6]) ).

cnf(c_9,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_7,c_8]) ).

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