↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SEU307+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n028.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  : 600s
% DateTime : Tue Jul 19 09:18:50 EDT 2022

% Result   : Theorem 0.22s 1.40s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   26 (   7 unt;   0 def)
%            Number of atoms       :   53 (  16 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   48 (  21   ~;  14   |;   4   &)
%                                         (   1 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :   33 (   2 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t15_pre_topc,conjecture,
    ! [X1] :
      ( one_sorted_str(X1)
     => ! [X2] :
          ( element(X2,powerset(the_carrier(X1)))
         => subset_intersection2(the_carrier(X1),X2,cast_as_carrier_subset(X1)) = X2 ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t15_pre_topc) ).

fof(redefinition_k5_subset_1,axiom,
    ! [X1,X2,X3] :
      ( ( element(X2,powerset(X1))
        & element(X3,powerset(X1)) )
     => subset_intersection2(X1,X2,X3) = set_intersection2(X2,X3) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_k5_subset_1) ).

fof(dt_k2_pre_topc,axiom,
    ! [X1] :
      ( one_sorted_str(X1)
     => element(cast_as_carrier_subset(X1),powerset(the_carrier(X1))) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k2_pre_topc) ).

fof(d3_pre_topc,axiom,
    ! [X1] :
      ( one_sorted_str(X1)
     => cast_as_carrier_subset(X1) = the_carrier(X1) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_pre_topc) ).

fof(t28_xboole_1,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
     => set_intersection2(X1,X2) = X1 ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t28_xboole_1) ).

fof(t3_subset,axiom,
    ! [X1,X2] :
      ( element(X1,powerset(X2))
    <=> subset(X1,X2) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_subset) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1] :
        ( one_sorted_str(X1)
       => ! [X2] :
            ( element(X2,powerset(the_carrier(X1)))
           => subset_intersection2(the_carrier(X1),X2,cast_as_carrier_subset(X1)) = X2 ) ),
    inference(assume_negation,[status(cth)],[t15_pre_topc]) ).

fof(c_0_7,negated_conjecture,
    ( one_sorted_str(esk6_0)
    & element(esk7_0,powerset(the_carrier(esk6_0)))
    & subset_intersection2(the_carrier(esk6_0),esk7_0,cast_as_carrier_subset(esk6_0)) != esk7_0 ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).

fof(c_0_8,plain,
    ! [X4,X5,X6] :
      ( ~ element(X5,powerset(X4))
      | ~ element(X6,powerset(X4))
      | subset_intersection2(X4,X5,X6) = set_intersection2(X5,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_subset_1])]) ).

cnf(c_0_9,negated_conjecture,
    subset_intersection2(the_carrier(esk6_0),esk7_0,cast_as_carrier_subset(esk6_0)) != esk7_0,
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,plain,
    ( subset_intersection2(X1,X2,X3) = set_intersection2(X2,X3)
    | ~ element(X3,powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    element(esk7_0,powerset(the_carrier(esk6_0))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_12,plain,
    ! [X2] :
      ( ~ one_sorted_str(X2)
      | element(cast_as_carrier_subset(X2),powerset(the_carrier(X2))) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_pre_topc])]) ).

cnf(c_0_13,negated_conjecture,
    ( set_intersection2(esk7_0,cast_as_carrier_subset(esk6_0)) != esk7_0
    | ~ element(cast_as_carrier_subset(esk6_0),powerset(the_carrier(esk6_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_14,plain,
    ( element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))
    | ~ one_sorted_str(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    one_sorted_str(esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_16,plain,
    ! [X2] :
      ( ~ one_sorted_str(X2)
      | cast_as_carrier_subset(X2) = the_carrier(X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])]) ).

cnf(c_0_17,negated_conjecture,
    set_intersection2(esk7_0,cast_as_carrier_subset(esk6_0)) != esk7_0,
    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,plain,
    ( cast_as_carrier_subset(X1) = the_carrier(X1)
    | ~ one_sorted_str(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

fof(c_0_19,plain,
    ! [X3,X4] :
      ( ~ subset(X3,X4)
      | set_intersection2(X3,X4) = X3 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).

fof(c_0_20,plain,
    ! [X3,X4,X3,X4] :
      ( ( ~ element(X3,powerset(X4))
        | subset(X3,X4) )
      & ( ~ subset(X3,X4)
        | element(X3,powerset(X4)) ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])])]) ).

cnf(c_0_21,negated_conjecture,
    set_intersection2(esk7_0,the_carrier(esk6_0)) != esk7_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15])]) ).

