↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET933+1 : TPTP v9.2.1. Released v3.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 : n001.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:09:00 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(antisymmetry_r2_hidden,axiom,
    ! [X1,X2] :
      ( in(X1,X2)
     => ~ in(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).

fof(t80_zfmisc_1,conjecture,
    ! [X1] : subset(singleton(X1),powerset(X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t80_zfmisc_1) ).

fof(rc2_xboole_0,axiom,
    ? [X1] : ~ empty(X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_xboole_0) ).

fof(d1_zfmisc_1,axiom,
    ! [X1,X2] :
      ( X2 = powerset(X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> subset(X3,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).

fof(l2_zfmisc_1,axiom,
    ! [X1,X2] :
      ( subset(singleton(X1),X2)
    <=> in(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).

fof(reflexivity_r1_tarski,axiom,
    ! [X1,X2] : subset(X1,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).

fof(rc1_xboole_0,axiom,
    ? [X1] : empty(X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc1_xboole_0) ).

fof(i_0_7,plain,
    ! [X1,X2] :
      ( in(X1,X2)
     => ~ in(X2,X1) ),
    inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).

fof(i_0_8,negated_conjecture,
    ~ ! [X1] : subset(singleton(X1),powerset(X1)),
    inference(assume_negation,[status(cth)],[t80_zfmisc_1]) ).

fof(i_0_9,plain,
    ? [X1] : ~ empty(X1),
    inference(fof_simplification,[status(thm)],[rc2_xboole_0]) ).

fof(i_0_10,plain,
    ! [X18,X19,X20,X21,X22,X23] :
      ( ( ~ in(X20,X19)
        | subset(X20,X18)
        | X19 != powerset(X18) )
      & ( ~ subset(X21,X18)
        | in(X21,X19)
        | X19 != powerset(X18) )
      & ( ~ in(esk1_2(X22,X23),X23)
        | ~ subset(esk1_2(X22,X23),X22)
        | X23 = powerset(X22) )
      & ( in(esk1_2(X22,X23),X23)
        | subset(esk1_2(X22,X23),X22)
        | X23 = powerset(X22) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_zfmisc_1])])])])])]) ).

fof(i_0_11,plain,
    ! [X25,X26] :
      ( ( ~ subset(singleton(X25),X26)
        | in(X25,X26) )
      & ( ~ in(X25,X26)
        | subset(singleton(X25),X26) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])]) ).

fof(i_0_12,plain,
    ! [X16,X17] :
      ( ~ in(X16,X17)
      | ~ in(X17,X16) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_7])]) ).

fof(i_0_13,negated_conjecture,
    ~ subset(singleton(esk4_0),powerset(esk4_0)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_8])])]) ).

fof(i_0_14,plain,
    ! [X29] : subset(X29,X29),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).

fof(i_0_15,plain,
    ~ empty(esk3_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[i_0_9])]) ).

