TSTP Solution File: KLE066+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE066+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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:41 EDT 2022
% Result : Theorem 0.26s 1.43s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 18 unt; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 0 =>; 2 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 1 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( multiplication(X4,X5) = zero
<= multiplication(X4,domain(X5)) = zero ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).
fof(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(domain4,axiom,
domain(zero) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain4) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(c_0_6,negated_conjecture,
~ ! [X4,X5] :
( multiplication(X4,X5) = zero
<= multiplication(X4,domain(X5)) = zero ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X6,X7] : domain(multiplication(X6,X7)) = domain(multiplication(X6,domain(X7))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_8,negated_conjecture,
( multiplication(esk1_0,domain(esk2_0)) = zero
& multiplication(esk1_0,esk2_0) != zero ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,plain,
! [X5] : addition(X5,multiplication(domain(X5),X5)) = multiplication(domain(X5),X5),
inference(variable_rename,[status(thm)],[domain1]) ).
cnf(c_0_10,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
multiplication(esk1_0,domain(esk2_0)) = zero,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
domain(zero) = zero,
inference(split_conjunct,[status(thm)],[domain4]) ).
fof(c_0_13,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_14,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_15,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
domain(multiplication(esk1_0,esk2_0)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_17,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
multiplication(esk1_0,esk2_0) != zero,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]),c_0_17]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE066+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n012.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 : Thu Jun 16 15:11:54 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.26/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.43 # Preprocessing time : 0.018 s
% 0.26/1.43
% 0.26/1.43 # Proof found!
% 0.26/1.43 # SZS status Theorem
% 0.26/1.43 # SZS output start CNFRefutation
% See solution above
% 0.26/1.43 # Proof object total steps : 21
% 0.26/1.43 # Proof object clause steps : 9
% 0.26/1.43 # Proof object formula steps : 12
% 0.26/1.43 # Proof object conjectures : 7
% 0.26/1.43 # Proof object clause conjectures : 4
% 0.26/1.43 # Proof object formula conjectures : 3
% 0.26/1.43 # Proof object initial clauses used : 7
% 0.26/1.43 # Proof object initial formulas used : 6
% 0.26/1.43 # Proof object generating inferences : 2
% 0.26/1.43 # Proof object simplifying inferences : 5
% 0.26/1.43 # Training examples: 0 positive, 0 negative
% 0.26/1.43 # Parsed axioms : 18
% 0.26/1.43 # Removed by relevancy pruning/SinE : 4
% 0.26/1.43 # Initial clauses : 15
% 0.26/1.43 # Removed in clause preprocessing : 0
% 0.26/1.43 # Initial clauses in saturation : 15
% 0.26/1.43 # Processed clauses : 17
% 0.26/1.43 # ...of these trivial : 0
% 0.26/1.43 # ...subsumed : 0
% 0.26/1.43 # ...remaining for further processing : 17
% 0.26/1.43 # Other redundant clauses eliminated : 0
% 0.26/1.43 # Clauses deleted for lack of memory : 0
% 0.26/1.43 # Backward-subsumed : 0
% 0.26/1.43 # Backward-rewritten : 0
% 0.26/1.43 # Generated clauses : 75
% 0.26/1.43 # ...of the previous two non-trivial : 46
% 0.26/1.43 # Contextual simplify-reflections : 0
% 0.26/1.43 # Paramodulations : 75
% 0.26/1.43 # Factorizations : 0
% 0.26/1.43 # Equation resolutions : 0
% 0.26/1.43 # Current number of processed clauses : 17
% 0.26/1.43 # Positive orientable unit clauses : 15
% 0.26/1.43 # Positive unorientable unit clauses: 1
% 0.26/1.43 # Negative unit clauses : 1
% 0.26/1.43 # Non-unit-clauses : 0
% 0.26/1.43 # Current number of unprocessed clauses: 44
% 0.26/1.43 # ...number of literals in the above : 44
% 0.26/1.43 # Current number of archived formulas : 0
% 0.26/1.43 # Current number of archived clauses : 0
% 0.26/1.43 # Clause-clause subsumption calls (NU) : 0
% 0.26/1.43 # Rec. Clause-clause subsumption calls : 0
% 0.26/1.43 # Non-unit clause-clause subsumptions : 0
% 0.26/1.43 # Unit Clause-clause subsumption calls : 1
% 0.26/1.43 # Rewrite failures with RHS unbound : 0
% 0.26/1.43 # BW rewrite match attempts : 9
% 0.26/1.43 # BW rewrite match successes : 8
% 0.26/1.43 # Condensation attempts : 0
% 0.26/1.43 # Condensation successes : 0
% 0.26/1.43 # Termbank termtop insertions : 1294
% 0.26/1.43
% 0.26/1.43 # -------------------------------------------------
% 0.26/1.43 # User time : 0.017 s
% 0.26/1.43 # System time : 0.003 s
% 0.26/1.43 # Total time : 0.020 s
% 0.26/1.43 # Maximum resident set size: 2816 pages
%------------------------------------------------------------------------------