↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : MGT088+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 : 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 08:03:06 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(leq_def,axiom,
    ! [X,Y] :
      ( leq(X,Y)
    <=> ( X = Y
        | less(X,Y) ) ),
    file('theBenchmark.p',leq_def) ).

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

fof(odrl509,conjecture,
    ? [X] :
      ( in_lopen(X,v0,v400)
      & less(v200,X) ),
    file('theBenchmark.p',odrl509) ).

fof(odrl509_neg,negated_conjecture,
    ~ ? [X] :
        ( in_lopen(X,v0,v400)
        & less(v200,X) ),
    inference(assume_negation,[status(cth)],[odrl509]) ).

cnf(c_47,plain,
    ( B != A
    | leq(A,B) ),
    inference(clausify,[status(thm)],[leq_def]) ).

cnf(c_59,plain,
    ( ~ leq(A,C)
    | ~ less(B,A)
    | in_lopen(A,B,C) ),
    inference(clausify,[status(thm)],[in_lopen]) ).

fof(ord_v0_v400,axiom,
    less(v0,v400),
    file('theBenchmark.p',ord_v0_v400) ).

cnf(c_82,plain,
    less(v0,v400),
    inference(clausify,[status(thm)],[ord_v0_v400]) ).

fof(ord_v200_v400,axiom,
    less(v200,v400),
    file('theBenchmark.p',ord_v200_v400) ).

cnf(c_84,plain,
    less(v200,v400),
    inference(clausify,[status(thm)],[ord_v200_v400]) ).

cnf(c_93,negated_conjecture,
    ( ~ in_lopen(A,v0,v400)
    | ~ less(v200,A) ),
    inference(clausify,[status(thm)],[odrl509_neg]) ).

cnf(c_115,plain,
    leq(A,A),
    inference(xxres,[status(thm)],[c_47]) ).

cnf(c_204,negated_conjecture,
    ~ in_lopen(v400,v0,v400),
    inference(resolve,[status(thm)],[c_93,c_84]) ).

cnf(c_221,plain,
    ( ~ leq(v400,A)
    | in_lopen(v400,v0,A) ),
    inference(resolve,[status(thm)],[c_59,c_82]) ).

cnf(c_222,plain,
    in_lopen(v400,v0,v400),
    inference(resolve,[status(thm)],[c_221,c_115]) ).

cnf(c_220,plain,
    $false,
    inference(resolve,[status(thm)],[c_204,c_222]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT088+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n006.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep 26 00:12:25 UTC 2026
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/0.36  % Process 4100822 was started by sandbox2 on n006,
% 0.13/0.36  % Sat Sep 26 00:12:25 2026
% 0.13/0.36  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/0.37  
% 0.13/0.37  % From the command line: assign(max_seconds, 300).
% 0.13/0.39  
% 0.13/0.39  % SZS status Theorem for theBenchmark
% 0.13/0.39  
% 0.13/0.39  % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.13/0.39  % Length of proof is 11.
% 0.13/0.39  % Level of proof is 3.
% 0.13/0.39  % Maximum clause weight is 15.000.
% 0.13/0.39  % Given clauses 62.
% 0.13/0.39  
% 0.13/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------