↑ Up

ET---2.0.THM-CRf.s

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

% Computer : n005.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 00:52:17 EDT 2022

% Result   : Theorem 0.71s 99.89s
% Output   : CNFRefutation 0.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   36 (   6 unt;   0 def)
%            Number of atoms       :   97 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   96 (  35   ~;  43   |;  11   &)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   85 (  14 sgn  36   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thI27,conjecture,
    ! [X1,X4] :
      ( subset(X1,X4)
     => equal_set(union(difference(X4,X1),X1),X4) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thI27) ).

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(union,axiom,
    ! [X3,X1,X2] :
      ( member(X3,union(X1,X2))
    <=> ( member(X3,X1)
        | member(X3,X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',union) ).

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

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

fof(c_0_5,negated_conjecture,
    ~ ! [X1,X4] :
        ( subset(X1,X4)
       => equal_set(union(difference(X4,X1),X1),X4) ),
    inference(assume_negation,[status(cth)],[thI27]) ).

fof(c_0_6,plain,
    ! [X4,X5,X6,X4,X5] :
      ( ( ~ subset(X4,X5)
        | ~ member(X6,X4)
        | member(X6,X5) )
      & ( member(esk1_2(X4,X5),X4)
        | subset(X4,X5) )
      & ( ~ member(esk1_2(X4,X5),X5)
        | subset(X4,X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subset])])])])])])]) ).

fof(c_0_7,negated_conjecture,
    ( subset(esk4_0,esk5_0)
    & ~ equal_set(union(difference(esk5_0,esk4_0),esk4_0),esk5_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

fof(c_0_8,plain,
    ! [X4,X5,X6,X4,X5,X6] :
      ( ( ~ member(X4,union(X5,X6))
        | member(X4,X5)
        | member(X4,X6) )
      & ( ~ member(X4,X5)
        | member(X4,union(X5,X6)) )
      & ( ~ member(X4,X6)
        | member(X4,union(X5,X6)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])])])]) ).

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

cnf(c_0_10,negated_conjecture,
    subset(esk4_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X3,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

cnf(c_0_13,negated_conjecture,
    ( member(X1,esk5_0)
    | ~ member(X1,esk4_0) ),
    inference(pm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    ( member(esk1_2(union(X1,X2),X3),X1)
    | member(esk1_2(union(X1,X2),X3),X2)
    | subset(union(X1,X2),X3) ),
    inference(pm,[status(thm)],[c_0_11,c_0_12]) ).

fof(c_0_15,plain,
    ! [X5,X6,X7,X5,X6,X7] :
      ( ( member(X5,X7)
        | ~ member(X5,difference(X7,X6)) )
      & ( ~ member(X5,X6)
        | ~ member(X5,difference(X7,X6)) )
      & ( ~ member(X5,X7)
        | member(X5,X6)
        | member(X5,difference(X7,X6)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[difference])])])])])]) ).

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

cnf(c_0_17,negated_conjecture,
    ( member(esk1_2(union(X1,esk4_0),X2),esk5_0)
    | member(esk1_2(union(X1,esk4_0),X2),X1)
    | subset(union(X1,esk4_0),X2) ),
    inference(pm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_19,plain,
    ! [X3,X4,X3,X4] :
      ( ( subset(X3,X4)
        | ~ equal_set(X3,X4) )
      & ( subset(X4,X3)
        | ~ equal_set(X3,X4) )
      & ( ~ subset(X3,X4)
        | ~ subset(X4,X3)
        | equal_set(X3,X4) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])])])]) ).