cnf(c_0_22,plain,
    ( set_intersection2(X1,X2) = X1
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_23,plain,
    ( subset(X1,X2)
    | ~ element(X1,powerset(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_24,negated_conjecture,
    ~ subset(esk7_0,the_carrier(esk6_0)),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_11]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SEU307+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jun 19 10:58:30 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.22/1.40  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.22/1.40  # Preprocessing time       : 0.018 s
% 0.22/1.40  
% 0.22/1.40  # Proof found!
% 0.22/1.40  # SZS status Theorem
% 0.22/1.40  # SZS output start CNFRefutation
% See solution above
% 0.22/1.40  # Proof object total steps             : 26
% 0.22/1.40  # Proof object clause steps            : 13
% 0.22/1.40  # Proof object formula steps           : 13
% 0.22/1.40  # Proof object conjectures             : 11
% 0.22/1.40  # Proof object clause conjectures      : 8
% 0.22/1.40  # Proof object formula conjectures     : 3
% 0.22/1.40  # Proof object initial clauses used    : 8
% 0.22/1.40  # Proof object initial formulas used   : 6
% 0.22/1.40  # Proof object generating inferences   : 5
% 0.22/1.40  # Proof object simplifying inferences  : 7
% 0.22/1.40  # Training examples: 0 positive, 0 negative
% 0.22/1.40  # Parsed axioms                        : 59
% 0.22/1.40  # Removed by relevancy pruning/SinE    : 0
% 0.22/1.40  # Initial clauses                      : 118
% 0.22/1.40  # Removed in clause preprocessing      : 6
% 0.22/1.40  # Initial clauses in saturation        : 112
% 0.22/1.40  # Processed clauses                    : 129
% 0.22/1.40  # ...of these trivial                  : 0
% 0.22/1.40  # ...subsumed                          : 6
% 0.22/1.40  # ...remaining for further processing  : 122
% 0.22/1.40  # Other redundant clauses eliminated   : 0
% 0.22/1.40  # Clauses deleted for lack of memory   : 0
% 0.22/1.40  # Backward-subsumed                    : 0
% 0.22/1.40  # Backward-rewritten                   : 2
% 0.22/1.40  # Generated clauses                    : 499
% 0.22/1.40  # ...of the previous two non-trivial   : 397
% 0.22/1.40  # Contextual simplify-reflections      : 0
% 0.22/1.40  # Paramodulations                      : 499
% 0.22/1.40  # Factorizations                       : 0
% 0.22/1.40  # Equation resolutions                 : 0
% 0.22/1.40  # Current number of processed clauses  : 120
% 0.22/1.40  #    Positive orientable unit clauses  : 21
% 0.22/1.40  #    Positive unorientable unit clauses: 1
% 0.22/1.40  #    Negative unit clauses             : 8
% 0.22/1.40  #    Non-unit-clauses                  : 90
% 0.22/1.40  # Current number of unprocessed clauses: 340
% 0.22/1.40  # ...number of literals in the above   : 875
% 0.22/1.40  # Current number of archived formulas  : 0
% 0.22/1.40  # Current number of archived clauses   : 2
% 0.22/1.40  # Clause-clause subsumption calls (NU) : 905
% 0.22/1.40  # Rec. Clause-clause subsumption calls : 869
% 0.22/1.40  # Non-unit clause-clause subsumptions  : 1
% 0.22/1.40  # Unit Clause-clause subsumption calls : 16
% 0.22/1.40  # Rewrite failures with RHS unbound    : 0
% 0.22/1.40  # BW rewrite match attempts            : 7
% 0.22/1.40  # BW rewrite match successes           : 7
% 0.22/1.40  # Condensation attempts                : 0
% 0.22/1.40  # Condensation successes               : 0
% 0.22/1.40  # Termbank termtop insertions          : 9083
% 0.22/1.40  
% 0.22/1.40  # -------------------------------------------------
% 0.22/1.40  # User time                : 0.021 s
% 0.22/1.40  # System time              : 0.004 s
% 0.22/1.40  # Total time               : 0.025 s
% 0.22/1.40  # Maximum resident set size: 3304 pages
% 0.22/23.40  eprover: CPU time limit exceeded, terminating
% 0.22/23.40  eprover: CPU time limit exceeded, terminating
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47  eprover: No such file or directory
%------------------------------------------------------------------------------