TSTP Solution File: KLE007+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE007+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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:49:29 EDT 2022
% Result : Theorem 7.90s 2.18s
% Output : CNFRefutation 7.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 13 unt; 0 nHn; 19 RR)
% Number of literals : 44 ( 22 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
( ~ leq(one,addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))))
| ~ leq(addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))),one) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2daw8ay/input.p',i_0_5) ).
cnf(i_0_16,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2daw8ay/input.p',i_0_16) ).
cnf(i_0_13,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2daw8ay/input.p',i_0_13) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2daw8ay/input.p',i_0_2) ).
cnf(i_0_20,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2daw8ay/input.p',i_0_20) ).
cnf(i_0_24,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2daw8ay/input.p',i_0_24) ).
cnf(i_0_12,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2daw8ay/input.p',i_0_12) ).
cnf(i_0_7,negated_conjecture,
test(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2daw8ay/input.p',i_0_7) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2daw8ay/input.p',i_0_3) ).
cnf(i_0_6,negated_conjecture,
test(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k2daw8ay/input.p',i_0_6) ).
cnf(c_0_35,negated_conjecture,
( ~ leq(one,addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))))
| ~ leq(addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))),one) ),
i_0_5 ).
cnf(c_0_36,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_16 ).
cnf(c_0_37,negated_conjecture,
( ~ leq(one,multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0))))
| ~ leq(multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0))),one) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_36]) ).
cnf(c_0_38,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_13 ).
cnf(c_0_39,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_40,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_20 ).
cnf(c_0_41,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
i_0_24 ).
cnf(c_0_42,plain,
( addition(one,multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0)))) != one
| ~ leq(one,multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0)))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_43,plain,
( addition(X1,X2) = one
| c(X2) != X1
| ~ test(X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( addition(one,multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0)))) != multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0)))
| addition(one,multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0)))) != one ),
inference(spm,[status(thm)],[c_0_42,c_0_38]) ).
cnf(c_0_45,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_43]),c_0_39]) ).
cnf(c_0_46,plain,
multiplication(X1,one) = X1,
i_0_12 ).
cnf(c_0_47,negated_conjecture,
test(esk2_0),
i_0_7 ).
cnf(c_0_48,plain,
( addition(one,addition(esk1_0,c(esk1_0))) != addition(esk1_0,c(esk1_0))
| addition(one,addition(esk1_0,c(esk1_0))) != one ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_46]),c_0_46]),c_0_47])]) ).
cnf(c_0_49,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_50,negated_conjecture,
test(esk1_0),
i_0_6 ).
cnf(c_0_51,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_45]),c_0_49]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.07 % Problem : KLE007+4 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.08 % Command : enigmatic-eprover.py %s %d 1
% 0.06/0.26 % Computer : n032.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 600
% 0.06/0.26 % DateTime : Thu Jun 16 13:05:01 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.10/0.32 # ENIGMATIC: Selected SinE mode:
% 0.10/0.33 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.33 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.10/0.33 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.10/0.33 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.90/2.18 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.90/2.18 # Version: 2.1pre011
% 7.90/2.18 # Preprocessing time : 0.022 s
% 7.90/2.18
% 7.90/2.18 # Proof found!
% 7.90/2.18 # SZS status Theorem
% 7.90/2.18 # SZS output start CNFRefutation
% See solution above
% 7.90/2.18 # Proof object total steps : 27
% 7.90/2.18 # Proof object clause steps : 17
% 7.90/2.18 # Proof object formula steps : 10
% 7.90/2.18 # Proof object conjectures : 7
% 7.90/2.18 # Proof object clause conjectures : 4
% 7.90/2.18 # Proof object formula conjectures : 3
% 7.90/2.18 # Proof object initial clauses used : 10
% 7.90/2.18 # Proof object initial formulas used : 10
% 7.90/2.18 # Proof object generating inferences : 6
% 7.90/2.18 # Proof object simplifying inferences : 12
% 7.90/2.18 # Training examples: 0 positive, 0 negative
% 7.90/2.18 # Parsed axioms : 27
% 7.90/2.18 # Removed by relevancy pruning/SinE : 0
% 7.90/2.18 # Initial clauses : 27
% 7.90/2.18 # Removed in clause preprocessing : 0
% 7.90/2.18 # Initial clauses in saturation : 27
% 7.90/2.18 # Processed clauses : 52
% 7.90/2.18 # ...of these trivial : 1
% 7.90/2.18 # ...subsumed : 1
% 7.90/2.18 # ...remaining for further processing : 50
% 7.90/2.18 # Other redundant clauses eliminated : 0
% 7.90/2.18 # Clauses deleted for lack of memory : 0
% 7.90/2.18 # Backward-subsumed : 0
% 7.90/2.18 # Backward-rewritten : 1
% 7.90/2.18 # Generated clauses : 174
% 7.90/2.18 # ...of the previous two non-trivial : 122
% 7.90/2.18 # Contextual simplify-reflections : 2
% 7.90/2.18 # Paramodulations : 171
% 7.90/2.18 # Factorizations : 0
% 7.90/2.18 # Equation resolutions : 3
% 7.90/2.18 # Propositional unsat checks : 0
% 7.90/2.18 # Propositional unsat check successes : 0
% 7.90/2.18 # Current number of processed clauses : 49
% 7.90/2.18 # Positive orientable unit clauses : 16
% 7.90/2.18 # Positive unorientable unit clauses: 1
% 7.90/2.18 # Negative unit clauses : 0
% 7.90/2.18 # Non-unit-clauses : 32
% 7.90/2.18 # Current number of unprocessed clauses: 96
% 7.90/2.18 # ...number of literals in the above : 240
% 7.90/2.18 # Current number of archived formulas : 0
% 7.90/2.18 # Current number of archived clauses : 1
% 7.90/2.18 # Clause-clause subsumption calls (NU) : 70
% 7.90/2.18 # Rec. Clause-clause subsumption calls : 61
% 7.90/2.18 # Non-unit clause-clause subsumptions : 3
% 7.90/2.18 # Unit Clause-clause subsumption calls : 15
% 7.90/2.18 # Rewrite failures with RHS unbound : 0
% 7.90/2.18 # BW rewrite match attempts : 18
% 7.90/2.18 # BW rewrite match successes : 11
% 7.90/2.18 # Condensation attempts : 0
% 7.90/2.18 # Condensation successes : 0
% 7.90/2.18 # Termbank termtop insertions : 2173
% 7.90/2.18
% 7.90/2.18 # -------------------------------------------------
% 7.90/2.18 # User time : 0.020 s
% 7.90/2.18 # System time : 0.004 s
% 7.90/2.18 # Total time : 0.024 s
% 7.90/2.18 # ...preprocessing : 0.022 s
% 7.90/2.18 # ...main loop : 0.002 s
% 7.90/2.18 # Maximum resident set size: 7124 pages
% 7.90/2.18
%------------------------------------------------------------------------------