↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SWB006+2 : TPTP v9.2.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/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:16:36 PM UTC 2026

% Result   : Theorem 0.26s 1.66s
% Output   : CNFRefutation 0.32s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named 8)

% Comments : 
%------------------------------------------------------------------------------
fof(owl_eqdis_sameas,axiom,
    ! [X1,X2] :
      ( iext(uri_owl_sameAs,X1,X2)
    <=> X1 = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_eqdis_sameas) ).

fof(testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes,conjecture,
    iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).

fof(testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes,axiom,
    ? [X3] :
      ( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,X3,literal_plain(dat_str_abc))
      & iext(uri_owl_sameAs,X3,uri_ex_w) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes) ).

fof(i_0_3,plain,
    ! [X7,X8] :
      ( ( ~ iext(uri_owl_sameAs,X7,X8)
        | X7 = X8 )
      & ( X7 != X8
        | iext(uri_owl_sameAs,X7,X8) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_sameas])]) ).

fof(i_0_4,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes])]) ).

fof(i_0_5,plain,
    ( iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc))
    & iext(uri_owl_sameAs,esk1_0,literal_plain(dat_str_abc))
    & iext(uri_owl_sameAs,esk1_0,uri_ex_w) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_006_Literal_Values_represented_by_URIs_and_Blank_Nodes])]) ).

cnf(i_0_6,plain,
    ( X1 = X2
    | ~ iext(uri_owl_sameAs,X1,X2) ),
    inference(split_conjunct,[status(thm)],[i_0_3]),
    [final] ).

cnf(i_0_7,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
    inference(split_conjunct,[status(thm)],[i_0_4]),
    [final] ).

cnf(i_0_8,plain,
    ( iext(uri_owl_sameAs,X1,X2)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[i_0_3]),
    [final] ).

cnf(i_0_9,plain,
    iext(uri_owl_sameAs,esk1_0,literal_plain(dat_str_abc)),
    inference(split_conjunct,[status(thm)],[i_0_5]),
    [final] ).

cnf(i_0_10,plain,
    iext(uri_owl_sameAs,uri_ex_u,literal_plain(dat_str_abc)),
    inference(split_conjunct,[status(thm)],[i_0_5]),
    [final] ).

cnf(i_0_11,plain,
    iext(uri_owl_sameAs,esk1_0,uri_ex_w),
    inference(split_conjunct,[status(thm)],[i_0_5]),
    [final] ).

cnf(i_0_12,axiom,
    X1 = X1 ).

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

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

cnf(i_0_15,axiom,
    ( X1 != X2
    | ~ iext(X1,X3,X4)
    | iext(X2,X3,X4) ) ).

cnf(i_0_16,axiom,
    ( X1 != X2
    | ~ iext(X3,X1,X4)
    | iext(X3,X2,X4) ) ).

cnf(i_0_17,axiom,
    ( X1 != X2
    | ~ iext(X3,X4,X1)
    | iext(X3,X4,X2) ) ).

cnf(i_0_12_001,axiom,
    X1 = X1 ).

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

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

cnf(i_0_15_004,axiom,
    ( X1 != X2
    | ~ iext(X1,X3,X4)
    | iext(X2,X3,X4) ) ).

cnf(i_0_16_005,axiom,
    ( X1 != X2
    | ~ iext(X3,X1,X4)
    | iext(X3,X2,X4) ) ).

cnf(i_0_17_006,axiom,
    ( X1 != X2
    | ~ iext(X3,X4,X1)
    | iext(X3,X4,X2) ) ).

cnf(i_0_18,plain,
    iext(uri_owl_sameAs,X1,X1),
    inference(equality_inference,[],[8]) ).

cnf(i_0_19,plain,
    uri_ex_u != uri_ex_w,
    inference(scs_inference,[],[i_0_7,i_0_8]) ).

cnf(i_0_20,plain,
    ( iext(uri_owl_sameAs,X1,X2)
    | X1 != X2 ),
    inference(rename_variables,[],[i_0_8]) ).

cnf(i_0_21,plain,
    esk1_0 = uri_ex_w,
    inference(scs_inference,[],[i_0_7,i_0_11,i_0_8,i_0_6]) ).

cnf(i_0_22,plain,
    ( ~ iext(uri_owl_sameAs,X1,X2)
    | X1 = X2 ),
    inference(rename_variables,[],[i_0_6]) ).

cnf(i_0_23,plain,
    uri_ex_w = esk1_0,
    inference(scs_inference,[],[i_0_7,i_0_11,i_0_8,i_0_6,i_0_13]) ).

