TSTP Solution File: KLE148+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE148+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:14 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 27 unt; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 3 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5] :
( multiplication(X4,X5) = zero
=> multiplication(X4,strong_iteration(X5)) = X4 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(distributivity1,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',distributivity1) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_identity) ).
fof(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_right_identity) ).
fof(c_0_8,negated_conjecture,
~ ! [X4,X5] :
( multiplication(X4,X5) = zero
=> multiplication(X4,strong_iteration(X5)) = X4 ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_9,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_10,negated_conjecture,
( multiplication(esk1_0,esk2_0) = zero
& multiplication(esk1_0,strong_iteration(esk2_0)) != esk1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_12,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[distributivity1]) ).
cnf(c_0_13,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
multiplication(esk1_0,esk2_0) = zero,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_17,plain,
! [X2] : strong_iteration(X2) = addition(multiplication(X2,strong_iteration(X2)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
fof(c_0_18,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_19,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
multiplication(esk1_0,multiplication(esk2_0,X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_21,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_25,negated_conjecture,
multiplication(esk1_0,addition(X1,multiplication(esk2_0,X2))) = multiplication(esk1_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_26,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
multiplication(esk1_0,strong_iteration(esk2_0)) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE148+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n023.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 16:45:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.015 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 30
% 0.23/1.41 # Proof object clause steps : 13
% 0.23/1.41 # Proof object formula steps : 17
% 0.23/1.41 # Proof object conjectures : 8
% 0.23/1.41 # Proof object clause conjectures : 5
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 9
% 0.23/1.41 # Proof object initial formulas used : 8
% 0.23/1.41 # Proof object generating inferences : 3
% 0.23/1.41 # Proof object simplifying inferences : 5
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 19
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 21
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 21
% 0.23/1.41 # Processed clauses : 355
% 0.23/1.41 # ...of these trivial : 22
% 0.23/1.41 # ...subsumed : 160
% 0.23/1.41 # ...remaining for further processing : 173
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 5
% 0.23/1.41 # Backward-rewritten : 9
% 0.23/1.41 # Generated clauses : 3715
% 0.23/1.41 # ...of the previous two non-trivial : 3038
% 0.23/1.41 # Contextual simplify-reflections : 53
% 0.23/1.41 # Paramodulations : 3715
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 159
% 0.23/1.41 # Positive orientable unit clauses : 44
% 0.23/1.41 # Positive unorientable unit clauses: 7
% 0.23/1.41 # Negative unit clauses : 3
% 0.23/1.41 # Non-unit-clauses : 105
% 0.23/1.41 # Current number of unprocessed clauses: 2601
% 0.23/1.41 # ...number of literals in the above : 5120
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 14
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 880
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 875
% 0.23/1.41 # Non-unit clause-clause subsumptions : 122
% 0.23/1.41 # Unit Clause-clause subsumption calls : 93
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 82
% 0.23/1.41 # BW rewrite match successes : 38
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 43439
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.075 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.079 s
% 0.23/1.41 # Maximum resident set size: 5984 pages
%------------------------------------------------------------------------------