↑ Up

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

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

% Computer : n020.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:49 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(kalish238,conjecture,
    ( ! [X] : f(X)
   => ? [Y] : f(Y) ),
    file('theBenchmark.p',kalish238) ).

fof(kalish238_neg,negated_conjecture,
    ~ ( ! [X] : f(X)
     => ? [Y] : f(Y) ),
    inference(assume_negation,[status(cth)],[kalish238]) ).

cnf(c_2,negated_conjecture,
    ~ f(A),
    inference(clausify,[status(thm)],[kalish238_neg]) ).

cnf(c_3,negated_conjecture,
    f(A),
    inference(clausify,[status(thm)],[kalish238_neg]) ).

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

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