↑ Up

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

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

% Computer : n015.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:05 AM UTC 2026

% Result   : Theorem 0.18s 0.48s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   7 unt;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  10   ~;   4   |;   6   &)
%                                         (   1 <=>;   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    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   18 (   1 sgn   7   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(irreflexive,axiom,
    ! [X] : ~ less(X,X),
    file('theBenchmark.p',irreflexive) ).

fof(transitive,axiom,
    ! [X,Y,Z] :
      ( ( less(Y,Z)
        & less(X,Y) )
     => less(X,Z) ),
    file('theBenchmark.p',transitive) ).

fof(in_open,axiom,
    ! [X,A,B] :
      ( in_open(X,A,B)
    <=> ( less(X,B)
        & less(A,X) ) ),
    file('theBenchmark.p',in_open) ).

fof(odrl423,conjecture,
    ~ ? [X] :
        ( less(v600,X)
        & in_open(X,v0,v600) ),
    file('theBenchmark.p',odrl423) ).

fof(odrl423_neg,negated_conjecture,
    ~ ~ ? [X] :
          ( less(v600,X)
          & in_open(X,v0,v600) ),
    inference(assume_negation,[status(cth)],[odrl423]) ).

cnf(c_30,plain,
    ( less(A,C)
    | ~ in_open(A,B,C) ),
    inference(clausify,[status(thm)],[in_open]) ).

fof(nnf_22,plain,
    ? [X] :
      ( less(v600,X)
      & in_open(X,v0,v600) ),
    inference(fof_nnf,[status(thm)],[odrl423_neg]) ).

fof(sk_odrl423_neg,plain,
    ( less(v600,sK0)
    & in_open(sK0,v0,v600) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X,sK0)],[nnf_22]) ).

cnf(c_32,negated_conjecture,
    in_open(sK0,v0,v600),
    inference(split_conjunct,[status(thm)],[sk_odrl423_neg]) ).

cnf(c_45,negated_conjecture,
    less(sK0,v600),
    inference(resolve,[status(thm)],[c_32,c_30]) ).

cnf(c_46,negated_conjecture,
    less(v600,sK0),
    inference(split_conjunct,[status(thm)],[sk_odrl423_neg]) ).

cnf(c_81,plain,
    ( less(A,C)
    | ~ less(B,C)
    | ~ less(A,B) ),
    inference(clausify,[status(thm)],[transitive]) ).

cnf(c_82,plain,
    ~ less(A,A),
    inference(clausify,[status(thm)],[irreflexive]) ).

cnf(c_144,negated_conjecture,
    ( less(A,sK0)
    | ~ less(A,v600) ),
    inference(resolve,[status(thm)],[c_81,c_46]) ).

cnf(c_145,negated_conjecture,
    ~ less(sK0,v600),
    inference(resolve,[status(thm)],[c_144,c_82]) ).

cnf(c_143,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_45,c_145]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : MGT083+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.07  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45  % Computer : n015.cluster.edu
% 0.18/0.45  % Model    : x86_64 x86_64
% 0.18/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45  % Memory   : 8046.5625MB
% 0.18/0.45  % OS       : Linux 6.8.0-71-generic
% 0.18/0.45  % CPULimit : 300
% 0.18/0.45  % WCLimit  : 300
% 0.18/0.45  % DateTime : Sat Sep 26 00:15:28 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.46  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.46  % Process 2616178 was started by sandbox2 on n015,
% 0.18/0.46  % Sat Sep 26 00:15:28 2026
% 0.18/0.46  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/0.47  
% 0.18/0.47  % From the command line: assign(max_seconds, 300).
% 0.18/0.48  
% 0.18/0.48  % SZS status Theorem for theBenchmark
% 0.18/0.48  
% 0.18/0.48  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.18/0.48  % Length of proof is 11.
% 0.18/0.48  % Level of proof is 3.
% 0.18/0.48  % Maximum clause weight is 14.000.
% 0.18/0.48  % Given clauses 33.
% 0.18/0.48  
% 0.18/0.48  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------