↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN379+1 : TPTP v9.3.1. Released v2.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 09:37:45 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(x2131,conjecture,
    ( ! [X] : big_p(X)
   => ? [Y] :
        ( ! [X,Z] : big_q(X,Y,Z)
       => ~ ! [Z] :
              ( ~ big_q(Y,Y,Z)
              & big_p(Z) ) ) ),
    file('theBenchmark.p',x2131) ).

fof(x2131_neg,negated_conjecture,
    ~ ( ! [X] : big_p(X)
     => ? [Y] :
          ( ! [X,Z] : big_q(X,Y,Z)
         => ~ ! [Z] :
                ( ~ big_q(Y,Y,Z)
                & big_p(Z) ) ) ),
    inference(assume_negation,[status(cth)],[x2131]) ).

cnf(c_2,negated_conjecture,
    big_q(A,B,C),
    inference(clausify,[status(thm)],[x2131_neg]) ).

cnf(c_3,negated_conjecture,
    ~ big_q(A,A,B),
    inference(clausify,[status(thm)],[x2131_neg]) ).

cnf(c_4,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_2,c_3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN379+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n018.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 26 17:41:38 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36  % Process 1025353 was started by sandbox2 on n018,
% 0.09/0.36  % Sat Sep 26 17:41:38 2026
% 0.09/0.36  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.37  
% 0.09/0.37  % From the command line: assign(max_seconds, 300).
% 0.09/0.37  
% 0.09/0.37  % SZS status Theorem for theBenchmark
% 0.09/0.37  
% 0.09/0.37  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.37  % Length of proof is 4.
% 0.09/0.37  % Level of proof is 2.
% 0.09/0.37  % Maximum clause weight is 0.000.
% 0.09/0.37  % Given clauses 0.
% 0.09/0.37  
% 0.09/0.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------