TSTP Solution File: KLE056+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE056+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:38 EDT 2022
% Result : Theorem 0.21s 1.41s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 12 unt; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 11 ( 1 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4] :
( domain(X4) = zero
=> X4 = zero ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(c_0_4,negated_conjecture,
~ ! [X4] :
( domain(X4) = zero
=> X4 = zero ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_5,plain,
! [X5] : addition(X5,multiplication(domain(X5),X5)) = multiplication(domain(X5),X5),
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_6,negated_conjecture,
( domain(esk1_0) = zero
& esk1_0 != zero ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_8,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_9,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
domain(esk1_0) = zero,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 != zero,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,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_9,c_0_10]),c_0_11]),c_0_12]),c_0_11]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : KLE056+1 : TPTP v8.1.0. Released v4.0.0.
% 0.09/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n020.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 14:01:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.41 # Preprocessing time : 0.014 s
% 0.21/1.41
% 0.21/1.41 # Proof found!
% 0.21/1.41 # SZS status Theorem
% 0.21/1.41 # SZS output start CNFRefutation
% See solution above
% 0.21/1.41 # Proof object total steps : 15
% 0.21/1.41 # Proof object clause steps : 6
% 0.21/1.41 # Proof object formula steps : 9
% 0.21/1.41 # Proof object conjectures : 6
% 0.21/1.41 # Proof object clause conjectures : 3
% 0.21/1.41 # Proof object formula conjectures : 3
% 0.21/1.41 # Proof object initial clauses used : 5
% 0.21/1.41 # Proof object initial formulas used : 4
% 0.21/1.41 # Proof object generating inferences : 1
% 0.21/1.41 # Proof object simplifying inferences : 4
% 0.21/1.41 # Training examples: 0 positive, 0 negative
% 0.21/1.41 # Parsed axioms : 18
% 0.21/1.41 # Removed by relevancy pruning/SinE : 4
% 0.21/1.41 # Initial clauses : 15
% 0.21/1.41 # Removed in clause preprocessing : 0
% 0.21/1.41 # Initial clauses in saturation : 15
% 0.21/1.41 # Processed clauses : 10
% 0.21/1.41 # ...of these trivial : 0
% 0.21/1.41 # ...subsumed : 0
% 0.21/1.41 # ...remaining for further processing : 10
% 0.21/1.41 # Other redundant clauses eliminated : 0
% 0.21/1.41 # Clauses deleted for lack of memory : 0
% 0.21/1.41 # Backward-subsumed : 0
% 0.21/1.41 # Backward-rewritten : 0
% 0.21/1.41 # Generated clauses : 12
% 0.21/1.41 # ...of the previous two non-trivial : 4
% 0.21/1.41 # Contextual simplify-reflections : 0
% 0.21/1.41 # Paramodulations : 12
% 0.21/1.41 # Factorizations : 0
% 0.21/1.41 # Equation resolutions : 0
% 0.21/1.41 # Current number of processed clauses : 10
% 0.21/1.41 # Positive orientable unit clauses : 9
% 0.21/1.41 # Positive unorientable unit clauses: 0
% 0.21/1.41 # Negative unit clauses : 1
% 0.21/1.41 # Non-unit-clauses : 0
% 0.21/1.41 # Current number of unprocessed clauses: 9
% 0.21/1.41 # ...number of literals in the above : 9
% 0.21/1.41 # Current number of archived formulas : 0
% 0.21/1.41 # Current number of archived clauses : 0
% 0.21/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.21/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.21/1.41 # Non-unit clause-clause subsumptions : 0
% 0.21/1.41 # Unit Clause-clause subsumption calls : 0
% 0.21/1.41 # Rewrite failures with RHS unbound : 0
% 0.21/1.41 # BW rewrite match attempts : 0
% 0.21/1.41 # BW rewrite match successes : 0
% 0.21/1.41 # Condensation attempts : 0
% 0.21/1.41 # Condensation successes : 0
% 0.21/1.41 # Termbank termtop insertions : 669
% 0.21/1.41
% 0.21/1.41 # -------------------------------------------------
% 0.21/1.41 # User time : 0.013 s
% 0.21/1.41 # System time : 0.002 s
% 0.21/1.41 # Total time : 0.015 s
% 0.21/1.41 # Maximum resident set size: 2812 pages
%------------------------------------------------------------------------------