↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : PHI011+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 : n015.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 0.21s 1.60s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named 12)

% Comments : 
%------------------------------------------------------------------------------
fof(description_theorem_2,conjecture,
    ! [X2] :
      ( property(X2)
     => ( ? [X3] :
            ( object(X3)
            & is_the(X3,X2) )
       => ! [X4] :
            ( object(X4)
           => ( is_the(X4,X2)
             => exemplifies_property(X2,X4) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',description_theorem_2) ).

fof(objects_are_not_properties,axiom,
    ! [X1] :
      ( object(X1)
     => ~ property(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',objects_are_not_properties) ).

fof(lemma_1,axiom,
    ! [X1,X2,X3] :
      ( ( object(X1)
        & property(X2)
        & object(X3) )
     => ( ( is_the(X1,X2)
          & X1 = X3 )
       => exemplifies_property(X2,X3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lemma_1) ).

fof(description_is_property_and_described_is_object,axiom,
    ! [X1,X2] :
      ( is_the(X1,X2)
     => ( property(X2)
        & object(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',description_is_property_and_described_is_object) ).

fof(exemplifier_is_object_and_exemplified_is_property,axiom,
    ! [X1,X2] :
      ( exemplifies_property(X2,X1)
     => ( property(X2)
        & object(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exemplifier_is_object_and_exemplified_is_property) ).

fof(i_0_5,negated_conjecture,
    ~ ! [X2] :
        ( property(X2)
       => ( ? [X3] :
              ( object(X3)
              & is_the(X3,X2) )
         => ! [X4] :
              ( object(X4)
             => ( is_the(X4,X2)
               => exemplifies_property(X2,X4) ) ) ) ),
    inference(assume_negation,[status(cth)],[description_theorem_2]) ).

fof(i_0_6,plain,
    ! [X1] :
      ( object(X1)
     => ~ property(X1) ),
    inference(fof_simplification,[status(thm)],[objects_are_not_properties]) ).

fof(i_0_7,plain,
    ! [X21,X22,X23] :
      ( ~ object(X21)
      | ~ property(X22)
      | ~ object(X23)
      | ~ is_the(X21,X22)
      | X21 != X23
      | exemplifies_property(X22,X23) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lemma_1])]) ).

fof(i_0_8,plain,
    ! [X19,X20] :
      ( ( property(X20)
        | ~ is_the(X19,X20) )
      & ( object(X19)
        | ~ is_the(X19,X20) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_is_property_and_described_is_object])])]) ).

fof(i_0_9,plain,
    ! [X17,X18] :
      ( ( property(X18)
        | ~ exemplifies_property(X18,X17) )
      & ( object(X17)
        | ~ exemplifies_property(X18,X17) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[exemplifier_is_object_and_exemplified_is_property])])]) ).

fof(i_0_10,negated_conjecture,
    ( property(esk1_0)
    & object(esk2_0)
    & is_the(esk2_0,esk1_0)
    & object(esk3_0)
    & is_the(esk3_0,esk1_0)
    & ~ exemplifies_property(esk1_0,esk3_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_5])])]) ).

fof(i_0_11,plain,
    ! [X16] :
      ( ~ object(X16)
      | ~ property(X16) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_6])]) ).

cnf(i_0_12,plain,
    ( exemplifies_property(X2,X3)
    | ~ object(X1)
    | ~ property(X2)
    | ~ object(X3)
    | ~ is_the(X1,X2)
    | X1 != X3 ),
    inference(split_conjunct,[status(thm)],[i_0_7]),
    [final] ).

cnf(i_0_13,plain,
    ( property(X1)
    | ~ is_the(X2,X1) ),
    inference(split_conjunct,[status(thm)],[i_0_8]),
    [final] ).

cnf(i_0_14,plain,
    ( property(X1)
    | ~ exemplifies_property(X1,X2) ),
    inference(split_conjunct,[status(thm)],[i_0_9]),
    [final] ).

cnf(i_0_15,plain,
    ( object(X1)
    | ~ is_the(X1,X2) ),
    inference(split_conjunct,[status(thm)],[i_0_8]),
    [final] ).

cnf(i_0_16,plain,
    ( object(X1)
    | ~ exemplifies_property(X2,X1) ),
    inference(split_conjunct,[status(thm)],[i_0_9]),
    [final] ).

