↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : ITP019+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n022.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 : Sat Jul 16 22:46:03 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ,conjecture,
    ! [X14] :
      ( mem(X14,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal))
     => ( X14 != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
       => ap(c_2Ecomplex_2Ecomplex__inv,X14) != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ) ).

fof(conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0,axiom,
    ! [X14] :
      ( mem(X14,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal))
     => ( ap(c_2Ecomplex_2Ecomplex__inv,X14) = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
      <=> X14 = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X14] :
        ( mem(X14,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal))
       => ( X14 != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
         => ap(c_2Ecomplex_2Ecomplex__inv,X14) != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0) ) ),
    inference(assume_negation,[status(cth)],[conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ]) ).

fof(c_0_3,plain,
    ! [X15] :
      ( ( ap(c_2Ecomplex_2Ecomplex__inv,X15) != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
        | X15 = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
        | ~ mem(X15,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)) )
      & ( X15 != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
        | ap(c_2Ecomplex_2Ecomplex__inv,X15) = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
        | ~ mem(X15,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0])])]) ).

fof(c_0_4,negated_conjecture,
    ( mem(esk1_0,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal))
    & esk1_0 != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
    & ap(c_2Ecomplex_2Ecomplex__inv,esk1_0) = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_5,plain,
    ( X1 = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)
    | ~ mem(X1,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal))
    | ap(c_2Ecomplex_2Ecomplex__inv,X1) != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    ap(c_2Ecomplex_2Ecomplex__inv,esk1_0) = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    esk1_0 != ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( X1 = ap(c_2Ecomplex_2Ecomplex__inv,esk1_0)
    | ap(c_2Ecomplex_2Ecomplex__inv,X1) != ap(c_2Ecomplex_2Ecomplex__inv,esk1_0)
    | ~ mem(X1,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    mem(esk1_0,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_10,negated_conjecture,
    ap(c_2Ecomplex_2Ecomplex__inv,esk1_0) != esk1_0,
    inference(rw,[status(thm)],[c_0_7,c_0_6]) ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ITP019+2 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.14/0.34  % Computer : n022.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Fri Jun  3 11:21:51 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.25/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42  # Preprocessing time       : 0.016 s
% 0.25/1.42  
% 0.25/1.42  # Proof found!
% 0.25/1.42  # SZS status Theorem
% 0.25/1.42  # SZS output start CNFRefutation
% See solution above
% 0.25/1.42  # Proof object total steps             : 12
% 0.25/1.42  # Proof object clause steps            : 7
% 0.25/1.42  # Proof object formula steps           : 5
% 0.25/1.42  # Proof object conjectures             : 8
% 0.25/1.42  # Proof object clause conjectures      : 5
% 0.25/1.42  # Proof object formula conjectures     : 3
% 0.25/1.42  # Proof object initial clauses used    : 4
% 0.25/1.42  # Proof object initial formulas used   : 2
% 0.25/1.42  # Proof object generating inferences   : 1
% 0.25/1.42  # Proof object simplifying inferences  : 4
% 0.25/1.42  # Training examples: 0 positive, 0 negative
% 0.25/1.42  # Parsed axioms                        : 33
% 0.25/1.42  # Removed by relevancy pruning/SinE    : 18
% 0.25/1.42  # Initial clauses                      : 23
% 0.25/1.42  # Removed in clause preprocessing      : 3
% 0.25/1.42  # Initial clauses in saturation        : 20
% 0.25/1.42  # Processed clauses                    : 22
% 0.25/1.42  # ...of these trivial                  : 0
% 0.25/1.42  # ...subsumed                          : 0
% 0.25/1.42  # ...remaining for further processing  : 21
% 0.25/1.42  # Other redundant clauses eliminated   : 0
% 0.25/1.42  # Clauses deleted for lack of memory   : 0
% 0.25/1.42  # Backward-subsumed                    : 0
% 0.25/1.42  # Backward-rewritten                   : 1
% 0.25/1.42  # Generated clauses                    : 12
% 0.25/1.42  # ...of the previous two non-trivial   : 12
% 0.25/1.42  # Contextual simplify-reflections      : 0
% 0.25/1.42  # Paramodulations                      : 11
% 0.25/1.42  # Factorizations                       : 0
% 0.25/1.42  # Equation resolutions                 : 1
% 0.25/1.42  # Current number of processed clauses  : 20
% 0.25/1.42  #    Positive orientable unit clauses  : 8
% 0.25/1.42  #    Positive unorientable unit clauses: 0
% 0.25/1.42  #    Negative unit clauses             : 1
% 0.25/1.42  #    Non-unit-clauses                  : 11
% 0.25/1.42  # Current number of unprocessed clauses: 10
% 0.25/1.42  # ...number of literals in the above   : 47
% 0.25/1.42  # Current number of archived formulas  : 0
% 0.25/1.42  # Current number of archived clauses   : 1
% 0.25/1.42  # Clause-clause subsumption calls (NU) : 1
% 0.25/1.42  # Rec. Clause-clause subsumption calls : 1
% 0.25/1.42  # Non-unit clause-clause subsumptions  : 0
% 0.25/1.42  # Unit Clause-clause subsumption calls : 0
% 0.25/1.42  # Rewrite failures with RHS unbound    : 0
% 0.25/1.42  # BW rewrite match attempts            : 1
% 0.25/1.42  # BW rewrite match successes           : 1
% 0.25/1.42  # Condensation attempts                : 0
% 0.25/1.42  # Condensation successes               : 0
% 0.25/1.42  # Termbank termtop insertions          : 1911
% 0.25/1.42  
% 0.25/1.42  # -------------------------------------------------
% 0.25/1.42  # User time                : 0.014 s
% 0.25/1.42  # System time              : 0.003 s
% 0.25/1.42  # Total time               : 0.017 s
% 0.25/1.42  # Maximum resident set size: 3008 pages
%------------------------------------------------------------------------------