fof(i_0_16,plain,
    empty(esk2_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).

cnf(i_0_17,plain,
    ( X2 = powerset(X1)
    | ~ in(esk1_2(X1,X2),X2)
    | ~ subset(esk1_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[i_0_10]),
    [final] ).

cnf(i_0_18,plain,
    ( in(esk1_2(X1,X2),X2)
    | subset(esk1_2(X1,X2),X1)
    | X2 = powerset(X1) ),
    inference(split_conjunct,[status(thm)],[i_0_10]),
    [final] ).

cnf(i_0_19,plain,
    ( in(X1,X2)
    | ~ subset(singleton(X1),X2) ),
    inference(split_conjunct,[status(thm)],[i_0_11]),
    [final] ).

cnf(i_0_20,plain,
    ( subset(X1,X3)
    | ~ in(X1,X2)
    | X2 != powerset(X3) ),
    inference(split_conjunct,[status(thm)],[i_0_10]),
    [final] ).

cnf(i_0_21,plain,
    ( in(X1,X3)
    | ~ subset(X1,X2)
    | X3 != powerset(X2) ),
    inference(split_conjunct,[status(thm)],[i_0_10]),
    [final] ).

cnf(i_0_22,plain,
    ( ~ in(X1,X2)
    | ~ in(X2,X1) ),
    inference(split_conjunct,[status(thm)],[i_0_12]),
    [final] ).

cnf(i_0_23,plain,
    ( subset(singleton(X1),X2)
    | ~ in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[i_0_11]),
    [final] ).

cnf(i_0_24,negated_conjecture,
    ~ subset(singleton(esk4_0),powerset(esk4_0)),
    inference(split_conjunct,[status(thm)],[i_0_13]),
    [final] ).

cnf(i_0_25,plain,
    subset(X1,X1),
    inference(split_conjunct,[status(thm)],[i_0_14]),
    [final] ).

cnf(i_0_26,plain,
    ~ empty(esk3_0),
    inference(split_conjunct,[status(thm)],[i_0_15]),
    [final] ).

cnf(i_0_27,plain,
    empty(esk2_0),
    inference(split_conjunct,[status(thm)],[i_0_16]),
    [final] ).

cnf(i_0_28,axiom,
    X1 = X1 ).

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

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

cnf(i_0_31,axiom,
    ( X1 != X2
    | powerset(X1) = powerset(X2) ) ).

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

cnf(i_0_33,axiom,
    ( X1 != X2
    | ~ in(X3,X1)
    | in(X3,X2) ) ).

cnf(i_0_34,axiom,
    ( X1 != X2
    | ~ subset(X1,X3)
    | subset(X2,X3) ) ).

cnf(i_0_35,axiom,
    ( X1 != X2
    | ~ subset(X3,X1)
    | subset(X3,X2) ) ).

cnf(i_0_36,axiom,
    ( X1 != X2
    | ~ empty(X1)
    | empty(X2) ) ).

cnf(i_0_28_001,axiom,
    X1 = X1 ).

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

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

cnf(i_0_31_004,axiom,
    ( X1 != X2
    | powerset(X1) = powerset(X2) ) ).

cnf(i_0_32_005,axiom,
    ( X1 != X2
    | ~ in(X1,X3)
    | in(X2,X3) ) ).

cnf(i_0_33_006,axiom,
    ( X1 != X2
    | ~ in(X3,X1)
    | in(X3,X2) ) ).

cnf(i_0_34_007,axiom,
    ( X1 != X2
    | ~ subset(X1,X3)
    | subset(X2,X3) ) ).

cnf(i_0_35_008,axiom,
    ( X1 != X2
    | ~ subset(X3,X1)
    | subset(X3,X2) ) ).

cnf(i_0_36_009,axiom,
    ( X1 != X2
    | ~ empty(X1)
    | empty(X2) ) ).

cnf(i_0_37,plain,
    ( subset(X1,X2)
    | ~ in(X1,powerset(X2)) ),
    inference(equality_inference,[],[20]) ).

cnf(i_0_38,plain,
    ( in(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    inference(equality_inference,[],[21]) ).

cnf(i_0_39,plain,
    ~ in(esk4_0,powerset(esk4_0)),
    inference(scs_inference,[],[i_0_24,i_0_23]) ).

cnf(i_0_40,plain,
    ( subset(singleton(X1),X2)
    | ~ in(X1,X2) ),
    inference(rename_variables,[],[i_0_23]) ).

cnf(i_0_41,plain,
    in(X1,singleton(X1)),
    inference(scs_inference,[],[i_0_24,i_0_25,i_0_23,i_0_19]) ).

cnf(i_0_42,plain,
    subset(X1,X1),
    inference(rename_variables,[],[i_0_25]) ).

cnf(i_0_43,plain,
    ( ~ subset(singleton(X1),X2)
    | in(X1,X2) ),
    inference(rename_variables,[],[i_0_19]) ).

cnf(i_0_44,plain,
    $false,
    inference(scs_inference,[],[i_0_24,i_0_25,i_0_42,i_0_23,i_0_19,i_0_38]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET933+1 : TPTP v9.2.1. Released v3.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.16/0.33  % Computer : n001.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 02:40:49 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 0.26/1.61  % Version  : CSE_E---1.7
% 0.26/1.61  % Problem  : theBenchmark.p
% 0.26/1.61  % SZS status Theorem for theBenchmark.p
% 0.26/1.61  % SZS output start CNFRefutation
% See solution above
% 0.26/1.64  % Total time : 1.271s
%------------------------------------------------------------------------------