TSTP Solution File: KLE074+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : KLE074+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n009.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 : Sun Jul 17 01:55:44 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(goals,conjecture,
    ! [X4,X5,X6] : domain(multiplication(multiplication(X4,X5),domain(X6))) = domain(multiplication(X4,domain(multiplication(X5,domain(X6))))),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).

fof(domain2,axiom,
    ! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).

fof(multiplicative_associativity,axiom,
    ! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X4,X5,X6] : domain(multiplication(multiplication(X4,X5),domain(X6))) = domain(multiplication(X4,domain(multiplication(X5,domain(X6))))),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_4,negated_conjecture,
    domain(multiplication(multiplication(esk1_0,esk2_0),domain(esk3_0))) != domain(multiplication(esk1_0,domain(multiplication(esk2_0,domain(esk3_0))))),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_5,plain,
    ! [X6,X7] : domain(multiplication(X6,X7)) = domain(multiplication(X6,domain(X7))),
    inference(variable_rename,[status(thm)],[domain2]) ).

fof(c_0_6,plain,
    ! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
    inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).

cnf(c_0_7,negated_conjecture,
    domain(multiplication(multiplication(esk1_0,esk2_0),domain(esk3_0))) != domain(multiplication(esk1_0,domain(multiplication(esk2_0,domain(esk3_0))))),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    domain(multiplication(esk1_0,multiplication(esk2_0,domain(esk3_0)))) != domain(multiplication(esk1_0,multiplication(esk2_0,esk3_0))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8]),c_0_9]) ).

cnf(c_0_11,plain,
    domain(multiplication(X1,multiplication(X2,domain(X3)))) = domain(multiplication(X1,multiplication(X2,X3))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_8]),c_0_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : KLE074+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : run_ET %s %d
% 0.13/0.33  % Computer : n009.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Thu Jun 16 09:30:23 EDT 2022
% 0.13/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             : 13
% 0.22/1.40  # Proof object clause steps            : 6
% 0.22/1.40  # Proof object formula steps           : 7
% 0.22/1.40  # Proof object conjectures             : 6
% 0.22/1.40  # Proof object clause conjectures      : 3
% 0.22/1.40  # Proof object formula conjectures     : 3
% 0.22/1.40  # Proof object initial clauses used    : 3
% 0.22/1.40  # Proof object initial formulas used   : 3
% 0.22/1.40  # Proof object generating inferences   : 1
% 0.22/1.40  # Proof object simplifying inferences  : 6
% 0.22/1.40  # Training examples: 0 positive, 0 negative
% 0.22/1.40  # Parsed axioms                        : 18
% 0.22/1.40  # Removed by relevancy pruning/SinE    : 8
% 0.22/1.40  # Initial clauses                      : 10
% 0.22/1.40  # Removed in clause preprocessing      : 0
% 0.22/1.40  # Initial clauses in saturation        : 10
% 0.22/1.40  # Processed clauses                    : 13
% 0.22/1.40  # ...of these trivial                  : 0
% 0.22/1.40  # ...subsumed                          : 0
% 0.22/1.40  # ...remaining for further processing  : 13
% 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                    : 55
% 0.22/1.40  # ...of the previous two non-trivial   : 31
% 0.22/1.40  # Contextual simplify-reflections      : 0
% 0.22/1.40  # Paramodulations                      : 55
% 0.22/1.40  # Factorizations                       : 0
% 0.22/1.40  # Equation resolutions                 : 0
% 0.22/1.40  # Current number of processed clauses  : 11
% 0.22/1.40  #    Positive orientable unit clauses  : 10
% 0.22/1.40  #    Positive unorientable unit clauses: 1
% 0.22/1.40  #    Negative unit clauses             : 0
% 0.22/1.40  #    Non-unit-clauses                  : 0
% 0.22/1.40  # Current number of unprocessed clauses: 28
% 0.22/1.40  # ...number of literals in the above   : 28
% 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) : 0
% 0.22/1.40  # Rec. Clause-clause subsumption calls : 0
% 0.22/1.40  # Non-unit clause-clause subsumptions  : 0
% 0.22/1.40  # Unit Clause-clause subsumption calls : 2
% 0.22/1.40  # Rewrite failures with RHS unbound    : 0
% 0.22/1.40  # BW rewrite match attempts            : 17
% 0.22/1.40  # BW rewrite match successes           : 14
% 0.22/1.40  # Condensation attempts                : 0
% 0.22/1.40  # Condensation successes               : 0
% 0.22/1.40  # Termbank termtop insertions          : 1046
% 0.22/1.40  
% 0.22/1.40  # -------------------------------------------------
% 0.22/1.40  # User time                : 0.013 s
% 0.22/1.40  # System time              : 0.002 s
% 0.22/1.40  # Total time               : 0.015 s
% 0.22/1.40  # Maximum resident set size: 2812 pages
%------------------------------------------------------------------------------