↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : SET705+4 : TPTP v9.2.1. Released v2.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 : n031.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:08:21 PM UTC 2026

% Result   : Theorem 1.30s 1.73s
% Output   : CNFRefutation 1.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   6 unt;   0 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   28 (  11   ~;  11   |;   3   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(power_set,axiom,
    ! [X3,X1] :
      ( member(X3,power_set(X1))
    <=> subset(X3,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',power_set) ).

fof(subset,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( member(X3,X1)
         => member(X3,X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).

fof(thI48,conjecture,
    ! [X1] : member(X1,power_set(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI48) ).

fof(c_0_3,plain,
    ! [X43,X44] :
      ( ( ~ member(X43,power_set(X44))
        | subset(X43,X44) )
      & ( ~ subset(X43,X44)
        | member(X43,power_set(X44)) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[power_set])]) ).

fof(c_0_4,plain,
    ! [X35,X36,X37,X38,X39] :
      ( ( ~ subset(X35,X36)
        | ~ member(X37,X35)
        | member(X37,X36) )
      & ( member(esk1_2(X38,X39),X38)
        | subset(X38,X39) )
      & ( ~ member(esk1_2(X38,X39),X39)
        | subset(X38,X39) ) ),
    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)],[subset])])])])])]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] : member(X1,power_set(X1)),
    inference(assume_negation,[status(cth)],[thI48]) ).

cnf(c_0_6,plain,
    ( member(X1,power_set(X2))
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_7,plain,
    ( subset(X1,X2)
    | ~ member(esk1_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( member(esk1_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_9,negated_conjecture,
    ~ member(esk4_0,power_set(esk4_0)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_10,plain,
    ( member(X1,power_set(X2))
    | ~ member(esk1_2(X1,X2),X2) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,plain,
    ( member(esk1_2(X1,X2),X1)
    | member(X1,power_set(X2)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    ~ member(esk4_0,power_set(esk4_0)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    member(X1,power_set(X1)),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SET705+4 : TPTP v9.2.1. Released v2.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.15/0.33  % Computer : n031.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 02:34:23 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.30/1.73  % Version  : CSE_E---1.7
% 1.30/1.73  % Problem  : theBenchmark.p
% 1.30/1.73  % SZS status Theorem for theBenchmark.p
% 1.30/1.73  % SZS output start CNFRefutation
% See solution above
% 1.30/1.73  % Total time : 1.371s
%------------------------------------------------------------------------------