TSTP Solution File: KLE035+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE035+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:31 EDT 2022
% Result : Theorem 0.19s 1.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 28 unt; 0 def)
% Number of atoms : 53 ( 26 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 27 ( 9 ~; 4 |; 11 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 57 ( 2 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6,X7] :
( ( test(X7)
& test(X6)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& leq(multiplication(multiplication(X6,X5),c(X7)),zero) )
=> leq(multiplication(multiplication(X6,addition(X4,X5)),c(X7)),zero) ),
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/KLE001+0.ax',multiplicative_associativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
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(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
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(c_0_7,negated_conjecture,
~ ! [X4,X5,X6,X7] :
( ( test(X7)
& test(X6)
& leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& leq(multiplication(multiplication(X6,X5),c(X7)),zero) )
=> leq(multiplication(multiplication(X6,addition(X4,X5)),c(X7)),zero) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_8,negated_conjecture,
( test(esk4_0)
& test(esk3_0)
& leq(multiplication(multiplication(esk3_0,esk1_0),c(esk4_0)),zero)
& leq(multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)),zero)
& ~ leq(multiplication(multiplication(esk3_0,addition(esk1_0,esk2_0)),c(esk4_0)),zero) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
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,plain,
! [X3,X4,X3,X4] :
( ( ~ leq(X3,X4)
| addition(X3,X4) = X4 )
& ( addition(X3,X4) != X4
| leq(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])])]) ).
cnf(c_0_11,negated_conjecture,
leq(multiplication(multiplication(esk3_0,esk1_0),c(esk4_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_14,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_15,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_16,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
leq(multiplication(esk3_0,multiplication(esk1_0,c(esk4_0))),zero),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
~ leq(multiplication(multiplication(esk3_0,addition(esk1_0,esk2_0)),c(esk4_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
multiplication(esk3_0,multiplication(esk1_0,c(esk4_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_23,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_24,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_25,negated_conjecture,
leq(multiplication(multiplication(esk3_0,esk2_0),c(esk4_0)),zero),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
~ leq(multiplication(esk3_0,multiplication(addition(esk1_0,esk2_0),c(esk4_0))),zero),
inference(rw,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_27,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,negated_conjecture,
multiplication(esk3_0,addition(multiplication(esk1_0,c(esk4_0)),X1)) = multiplication(esk3_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_29,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
leq(multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))),zero),
inference(rw,[status(thm)],[c_0_25,c_0_12]) ).
cnf(c_0_31,negated_conjecture,
multiplication(esk3_0,multiplication(addition(esk1_0,esk2_0),c(esk4_0))) != zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_18]) ).
cnf(c_0_32,negated_conjecture,
multiplication(esk3_0,multiplication(addition(esk1_0,X1),c(esk4_0))) = multiplication(esk3_0,multiplication(X1,c(esk4_0))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_30]),c_0_18]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : KLE035+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.11 % Command : run_ET %s %d
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Thu Jun 16 10:33:59 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.19/1.38 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.19/1.38 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.19/1.38 # Preprocessing time : 0.011 s
% 0.19/1.38
% 0.19/1.38 # Proof found!
% 0.19/1.38 # SZS status Theorem
% 0.19/1.38 # SZS output start CNFRefutation
% See solution above
% 0.19/1.38 # Proof object total steps : 35
% 0.19/1.38 # Proof object clause steps : 20
% 0.19/1.38 # Proof object formula steps : 15
% 0.19/1.38 # Proof object conjectures : 15
% 0.19/1.38 # Proof object clause conjectures : 12
% 0.19/1.38 # Proof object formula conjectures : 3
% 0.19/1.38 # Proof object initial clauses used : 10
% 0.19/1.38 # Proof object initial formulas used : 7
% 0.19/1.38 # Proof object generating inferences : 6
% 0.19/1.38 # Proof object simplifying inferences : 10
% 0.19/1.38 # Training examples: 0 positive, 0 negative
% 0.19/1.38 # Parsed axioms : 19
% 0.19/1.38 # Removed by relevancy pruning/SinE : 5
% 0.19/1.38 # Initial clauses : 19
% 0.19/1.38 # Removed in clause preprocessing : 0
% 0.19/1.38 # Initial clauses in saturation : 19
% 0.19/1.38 # Processed clauses : 108
% 0.19/1.38 # ...of these trivial : 13
% 0.19/1.38 # ...subsumed : 16
% 0.19/1.38 # ...remaining for further processing : 79
% 0.19/1.38 # Other redundant clauses eliminated : 0
% 0.19/1.38 # Clauses deleted for lack of memory : 0
% 0.19/1.38 # Backward-subsumed : 0
% 0.19/1.38 # Backward-rewritten : 13
% 0.19/1.38 # Generated clauses : 641
% 0.19/1.38 # ...of the previous two non-trivial : 447
% 0.19/1.38 # Contextual simplify-reflections : 0
% 0.19/1.38 # Paramodulations : 641
% 0.19/1.38 # Factorizations : 0
% 0.19/1.38 # Equation resolutions : 0
% 0.19/1.38 # Current number of processed clauses : 66
% 0.19/1.38 # Positive orientable unit clauses : 52
% 0.19/1.38 # Positive unorientable unit clauses: 3
% 0.19/1.38 # Negative unit clauses : 0
% 0.19/1.38 # Non-unit-clauses : 11
% 0.19/1.38 # Current number of unprocessed clauses: 329
% 0.19/1.38 # ...number of literals in the above : 341
% 0.19/1.38 # Current number of archived formulas : 0
% 0.19/1.38 # Current number of archived clauses : 13
% 0.19/1.38 # Clause-clause subsumption calls (NU) : 10
% 0.19/1.38 # Rec. Clause-clause subsumption calls : 10
% 0.19/1.38 # Non-unit clause-clause subsumptions : 0
% 0.19/1.38 # Unit Clause-clause subsumption calls : 4
% 0.19/1.38 # Rewrite failures with RHS unbound : 0
% 0.19/1.38 # BW rewrite match attempts : 78
% 0.19/1.38 # BW rewrite match successes : 31
% 0.19/1.38 # Condensation attempts : 0
% 0.19/1.38 # Condensation successes : 0
% 0.19/1.38 # Termbank termtop insertions : 9904
% 0.19/1.38
% 0.19/1.38 # -------------------------------------------------
% 0.19/1.38 # User time : 0.019 s
% 0.19/1.38 # System time : 0.001 s
% 0.19/1.38 # Total time : 0.020 s
% 0.19/1.38 # Maximum resident set size: 3348 pages
%------------------------------------------------------------------------------