↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : LAT388+1 : 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 : n006.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:50:31 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__1330,axiom,
    ( aSupremumOfIn0(xp,xT,xS)
    & aFixedPointOf0(xp,xf) ),
    file('theBenchmark.p',m__1330) ).

fof(m__,conjecture,
    ? [W0] : aSupremumOfIn0(W0,xT,xS),
    file('theBenchmark.p',m__) ).

fof(m___neg,negated_conjecture,
    ~ ? [W0] : aSupremumOfIn0(W0,xT,xS),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_85,negated_conjecture,
    ~ aSupremumOfIn0(A,xT,xS),
    inference(clausify,[status(thm)],[m___neg]) ).

cnf(c_86,plain,
    aSupremumOfIn0(xp,xT,xS),
    inference(clausify,[status(thm)],[m__1330]) ).

cnf(c_87,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_85,c_86]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT388+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/15.60  % Computer : n006.cluster.edu
% 0.12/15.60  % Model    : x86_64 x86_64
% 0.12/15.60  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/15.60  % Memory   : 8046.5625MB
% 0.12/15.60  % OS       : Linux 6.8.0-71-generic
% 0.12/15.60  % CPULimit : 300
% 0.12/15.60  % WCLimit  : 300
% 0.12/15.60  % DateTime : Fri Sep 25 21:39:34 UTC 2026
% 0.12/15.61  % CPUTime  : 
% 0.12/15.61  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/15.61  % Process 3804096 was started by sandbox2 on n006,
% 0.12/15.61  % Fri Sep 25 21:39:34 2026
% 0.12/15.61  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/15.62  
% 0.12/15.62  % From the command line: assign(max_seconds, 300).
% 0.12/15.63  
% 0.12/15.63  % SZS status Theorem for theBenchmark
% 0.12/15.63  
% 0.12/15.63  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.12/15.63  % Length of proof is 5.
% 0.12/15.63  % Level of proof is 2.
% 0.12/15.63  % Maximum clause weight is 9.000.
% 0.12/15.63  % Given clauses 0.
% 0.12/15.63  
% 0.12/15.63  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------