↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : PHI012+1 : TPTP v9.2.1. Released v7.2.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 05:01:09 PM UTC 2026

% Result   : Theorem 1.22s 1.71s
% Output   : CNFRefutation 1.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   24 (   8 unt;   0 def)
%            Number of atoms       :  103 (  11 equ)
%            Maximal formula atoms :   20 (   4 avg)
%            Number of connectives :  125 (  46   ~;  52   |;  18   &)
%                                         (   1 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-1 aty)
%            Number of variables   :   26 (   0 sgn  10   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(lemma_2,conjecture,
    ( ? [X1] :
        ( object(X1)
        & exemplifies_property(none_greater,X1) )
   => ? [X1] :
        ( object(X1)
        & exemplifies_property(none_greater,X1)
        & ! [X2] :
            ( object(X2)
           => ( exemplifies_property(none_greater,X2)
             => X2 = X1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_2) ).

fof(definition_none_greater,axiom,
    ! [X1] :
      ( object(X1)
     => ( exemplifies_property(none_greater,X1)
      <=> ( exemplifies_property(conceivable,X1)
          & ~ ? [X2] :
                ( object(X2)
                & exemplifies_relation(greater_than,X2,X1)
                & exemplifies_property(conceivable,X2) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_none_greater) ).

fof(connectedness_of_greater_than,axiom,
    ! [X1,X2] :
      ( ( object(X1)
        & object(X2) )
     => ( exemplifies_relation(greater_than,X1,X2)
        | exemplifies_relation(greater_than,X2,X1)
        | X1 = X2 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',connectedness_of_greater_than) ).

fof(c_0_3,negated_conjecture,
    ~ ( ? [X1] :
          ( object(X1)
          & exemplifies_property(none_greater,X1) )
     => ? [X1] :
          ( object(X1)
          & exemplifies_property(none_greater,X1)
          & ! [X2] :
              ( object(X2)
             => ( exemplifies_property(none_greater,X2)
               => X2 = X1 ) ) ) ),
    inference(assume_negation,[status(cth)],[lemma_2]) ).

fof(c_0_4,plain,
    ! [X10,X11] :
      ( ( exemplifies_property(conceivable,X10)
        | ~ exemplifies_property(none_greater,X10)
        | ~ object(X10) )
      & ( ~ object(X11)
        | ~ exemplifies_relation(greater_than,X11,X10)
        | ~ exemplifies_property(conceivable,X11)
        | ~ exemplifies_property(none_greater,X10)
        | ~ object(X10) )
      & ( object(esk1_1(X10))
        | ~ exemplifies_property(conceivable,X10)
        | exemplifies_property(none_greater,X10)
        | ~ object(X10) )
      & ( exemplifies_relation(greater_than,esk1_1(X10),X10)
        | ~ exemplifies_property(conceivable,X10)
        | exemplifies_property(none_greater,X10)
        | ~ object(X10) )
      & ( exemplifies_property(conceivable,esk1_1(X10))
        | ~ exemplifies_property(conceivable,X10)
        | exemplifies_property(none_greater,X10)
        | ~ object(X10) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[definition_none_greater])])])])]) ).

fof(c_0_5,plain,
    ! [X13,X14] :
      ( ~ object(X13)
      | ~ object(X14)
      | exemplifies_relation(greater_than,X13,X14)
      | exemplifies_relation(greater_than,X14,X13)
      | X13 = X14 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_of_greater_than])]) ).

fof(c_0_6,negated_conjecture,
    ! [X16] :
      ( object(esk2_0)
      & exemplifies_property(none_greater,esk2_0)
      & ( object(esk3_1(X16))
        | ~ object(X16)
        | ~ exemplifies_property(none_greater,X16) )
      & ( exemplifies_property(none_greater,esk3_1(X16))
        | ~ object(X16)
        | ~ exemplifies_property(none_greater,X16) )
      & ( esk3_1(X16) != X16
        | ~ object(X16)
        | ~ exemplifies_property(none_greater,X16) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).

cnf(c_0_7,plain,
    ( ~ object(X1)
    | ~ exemplifies_relation(greater_than,X1,X2)
    | ~ exemplifies_property(conceivable,X1)
    | ~ exemplifies_property(none_greater,X2)
    | ~ object(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( exemplifies_relation(greater_than,X1,X2)
    | exemplifies_relation(greater_than,X2,X1)
    | X1 = X2
    | ~ object(X1)
    | ~ object(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ( exemplifies_property(none_greater,esk3_1(X1))
    | ~ object(X1)
    | ~ exemplifies_property(none_greater,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    exemplifies_property(none_greater,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,negated_conjecture,
    object(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    ( object(esk3_1(X1))
    | ~ object(X1)
    | ~ exemplifies_property(none_greater,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_13,plain,
    ( X1 = X2
    | exemplifies_relation(greater_than,X2,X1)
    | ~ exemplifies_property(none_greater,X2)
    | ~ exemplifies_property(conceivable,X1)
    | ~ object(X2)
    | ~ object(X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    exemplifies_property(none_greater,esk3_1(esk2_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).

cnf(c_0_15,negated_conjecture,
    object(esk3_1(esk2_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_10]),c_0_11])]) ).

cnf(c_0_16,plain,
    ( exemplifies_property(conceivable,X1)
    | ~ exemplifies_property(none_greater,X1)
    | ~ object(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_17,negated_conjecture,
    ( X1 = esk3_1(esk2_0)
    | exemplifies_relation(greater_than,esk3_1(esk2_0),X1)
    | ~ exemplifies_property(conceivable,X1)
    | ~ object(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

cnf(c_0_18,negated_conjecture,
    exemplifies_property(conceivable,esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_10]),c_0_11])]) ).

cnf(c_0_19,negated_conjecture,
    ( esk3_1(esk2_0) = esk2_0
    | exemplifies_relation(greater_than,esk3_1(esk2_0),esk2_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_11])]) ).

cnf(c_0_20,negated_conjecture,
    exemplifies_property(conceivable,esk3_1(esk2_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_15])]) ).

cnf(c_0_21,negated_conjecture,
    ( esk3_1(X1) != X1
    | ~ object(X1)
    | ~ exemplifies_property(none_greater,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_22,negated_conjecture,
    esk3_1(esk2_0) = esk2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_19]),c_0_10]),c_0_11]),c_0_15])]),c_0_20])]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_10]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : PHI012+1 : TPTP v9.2.1. Released v7.2.0.
% 0.00/0.12  % 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.12/0.32  % Computer : n013.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 300
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Tue May  5 01:24:56 EDT 2026
% 0.12/0.32  % CPUTime    : 
% 0.12/0.33  % start to proof: theBenchmark
% 1.22/1.71  % Version  : CSE_E---1.7
% 1.22/1.71  % Problem  : theBenchmark.p
% 1.22/1.71  % SZS status Theorem for theBenchmark.p
% 1.22/1.71  % SZS output start CNFRefutation
% See solution above
% 1.22/1.71  % Total time : 1.373s
%------------------------------------------------------------------------------