cnf(i_0_17,negated_conjecture,
    ~ exemplifies_property(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[i_0_10]),
    [final] ).

cnf(i_0_18,plain,
    ( ~ object(X1)
    | ~ property(X1) ),
    inference(split_conjunct,[status(thm)],[i_0_11]),
    [final] ).

cnf(i_0_19,negated_conjecture,
    is_the(esk3_0,esk1_0),
    inference(split_conjunct,[status(thm)],[i_0_10]),
    [final] ).

cnf(i_0_20,negated_conjecture,
    is_the(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[i_0_10]),
    [final] ).

cnf(i_0_21,negated_conjecture,
    property(esk1_0),
    inference(split_conjunct,[status(thm)],[i_0_10]),
    [final] ).

cnf(i_0_22,negated_conjecture,
    object(esk3_0),
    inference(split_conjunct,[status(thm)],[i_0_10]),
    [final] ).

cnf(i_0_23,negated_conjecture,
    object(esk2_0),
    inference(split_conjunct,[status(thm)],[i_0_10]),
    [final] ).

cnf(i_0_24,axiom,
    X1 = X1 ).

cnf(i_0_25,axiom,
    ( X1 = X2
    | X2 != X1 ) ).

cnf(i_0_26,axiom,
    ( X1 = X2
    | X1 != X3
    | X3 != X2 ) ).

cnf(i_0_27,axiom,
    ( X1 != X2
    | ~ exemplifies_property(X1,X3)
    | exemplifies_property(X2,X3) ) ).

cnf(i_0_28,axiom,
    ( X1 != X2
    | ~ exemplifies_property(X3,X1)
    | exemplifies_property(X3,X2) ) ).

cnf(i_0_29,axiom,
    ( X1 != X2
    | ~ object(X1)
    | object(X2) ) ).

cnf(i_0_30,axiom,
    ( X1 != X2
    | ~ property(X1)
    | property(X2) ) ).

cnf(i_0_31,axiom,
    ( X1 != X2
    | ~ is_the(X1,X3)
    | is_the(X2,X3) ) ).

cnf(i_0_32,axiom,
    ( X1 != X2
    | ~ is_the(X3,X1)
    | is_the(X3,X2) ) ).

cnf(i_0_24_001,axiom,
    X1 = X1 ).

cnf(i_0_25_002,axiom,
    ( X1 = X2
    | X2 != X1 ) ).

cnf(i_0_26_003,axiom,
    ( X1 = X2
    | X1 != X3
    | X3 != X2 ) ).

cnf(i_0_27_004,axiom,
    ( X1 != X2
    | ~ exemplifies_property(X1,X3)
    | exemplifies_property(X2,X3) ) ).

cnf(i_0_28_005,axiom,
    ( X1 != X2
    | ~ exemplifies_property(X3,X1)
    | exemplifies_property(X3,X2) ) ).

cnf(i_0_29_006,axiom,
    ( X1 != X2
    | ~ object(X1)
    | object(X2) ) ).

cnf(i_0_30_007,axiom,
    ( X1 != X2
    | ~ property(X1)
    | property(X2) ) ).

cnf(i_0_31_008,axiom,
    ( X1 != X2
    | ~ is_the(X1,X3)
    | is_the(X2,X3) ) ).

cnf(i_0_32_009,axiom,
    ( X1 != X2
    | ~ is_the(X3,X1)
    | is_the(X3,X2) ) ).

cnf(i_0_33,plain,
    ( ~ property(X1)
    | ~ object(X2)
    | ~ is_the(X2,X1)
    | exemplifies_property(X1,X2)
    | ~ object(X2) ),
    inference(equality_inference,[],[12]) ).

cnf(i_0_34,plain,
    $false,
    inference(scs_inference,[],[i_0_21,i_0_22,i_0_19,i_0_17,i_0_33]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : PHI011+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 : n015.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:25:31 EDT 2026
% 0.12/0.32  % CPUTime    : 
% 0.12/0.33  % start to proof: theBenchmark
% 0.21/1.60  % Version  : CSE_E---1.7
% 0.21/1.60  % Problem  : theBenchmark.p
% 0.21/1.60  % SZS status Theorem for theBenchmark.p
% 0.21/1.60  % SZS output start CNFRefutation
% See solution above
% 0.21/1.62  % Total time : 1.273s
%------------------------------------------------------------------------------