↑ Up

ET---2.0.THM-CRf.s

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

% Computer : n024.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:50:03 EDT 2022

% Result   : Theorem 0.22s 1.40s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   29 (   4 unt;   0 def)
%            Number of atoms       :   79 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   81 (  31   ~;  36   |;   9   &)
%                                         (   4 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   49 (   7 sgn  23   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thI46,conjecture,
    ! [X1,X3,X5] :
      ( ( subset(X1,X3)
        & subset(X1,X5) )
    <=> subset(X1,intersection(X3,X5)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thI46) ).

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

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

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X3,X5] :
        ( ( subset(X1,X3)
          & subset(X1,X5) )
      <=> subset(X1,intersection(X3,X5)) ),
    inference(assume_negation,[status(cth)],[thI46]) ).

fof(c_0_4,plain,
    ! [X4,X5,X6,X4,X5] :
      ( ( ~ subset(X4,X5)
        | ~ member(X6,X4)
        | member(X6,X5) )
      & ( member(esk4_2(X4,X5),X4)
        | subset(X4,X5) )
      & ( ~ member(esk4_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_5,negated_conjecture,
    ( ( ~ subset(esk1_0,esk2_0)
      | ~ subset(esk1_0,esk3_0)
      | ~ subset(esk1_0,intersection(esk2_0,esk3_0)) )
    & ( subset(esk1_0,esk2_0)
      | subset(esk1_0,intersection(esk2_0,esk3_0)) )
    & ( subset(esk1_0,esk3_0)
      | subset(esk1_0,intersection(esk2_0,esk3_0)) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

fof(c_0_6,plain,
    ! [X4,X5,X6,X4,X5,X6] :
      ( ( member(X4,X5)
        | ~ member(X4,intersection(X5,X6)) )
      & ( member(X4,X6)
        | ~ member(X4,intersection(X5,X6)) )
      & ( ~ member(X4,X5)
        | ~ member(X4,X6)
        | member(X4,intersection(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)],[intersection])])])])]) ).

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

cnf(c_0_8,negated_conjecture,
    ( subset(esk1_0,intersection(esk2_0,esk3_0))
    | subset(esk1_0,esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

cnf(c_0_10,negated_conjecture,
    ( member(X1,intersection(esk2_0,esk3_0))
    | subset(esk1_0,esk2_0)
    | ~ member(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ( subset(esk1_0,intersection(esk2_0,esk3_0))
    | subset(esk1_0,esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,negated_conjecture,
    ( member(X1,esk2_0)
    | ~ member(X1,esk1_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_7]) ).

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

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

cnf(c_0_15,negated_conjecture,
    ( member(X1,intersection(esk2_0,esk3_0))
    | subset(esk1_0,esk3_0)
    | ~ member(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_7,c_0_11]) ).

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

cnf(c_0_17,negated_conjecture,
    ( member(esk4_2(esk1_0,X1),esk2_0)
    | subset(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    ( member(X1,esk3_0)
    | ~ member(X1,esk1_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_7]) ).

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

cnf(c_0_20,negated_conjecture,
    ( ~ subset(esk1_0,intersection(esk2_0,esk3_0))
    | ~ subset(esk1_0,esk3_0)
    | ~ subset(esk1_0,esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_21,negated_conjecture,
    subset(esk1_0,esk2_0),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    ( member(esk4_2(esk1_0,X1),esk3_0)
    | subset(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_13]) ).

cnf(c_0_23,plain,
    ( subset(X1,intersection(X2,X3))
    | ~ member(esk4_2(X1,intersection(X2,X3)),X3)
    | ~ member(esk4_2(X1,intersection(X2,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_19]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ subset(esk1_0,intersection(esk2_0,esk3_0))
    | ~ subset(esk1_0,esk3_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).

cnf(c_0_25,negated_conjecture,
    subset(esk1_0,esk3_0),
    inference(spm,[status(thm)],[c_0_16,c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    ( subset(esk1_0,intersection(X1,esk3_0))
    | ~ member(esk4_2(esk1_0,intersection(X1,esk3_0)),X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_22]) ).

cnf(c_0_27,negated_conjecture,
    ~ subset(esk1_0,intersection(esk2_0,esk3_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_17]),c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET199+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n024.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 01:58:13 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.22/1.40  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40  # Preprocessing time       : 0.014 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             : 29
% 0.22/1.40  # Proof object clause steps            : 22
% 0.22/1.40  # Proof object formula steps           : 7
% 0.22/1.40  # Proof object conjectures             : 18
% 0.22/1.40  # Proof object clause conjectures      : 15
% 0.22/1.40  # Proof object formula conjectures     : 3
% 0.22/1.40  # Proof object initial clauses used    : 9
% 0.22/1.40  # Proof object initial formulas used   : 3
% 0.22/1.40  # Proof object generating inferences   : 11
% 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                        : 12
% 0.22/1.40  # Removed by relevancy pruning/SinE    : 9
% 0.22/1.40  # Initial clauses                      : 9
% 0.22/1.40  # Removed in clause preprocessing      : 0
% 0.22/1.40  # Initial clauses in saturation        : 9
% 0.22/1.40  # Processed clauses                    : 145
% 0.22/1.40  # ...of these trivial                  : 0
% 0.22/1.40  # ...subsumed                          : 24
% 0.22/1.40  # ...remaining for further processing  : 121
% 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                    : 1
% 0.22/1.40  # Backward-rewritten                   : 12
% 0.22/1.40  # Generated clauses                    : 478
% 0.22/1.40  # ...of the previous two non-trivial   : 467
% 0.22/1.40  # Contextual simplify-reflections      : 12
% 0.22/1.40  # Paramodulations                      : 478
% 0.22/1.40  # Factorizations                       : 0
% 0.22/1.40  # Equation resolutions                 : 0
% 0.22/1.40  # Current number of processed clauses  : 108
% 0.22/1.40  #    Positive orientable unit clauses  : 55
% 0.22/1.40  #    Positive unorientable unit clauses: 0
% 0.22/1.40  #    Negative unit clauses             : 1
% 0.22/1.40  #    Non-unit-clauses                  : 52
% 0.22/1.40  # Current number of unprocessed clauses: 320
% 0.22/1.40  # ...number of literals in the above   : 588
% 0.22/1.40  # Current number of archived formulas  : 0
% 0.22/1.40  # Current number of archived clauses   : 13
% 0.22/1.40  # Clause-clause subsumption calls (NU) : 416
% 0.22/1.40  # Rec. Clause-clause subsumption calls : 411
% 0.22/1.40  # Non-unit clause-clause subsumptions  : 37
% 0.22/1.40  # Unit Clause-clause subsumption calls : 209
% 0.22/1.40  # Rewrite failures with RHS unbound    : 0
% 0.22/1.40  # BW rewrite match attempts            : 86
% 0.22/1.40  # BW rewrite match successes           : 4
% 0.22/1.40  # Condensation attempts                : 0
% 0.22/1.40  # Condensation successes               : 0
% 0.22/1.40  # Termbank termtop insertions          : 7810
% 0.22/1.40  
% 0.22/1.40  # -------------------------------------------------
% 0.22/1.40  # User time                : 0.026 s
% 0.22/1.40  # System time              : 0.003 s
% 0.22/1.40  # Total time               : 0.029 s
% 0.22/1.40  # Maximum resident set size: 3344 pages
% 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.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
% 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.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
% 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
% 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.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48  eprover: No such file or directory
% 0.22/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48  eprover: No such file or directory
%------------------------------------------------------------------------------