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