↑ Up

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

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

% Computer : n019.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 08:03:03 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(completion_compat,axiom,
    ! [V,InfD,SupD] :
      ( ( leq(V,SupD)
        & leq(InfD,V) )
     => completion_compatible(V,InfD,SupD) ),
    file('theBenchmark.p',completion_compat) ).

fof(h_inf_lb,axiom,
    ! [X] : leq(ninf,X),
    file('theBenchmark.p',h_inf_lb) ).

fof(h_sup_ub,axiom,
    ! [X] : leq(X,nsup),
    file('theBenchmark.p',h_sup_ub) ).

fof(unknown_sound_compatible,conjecture,
    ? [V] :
      ( completion_compatible(V,ninf,nsup)
      & leq(V,nsup)
      & leq(ninf,V) ),
    file('theBenchmark.p',unknown_sound_compatible) ).

fof(unknown_sound_compatible_neg,negated_conjecture,
    ~ ? [V] :
        ( completion_compatible(V,ninf,nsup)
        & leq(V,nsup)
        & leq(ninf,V) ),
    inference(assume_negation,[status(cth)],[unknown_sound_compatible]) ).

cnf(c_90,plain,
    ( completion_compatible(B,A,C)
    | ~ leq(B,C)
    | ~ leq(A,B) ),
    inference(clausify,[status(thm)],[completion_compat]) ).

cnf(c_93,plain,
    leq(ninf,A),
    inference(clausify,[status(thm)],[h_inf_lb]) ).

cnf(c_94,plain,
    leq(A,nsup),
    inference(clausify,[status(thm)],[h_sup_ub]) ).

cnf(c_96,negated_conjecture,
    ( ~ completion_compatible(A,ninf,nsup)
    | ~ leq(A,nsup)
    | ~ leq(ninf,A) ),
    inference(clausify,[status(thm)],[unknown_sound_compatible_neg]) ).

cnf(c_199,negated_conjecture,
    ( ~ completion_compatible(A,ninf,nsup)
    | ~ leq(A,nsup) ),
    inference(resolve,[status(thm)],[c_93,c_96]) ).

cnf(c_97,negated_conjecture,
    ~ completion_compatible(A,ninf,nsup),
    inference(resolve,[status(thm)],[c_94,c_199]) ).

cnf(c_200,plain,
    ( completion_compatible(B,A,nsup)
    | ~ leq(A,B) ),
    inference(resolve,[status(thm)],[c_90,c_94]) ).

cnf(c_201,negated_conjecture,
    ~ leq(ninf,A),
    inference(resolve,[status(thm)],[c_200,c_97]) ).

cnf(c_198,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_93,c_201]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT070+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n019.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 00:11:48 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 4054801 was started by sandbox2 on n019,
% 0.09/0.36  % Sat Sep 26 00:11:48 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.39  
% 0.09/0.39  % SZS status Theorem for theBenchmark
% 0.09/0.39  
% 0.09/0.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.39  % Length of proof is 10.
% 0.09/0.39  % Level of proof is 3.
% 0.09/0.39  % Maximum clause weight is 15.000.
% 0.09/0.39  % Given clauses 40.
% 0.09/0.39  
% 0.09/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------