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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : KLE083+1 : TPTP v8.1.0. Released v4.0.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 : Sun Jul 17 01:55:46 EDT 2022

% Result   : Theorem 0.24s 1.41s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   31 (  31 unt;   0 def)
%            Number of atoms       :   31 (  30 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   37 (   0 sgn  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(additive_identity,axiom,
    ! [X1] : addition(X1,zero) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).

fof(additive_commutativity,axiom,
    ! [X1,X2] : addition(X1,X2) = addition(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).

fof(goals,conjecture,
    ! [X4] : X4 = multiplication(domain(X4),X4),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).

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

fof(domain1,axiom,
    ! [X4] : multiplication(antidomain(X4),X4) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain1) ).

fof(domain3,axiom,
    ! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain3) ).

fof(domain4,axiom,
    ! [X4] : domain(X4) = antidomain(antidomain(X4)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+4.ax',domain4) ).

fof(multiplicative_left_identity,axiom,
    ! [X1] : multiplication(one,X1) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).

fof(c_0_8,plain,
    ! [X2] : addition(X2,zero) = X2,
    inference(variable_rename,[status(thm)],[additive_identity]) ).

fof(c_0_9,plain,
    ! [X3,X4] : addition(X3,X4) = addition(X4,X3),
    inference(variable_rename,[status(thm)],[additive_commutativity]) ).

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

fof(c_0_11,plain,
    ! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
    inference(variable_rename,[status(thm)],[left_distributivity]) ).

fof(c_0_12,plain,
    ! [X5] : multiplication(antidomain(X5),X5) = zero,
    inference(variable_rename,[status(thm)],[domain1]) ).

cnf(c_0_13,plain,
    addition(X1,zero) = X1,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    addition(X1,X2) = addition(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_15,plain,
    ! [X5] : addition(antidomain(antidomain(X5)),antidomain(X5)) = one,
    inference(variable_rename,[status(thm)],[domain3]) ).

fof(c_0_16,negated_conjecture,
    esk1_0 != multiplication(domain(esk1_0),esk1_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).

fof(c_0_17,plain,
    ! [X5] : domain(X5) = antidomain(antidomain(X5)),
    inference(variable_rename,[status(thm)],[domain4]) ).

cnf(c_0_18,plain,
    multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_19,plain,
    multiplication(antidomain(X1),X1) = zero,
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_20,plain,
    addition(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_21,plain,
    addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_22,plain,
    ! [X2] : multiplication(one,X2) = X2,
    inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).

cnf(c_0_23,negated_conjecture,
    esk1_0 != multiplication(domain(esk1_0),esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_24,plain,
    domain(X1) = antidomain(antidomain(X1)),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_25,plain,
    multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_26,plain,
    addition(antidomain(X1),antidomain(antidomain(X1))) = one,
    inference(rw,[status(thm)],[c_0_21,c_0_14]) ).

cnf(c_0_27,plain,
    multiplication(one,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_28,negated_conjecture,
    esk1_0 != multiplication(antidomain(antidomain(esk1_0)),esk1_0),
    inference(rw,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,plain,
    multiplication(antidomain(antidomain(X1)),X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KLE083+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n022.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 : Thu Jun 16 15:35:32 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.24/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41  # Preprocessing time       : 0.014 s
% 0.24/1.41  
% 0.24/1.41  # Proof found!
% 0.24/1.41  # SZS status Theorem
% 0.24/1.41  # SZS output start CNFRefutation
% See solution above
% 0.24/1.41  # Proof object total steps             : 31
% 0.24/1.41  # Proof object clause steps            : 14
% 0.24/1.41  # Proof object formula steps           : 17
% 0.24/1.41  # Proof object conjectures             : 6
% 0.24/1.41  # Proof object clause conjectures      : 3
% 0.24/1.41  # Proof object formula conjectures     : 3
% 0.24/1.41  # Proof object initial clauses used    : 8
% 0.24/1.41  # Proof object initial formulas used   : 8
% 0.24/1.41  # Proof object generating inferences   : 3
% 0.24/1.41  # Proof object simplifying inferences  : 6
% 0.24/1.41  # Training examples: 0 positive, 0 negative
% 0.24/1.41  # Parsed axioms                        : 21
% 0.24/1.41  # Removed by relevancy pruning/SinE    : 2
% 0.24/1.41  # Initial clauses                      : 19
% 0.24/1.41  # Removed in clause preprocessing      : 1
% 0.24/1.41  # Initial clauses in saturation        : 18
% 0.24/1.41  # Processed clauses                    : 137
% 0.24/1.41  # ...of these trivial                  : 26
% 0.24/1.41  # ...subsumed                          : 23
% 0.24/1.41  # ...remaining for further processing  : 88
% 0.24/1.41  # Other redundant clauses eliminated   : 0
% 0.24/1.41  # Clauses deleted for lack of memory   : 0
% 0.24/1.41  # Backward-subsumed                    : 0
% 0.24/1.41  # Backward-rewritten                   : 22
% 0.24/1.41  # Generated clauses                    : 2198
% 0.24/1.41  # ...of the previous two non-trivial   : 1099
% 0.24/1.41  # Contextual simplify-reflections      : 0
% 0.24/1.41  # Paramodulations                      : 2198
% 0.24/1.41  # Factorizations                       : 0
% 0.24/1.41  # Equation resolutions                 : 0
% 0.24/1.41  # Current number of processed clauses  : 66
% 0.24/1.41  #    Positive orientable unit clauses  : 57
% 0.24/1.41  #    Positive unorientable unit clauses: 9
% 0.24/1.41  #    Negative unit clauses             : 0
% 0.24/1.41  #    Non-unit-clauses                  : 0
% 0.24/1.41  # Current number of unprocessed clauses: 861
% 0.24/1.41  # ...number of literals in the above   : 861
% 0.24/1.41  # Current number of archived formulas  : 0
% 0.24/1.41  # Current number of archived clauses   : 23
% 0.24/1.41  # Clause-clause subsumption calls (NU) : 0
% 0.24/1.41  # Rec. Clause-clause subsumption calls : 0
% 0.24/1.41  # Non-unit clause-clause subsumptions  : 0
% 0.24/1.41  # Unit Clause-clause subsumption calls : 11
% 0.24/1.41  # Rewrite failures with RHS unbound    : 0
% 0.24/1.41  # BW rewrite match attempts            : 121
% 0.24/1.41  # BW rewrite match successes           : 48
% 0.24/1.41  # Condensation attempts                : 0
% 0.24/1.41  # Condensation successes               : 0
% 0.24/1.41  # Termbank termtop insertions          : 23577
% 0.24/1.41  
% 0.24/1.41  # -------------------------------------------------
% 0.24/1.41  # User time                : 0.037 s
% 0.24/1.41  # System time              : 0.003 s
% 0.24/1.41  # Total time               : 0.040 s
% 0.24/1.41  # Maximum resident set size: 4136 pages
% 0.24/23.42  eprover: CPU time limit exceeded, terminating
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49  eprover: No such file or directory
% 0.24/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50  eprover: No such file or directory
%------------------------------------------------------------------------------