↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 04:48:28 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(xone_compat,axiom,
    ! [X6,X7] :
      ( ( is_verdict(X6)
        & is_verdict(X7)
        & X6 = compatible
        & X7 = conflict )
     => xone_verdict(X6,X7) = compatible ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+3.ax',xone_compat) ).

fof(odrl644,conjecture,
    xone_verdict(compatible,conflict) = compatible,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',odrl644) ).

fof(conflict_is_verdict,axiom,
    is_verdict(conflict),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',conflict_is_verdict) ).

fof(compatible_is_verdict,axiom,
    is_verdict(compatible),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',compatible_is_verdict) ).

fof(c_0_4,plain,
    ! [X134,X135] :
      ( ~ is_verdict(X134)
      | ~ is_verdict(X135)
      | X134 != compatible
      | X135 != conflict
      | xone_verdict(X134,X135) = compatible ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[xone_compat])]) ).

fof(c_0_5,negated_conjecture,
    xone_verdict(compatible,conflict) != compatible,
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[odrl644])]) ).

cnf(c_0_6,plain,
    ( xone_verdict(X1,X2) = compatible
    | ~ is_verdict(X1)
    | ~ is_verdict(X2)
    | X1 != compatible
    | X2 != conflict ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    is_verdict(conflict),
    inference(split_conjunct,[status(thm)],[conflict_is_verdict]) ).

cnf(c_0_8,plain,
    is_verdict(compatible),
    inference(split_conjunct,[status(thm)],[compatible_is_verdict]) ).

cnf(c_0_9,negated_conjecture,
    xone_verdict(compatible,conflict) != compatible,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])]),c_0_7]),c_0_8])]),c_0_9]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : MGT093+1 : TPTP v9.3.0. Released v9.3.0.
% 0.11/0.13  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.35  % Computer : n013.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Mon May  4 23:32:56 EDT 2026
% 0.15/0.35  % CPUTime    : 
% 0.19/0.36  % start to proof: theBenchmark
% 1.28/1.74  % Version  : CSE_E---1.7
% 1.28/1.74  % Problem  : theBenchmark.p
% 1.28/1.74  % SZS status Theorem for theBenchmark.p
% 1.28/1.74  % SZS output start CNFRefutation
% See solution above
% 1.28/1.74  % Total time : 1.372s
%------------------------------------------------------------------------------