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

View Problem - Process Solution

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

% Computer : n028.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:56:02 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   44 (  44 unt;   0 def)
%            Number of atoms       :   44 (  43 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :   12 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-2 aty)
%            Number of variables   :   48 (   1 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(complement,axiom,
    ! [X4] : c(X4) = antidomain(domain(X4)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+6.ax',complement) ).

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

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

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

fof(forward_box,axiom,
    ! [X4,X5] : forward_box(X4,X5) = c(forward_diamond(X4,c(X5))),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+6.ax',forward_box) ).

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

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

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

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

fof(c_0_11,plain,
    ! [X5] : c(X5) = antidomain(domain(X5)),
    inference(variable_rename,[status(thm)],[complement]) ).

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

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

fof(c_0_14,negated_conjecture,
    ~ ! [X4] : forward_box(X4,one) = one,
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_15,plain,
    ! [X6,X7] : forward_box(X6,X7) = c(forward_diamond(X6,c(X7))),
    inference(variable_rename,[status(thm)],[forward_box]) ).

cnf(c_0_16,plain,
    c(X1) = antidomain(domain(X1)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

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

cnf(c_0_18,plain,
    forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_19,negated_conjecture,
    forward_box(esk1_0,one) != one,
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).

cnf(c_0_20,plain,
    forward_box(X1,X2) = c(forward_diamond(X1,c(X2))),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,plain,
    c(X1) = antidomain(antidomain(antidomain(X1))),
    inference(rw,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,plain,
    forward_diamond(X1,X2) = antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_17]),c_0_17]) ).

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

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

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

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

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

cnf(c_0_28,negated_conjecture,
    forward_box(esk1_0,one) != one,
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_29,plain,
    forward_box(X1,X2) = antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(X1,antidomain(antidomain(antidomain(antidomain(antidomain(X2))))))))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]),c_0_22]) ).

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

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

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

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

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

cnf(c_0_35,negated_conjecture,
    antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(antidomain(one))))))))))) != one,
    inference(rw,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_36,plain,
    antidomain(one) = zero,
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_37,plain,
    addition(antidomain(X1),antidomain(antidomain(X1))) = one,
    inference(rw,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_38,plain,
    addition(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_34,c_0_33]) ).

fof(c_0_39,plain,
    ! [X2] : multiplication(X2,zero) = zero,
    inference(variable_rename,[status(thm)],[right_annihilation]) ).

cnf(c_0_40,negated_conjecture,
    antidomain(antidomain(antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(zero)))))))))) != one,
    inference(rw,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_41,plain,
    antidomain(zero) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_36]),c_0_38]) ).

cnf(c_0_42,plain,
    multiplication(X1,zero) = zero,
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_43,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_36]),c_0_41]),c_0_36]),c_0_42]),c_0_41]),c_0_36]),c_0_41]),c_0_36]),c_0_41])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : KLE114+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n028.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun 16 12:17:41 EDT 2022
% 0.12/0.35  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42  # Preprocessing time       : 0.015 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 44
% 0.24/1.42  # Proof object clause steps            : 21
% 0.24/1.42  # Proof object formula steps           : 23
% 0.24/1.42  # Proof object conjectures             : 7
% 0.24/1.42  # Proof object clause conjectures      : 4
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 11
% 0.24/1.42  # Proof object initial formulas used   : 11
% 0.24/1.42  # Proof object generating inferences   : 3
% 0.24/1.42  # Proof object simplifying inferences  : 21
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 27
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 5
% 0.24/1.42  # Initial clauses                      : 22
% 0.24/1.42  # Removed in clause preprocessing      : 4
% 0.24/1.42  # Initial clauses in saturation        : 18
% 0.24/1.42  # Processed clauses                    : 27
% 0.24/1.42  # ...of these trivial                  : 1
% 0.24/1.42  # ...subsumed                          : 0
% 0.24/1.42  # ...remaining for further processing  : 26
% 0.24/1.42  # Other redundant clauses eliminated   : 0
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 0
% 0.24/1.42  # Backward-rewritten                   : 4
% 0.24/1.42  # Generated clauses                    : 143
% 0.24/1.42  # ...of the previous two non-trivial   : 104
% 0.24/1.42  # Contextual simplify-reflections      : 0
% 0.24/1.42  # Paramodulations                      : 143
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 0
% 0.24/1.42  # Current number of processed clauses  : 22
% 0.24/1.42  #    Positive orientable unit clauses  : 20
% 0.24/1.42  #    Positive unorientable unit clauses: 2
% 0.24/1.42  #    Negative unit clauses             : 0
% 0.24/1.42  #    Non-unit-clauses                  : 0
% 0.24/1.42  # Current number of unprocessed clauses: 95
% 0.24/1.42  # ...number of literals in the above   : 95
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 8
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 0
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 0
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 0
% 0.24/1.42  # Unit Clause-clause subsumption calls : 1
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 13
% 0.24/1.42  # BW rewrite match successes           : 12
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 2128
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.018 s
% 0.24/1.42  # System time              : 0.000 s
% 0.24/1.42  # Total time               : 0.018 s
% 0.24/1.42  # Maximum resident set size: 2824 pages
% 0.24/23.43  eprover: CPU time limit exceeded, terminating
% 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
% 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
% 0.24/23.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.51  eprover: No such file or directory
%------------------------------------------------------------------------------