cnf(i_0_24,plain,
    uri_ex_u != esk1_0,
    inference(scs_inference,[],[i_0_7,i_0_11,i_0_8,i_0_6,i_0_13,i_0_14]) ).

cnf(i_0_25,plain,
    uri_ex_w != uri_ex_u,
    inference(scs_inference,[],[i_0_7,i_0_18,i_0_11,i_0_8,i_0_6,i_0_13,i_0_14,i_0_16]) ).

cnf(i_0_26,plain,
    iext(uri_owl_sameAs,X1,X1),
    inference(rename_variables,[],[i_0_18]) ).

cnf(i_0_27,plain,
    ~ iext(uri_owl_sameAs,uri_ex_u,esk1_0),
    inference(scs_inference,[],[i_0_7,i_0_18,i_0_11,i_0_8,i_0_6,i_0_13,i_0_14,i_0_16,i_0_17]) ).

cnf(i_0_28,plain,
    ( X1 != uri_owl_sameAs
    | ~ iext(X1,uri_ex_u,uri_ex_w) ),
    inference(scs_inference,[],[i_0_7,i_0_18,i_0_11,i_0_8,i_0_6,i_0_13,i_0_14,i_0_16,i_0_17,i_0_15]) ).

cnf(i_0_29,plain,
    ~ iext(uri_owl_sameAs,uri_ex_u,uri_ex_w),
    inference(equality_inference,[],[28]) ).

cnf(i_0_30,plain,
    esk1_0 = literal_plain(dat_str_abc),
    inference(scs_inference,[],[i_0_9,i_0_6]) ).

cnf(i_0_31,plain,
    ( ~ iext(uri_owl_sameAs,X1,X2)
    | X1 = X2 ),
    inference(rename_variables,[],[i_0_6]) ).

cnf(i_0_32,plain,
    literal_plain(dat_str_abc) = esk1_0,
    inference(scs_inference,[],[i_0_9,i_0_6,i_0_13]) ).

cnf(i_0_33,plain,
    uri_ex_w = literal_plain(dat_str_abc),
    inference(scs_inference,[],[i_0_23,i_0_9,i_0_6,i_0_13,i_0_14]) ).

cnf(i_0_34,plain,
    esk1_0 != uri_ex_u,
    inference(scs_inference,[],[i_0_18,i_0_23,i_0_27,i_0_9,i_0_6,i_0_13,i_0_14,i_0_16]) ).

cnf(i_0_35,plain,
    iext(uri_owl_sameAs,X1,X1),
    inference(rename_variables,[],[i_0_18]) ).

cnf(i_0_36,plain,
    ( X1 != uri_owl_sameAs
    | ~ iext(X1,uri_ex_u,esk1_0) ),
    inference(scs_inference,[],[i_0_18,i_0_23,i_0_27,i_0_9,i_0_6,i_0_13,i_0_14,i_0_16,i_0_15]) ).

cnf(i_0_37,plain,
    ~ iext(uri_owl_sameAs,uri_ex_u,esk1_0),
    inference(equality_inference,[],[36]) ).

cnf(i_0_38,plain,
    uri_ex_u = literal_plain(dat_str_abc),
    inference(scs_inference,[],[i_0_10,i_0_6]) ).

cnf(i_0_39,plain,
    ( ~ iext(uri_owl_sameAs,X1,X2)
    | X1 = X2 ),
    inference(rename_variables,[],[i_0_6]) ).

cnf(i_0_40,plain,
    literal_plain(dat_str_abc) = uri_ex_w,
    inference(scs_inference,[],[i_0_33,i_0_10,i_0_6,i_0_13]) ).

cnf(i_0_41,plain,
    $false,
    inference(scs_inference,[],[i_0_27,i_0_32,i_0_33,i_0_10,i_0_6,i_0_13,i_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWB006+2 : TPTP v9.2.1. Released v5.2.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33  % Computer : n013.cluster.edu
% 0.16/0.33  % Model    : x86_64 x86_64
% 0.16/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33  % Memory   : 8042.1875MB
% 0.16/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33  % CPULimit   : 300
% 0.16/0.33  % WCLimit    : 300
% 0.16/0.33  % DateTime   : Tue May  5 04:06:26 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 0.26/1.66  % Version  : CSE_E---1.7
% 0.26/1.66  % Problem  : theBenchmark.p
% 0.26/1.66  % SZS status Theorem for theBenchmark.p
% 0.26/1.66  % SZS output start CNFRefutation
% See solution above
% 0.32/1.72  % Total time : 1.320s
%------------------------------------------------------------------------------