cnf(c_0_20,plain,
    ( member(X1,X2)
    | ~ member(X1,difference(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    ( member(esk1_2(union(X1,esk4_0),esk5_0),X1)
    | subset(union(X1,esk4_0),esk5_0) ),
    inference(pm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,plain,
    ( subset(X1,union(X2,X3))
    | ~ member(esk1_2(X1,union(X2,X3)),X2) ),
    inference(pm,[status(thm)],[c_0_16,c_0_18]) ).

cnf(c_0_23,plain,
    ( member(X1,difference(X2,X3))
    | member(X1,X3)
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_24,negated_conjecture,
    ~ equal_set(union(difference(esk5_0,esk4_0),esk4_0),esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_25,plain,
    ( equal_set(X1,X2)
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_26,negated_conjecture,
    ( member(esk1_2(union(difference(X1,X2),esk4_0),esk5_0),X1)
    | subset(union(difference(X1,X2),esk4_0),esk5_0) ),
    inference(pm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_27,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_28,plain,
    ( member(esk1_2(X1,union(difference(X2,X3),X4)),X3)
    | subset(X1,union(difference(X2,X3),X4))
    | ~ member(esk1_2(X1,union(difference(X2,X3),X4)),X2) ),
    inference(pm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ subset(esk5_0,union(difference(esk5_0,esk4_0),esk4_0))
    | ~ subset(union(difference(esk5_0,esk4_0),esk4_0),esk5_0) ),
    inference(pm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,negated_conjecture,
    subset(union(difference(esk5_0,X1),esk4_0),esk5_0),
    inference(pm,[status(thm)],[c_0_16,c_0_26]) ).

cnf(c_0_31,plain,
    ( subset(X1,union(X2,X3))
    | ~ member(esk1_2(X1,union(X2,X3)),X3) ),
    inference(pm,[status(thm)],[c_0_16,c_0_27]) ).

cnf(c_0_32,plain,
    ( member(esk1_2(X1,union(difference(X1,X2),X3)),X2)
    | subset(X1,union(difference(X1,X2),X3)) ),
    inference(pm,[status(thm)],[c_0_28,c_0_12]) ).

cnf(c_0_33,negated_conjecture,
    ~ subset(esk5_0,union(difference(esk5_0,esk4_0),esk4_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).

cnf(c_0_34,plain,
    subset(X1,union(difference(X1,X2),X2)),
    inference(pm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET595+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n005.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 Jul 10 10:17:22 EDT 2022
% 0.18/0.33  % CPUTime  : 
% 0.32/23.39  eprover: CPU time limit exceeded, terminating
% 0.32/23.39  eprover: CPU time limit exceeded, terminating
% 0.32/23.40  eprover: CPU time limit exceeded, terminating
% 0.32/23.42  eprover: CPU time limit exceeded, terminating
% 0.44/46.42  eprover: CPU time limit exceeded, terminating
% 0.44/46.42  eprover: CPU time limit exceeded, terminating
% 0.44/46.43  eprover: CPU time limit exceeded, terminating
% 0.44/46.44  eprover: CPU time limit exceeded, terminating
% 0.56/69.44  eprover: CPU time limit exceeded, terminating
% 0.56/69.45  eprover: CPU time limit exceeded, terminating
% 0.56/69.45  eprover: CPU time limit exceeded, terminating
% 0.56/69.45  eprover: CPU time limit exceeded, terminating
% 0.68/92.46  eprover: CPU time limit exceeded, terminating
% 0.68/92.47  eprover: CPU time limit exceeded, terminating
% 0.68/92.47  eprover: CPU time limit exceeded, terminating
% 0.68/92.48  eprover: CPU time limit exceeded, terminating
% 0.71/99.89  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.71/99.89  
% 0.71/99.89  # Failure: Resource limit exceeded (time)
% 0.71/99.89  # OLD status Res
% 0.71/99.89  # Preprocessing time       : 0.016 s
% 0.71/99.89  # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.71/99.89  
% 0.71/99.89  # Failure: Resource limit exceeded (time)
% 0.71/99.89  # OLD status Res
% 0.71/99.89  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.71/99.89  # Preprocessing time       : 0.008 s
% 0.71/99.89  # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 0.71/99.89  
% 0.71/99.89  # Failure: Resource limit exceeded (time)
% 0.71/99.89  # OLD status Res
% 0.71/99.89  # Preprocessing time       : 0.016 s
% 0.71/99.89  # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 0.71/99.89  
% 0.71/99.89  # Failure: Resource limit exceeded (time)
% 0.71/99.89  # OLD status Res
% 0.71/99.89  # Preprocessing time       : 0.016 s
% 0.71/99.89  # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 0.71/99.89  # Preprocessing time       : 0.017 s
% 0.71/99.89  
% 0.71/99.89  # Proof found!
% 0.71/99.89  # SZS status Theorem
% 0.71/99.89  # SZS output start CNFRefutation
% See solution above
% 0.71/99.89  # Proof object total steps             : 36
% 0.71/99.89  # Proof object clause steps            : 25
% 0.71/99.89  # Proof object formula steps           : 11
% 0.71/99.89  # Proof object conjectures             : 13
% 0.71/99.89  # Proof object clause conjectures      : 10
% 0.71/99.89  # Proof object formula conjectures     : 3
% 0.71/99.89  # Proof object initial clauses used    : 11
% 0.71/99.89  # Proof object initial formulas used   : 5
% 0.71/99.89  # Proof object generating inferences   : 12
% 0.71/99.89  # Proof object simplifying inferences  : 4
% 0.71/99.89  # Training examples: 0 positive, 0 negative
% 0.71/99.89  # Parsed axioms                        : 12
% 0.71/99.89  # Removed by relevancy pruning/SinE    : 0
% 0.71/99.89  # Initial clauses                      : 31
% 0.71/99.89  # Removed in clause preprocessing      : 0
% 0.71/99.89  # Initial clauses in saturation        : 31
% 0.71/99.89  # Processed clauses                    : 7583
% 0.71/99.89  # ...of these trivial                  : 176
% 0.71/99.89  # ...subsumed                          : 1779
% 0.71/99.89  # ...remaining for further processing  : 5628
% 0.71/99.89  # Other redundant clauses eliminated   : 83
% 0.71/99.89  # Clauses deleted for lack of memory   : 335160
% 0.71/99.89  # Backward-subsumed                    : 30
% 0.71/99.89  # Backward-rewritten                   : 74
% 0.71/99.89  # Generated clauses                    : 481504
% 0.71/99.89  # ...of the previous two non-trivial   : 474155
% 0.71/99.89  # Contextual simplify-reflections      : 202
% 0.71/99.89  # Paramodulations                      : 481008
% 0.71/99.89  # Factorizations                       : 308
% 0.71/99.89  # Equation resolutions                 : 83
% 0.71/99.89  # Current number of processed clauses  : 5486
% 0.71/99.89  #    Positive orientable unit clauses  : 2723
% 0.71/99.89  #    Positive unorientable unit clauses: 0
% 0.71/99.89  #    Negative unit clauses             : 108
% 0.71/99.89  #    Non-unit-clauses                  : 2655
% 0.71/99.89  # Current number of unprocessed clauses: 121879
% 0.71/99.89  # ...number of literals in the above   : 311827
% 0.71/99.89  # Current number of archived formulas  : 0
% 0.71/99.89  # Current number of archived clauses   : 104
% 0.71/99.89  # Clause-clause subsumption calls (NU) : 858007
% 0.71/99.89  # Rec. Clause-clause subsumption calls : 552924
% 0.71/99.89  # Non-unit clause-clause subsumptions  : 1780
% 0.71/99.89  # Unit Clause-clause subsumption calls : 595007
% 0.71/99.89  # Rewrite failures with RHS unbound    : 0
% 0.71/99.89  # BW rewrite match attempts            : 69537
% 0.71/99.89  # BW rewrite match successes           : 72
% 0.71/99.89  # Condensation attempts                : 0
% 0.71/99.89  # Condensation successes               : 0
% 0.71/99.89  # Termbank termtop insertions          : 8017143
% 0.71/99.89  
% 0.71/99.89  # -------------------------------------------------
% 0.71/99.89  # User time                : 6.782 s
% 0.71/99.89  # System time              : 0.102 s
% 0.71/99.89  # Total time               : 6.884 s
% 0.71/99.89  # Maximum resident set size: 143644 pages
% 0.74/115.49  eprover: CPU time limit exceeded, terminating
% 0.74/115.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.74/115.51  eprover: No such file or directory
% 0.74/115.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.74/115.52  eprover: No such file or directory
% 0.74/115.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.74/115.52  eprover: No such file or directory
% 0.74/115.52  eprover: CPU time limit exceeded, terminating
% 0.74/115.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.74/115.53  eprover: No such file or directory
% 0.74/115.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.74/115.53  eprover: No such file or directory
% 0.74/115.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.74/115.53  eprover: No such file or directory
% 0.74/115.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.74/115.53  eprover: No such file or directory
% 0.74/115.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.74/115.54  eprover: No such file or directory
% 0.74/115.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.74/115.54  eprover: No such file or directory
% 0.74/115.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.74/115.54  eprover: No such file or directory
% 0.74/115.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.74/115.55  eprover: No such file or directory
% 0.74/115.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.74/115.55  eprover: No such file or directory
% 0.74/115.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.74/115.56  eprover: No such file or directory
% 0.74/115.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.74/115.56  eprover: No such file or directory
%------------------------------------------------------------------------------