TSTP Solution File: KLE048+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE048+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:51 EDT 2022
% Result : Theorem 7.72s 2.50s
% Output : CNFRefutation 7.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 19
% Syntax : Number of clauses : 62 ( 30 unt; 0 nHn; 39 RR)
% Number of literals : 102 ( 51 equ; 43 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 86 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_1) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_3) ).
cnf(i_0_23,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_23) ).
cnf(i_0_21,plain,
( complement(esk2_1(X1),X1)
| ~ test(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_21) ).
cnf(i_0_16,plain,
( leq(multiplication(star(X1),X2),X3)
| ~ leq(addition(multiplication(X1,X3),X2),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_16) ).
cnf(i_0_10,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_10) ).
cnf(i_0_6,negated_conjecture,
test(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_6) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_2) ).
cnf(i_0_20,plain,
( test(X1)
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_20) ).
cnf(i_0_22,plain,
( complement(X1,X2)
| addition(X2,X1) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_22) ).
cnf(i_0_13,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_13) ).
cnf(i_0_19,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_19) ).
cnf(i_0_8,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_8) ).
cnf(i_0_17,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_17) ).
cnf(i_0_14,plain,
multiplication(X1,zero) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_14) ).
cnf(i_0_7,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_7) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_4) ).
cnf(i_0_5,negated_conjecture,
star(esk1_0) != one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_5) ).
cnf(i_0_12,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nl17fqaw/input.p',i_0_12) ).
cnf(c_0_43,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_44,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_45,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_23 ).
cnf(c_0_46,plain,
( complement(esk2_1(X1),X1)
| ~ test(X1) ),
i_0_21 ).
cnf(c_0_47,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
( addition(X1,esk2_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
( leq(multiplication(star(X1),X2),X3)
| ~ leq(addition(multiplication(X1,X3),X2),X3) ),
i_0_16 ).
cnf(c_0_50,plain,
multiplication(one,X1) = X1,
i_0_10 ).
cnf(c_0_51,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
test(esk1_0),
i_0_6 ).
cnf(c_0_53,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_54,plain,
( test(X1)
| ~ complement(X2,X1) ),
i_0_20 ).
cnf(c_0_55,plain,
( complement(X1,X2)
| addition(X2,X1) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
i_0_22 ).
cnf(c_0_56,plain,
( leq(multiplication(star(one),X1),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
addition(one,esk1_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_58,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_13 ).
cnf(c_0_59,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
i_0_19 ).
cnf(c_0_60,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_8 ).
cnf(c_0_61,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
i_0_17 ).
cnf(c_0_62,plain,
( test(X1)
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X1,X2) != one ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_63,plain,
multiplication(X1,zero) = zero,
i_0_14 ).
cnf(c_0_64,plain,
multiplication(zero,X1) = zero,
i_0_7 ).
cnf(c_0_65,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_66,negated_conjecture,
( leq(multiplication(star(one),esk1_0),one)
| ~ leq(one,one) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_67,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_43]),c_0_53]) ).
cnf(c_0_68,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_50]),c_0_53]) ).
cnf(c_0_69,plain,
( leq(multiplication(X1,star(X2)),one)
| ~ leq(addition(X2,X1),one) ),
inference(spm,[status(thm)],[c_0_61,c_0_50]) ).
cnf(c_0_70,plain,
( test(X1)
| X1 != one ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_65])]) ).
cnf(c_0_71,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(X1,multiplication(X3,X2)),X3) ),
inference(spm,[status(thm)],[c_0_61,c_0_53]) ).
cnf(c_0_72,plain,
( addition(one,multiplication(star(one),esk1_0)) = one
| ~ leq(one,one) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_66]),c_0_53]) ).
cnf(c_0_73,plain,
addition(one,multiplication(addition(X1,one),star(X1))) = star(X1),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_74,plain,
( addition(one,multiplication(X1,star(X2))) = one
| ~ leq(addition(X2,X1),one) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_69]),c_0_53]) ).
cnf(c_0_75,plain,
( addition(X1,one) = one
| X1 != one ),
inference(spm,[status(thm)],[c_0_51,c_0_70]) ).
cnf(c_0_76,plain,
( leq(star(esk1_0),star(one))
| ~ leq(one,star(one))
| ~ leq(one,one) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_50]) ).
cnf(c_0_77,plain,
( star(X1) = one
| ~ leq(addition(X1,one),one) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_47]) ).
cnf(c_0_78,plain,
( addition(one,X1) = one
| X1 != one ),
inference(spm,[status(thm)],[c_0_53,c_0_75]) ).
cnf(c_0_79,plain,
( addition(star(one),star(esk1_0)) = star(one)
| ~ leq(one,star(one))
| ~ leq(one,one) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_76]),c_0_53]) ).
cnf(c_0_80,plain,
( star(one) = one
| ~ leq(one,one) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_47,c_0_67]) ).
cnf(c_0_82,negated_conjecture,
star(esk1_0) != one,
i_0_5 ).
cnf(c_0_83,plain,
~ leq(one,one),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82]) ).
cnf(c_0_84,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_12 ).
cnf(c_0_85,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KLE048+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n027.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 12:33:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.72/2.50 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 7.72/2.50 # Version: 2.1pre011
% 7.72/2.50 # Preprocessing time : 0.009 s
% 7.72/2.50
% 7.72/2.50 # Proof found!
% 7.72/2.50 # SZS status Theorem
% 7.72/2.50 # SZS output start CNFRefutation
% See solution above
% 7.72/2.50 # Proof object total steps : 62
% 7.72/2.50 # Proof object clause steps : 43
% 7.72/2.50 # Proof object formula steps : 19
% 7.72/2.50 # Proof object conjectures : 6
% 7.72/2.50 # Proof object clause conjectures : 4
% 7.72/2.50 # Proof object formula conjectures : 2
% 7.72/2.50 # Proof object initial clauses used : 19
% 7.72/2.50 # Proof object initial formulas used : 19
% 7.72/2.50 # Proof object generating inferences : 23
% 7.72/2.50 # Proof object simplifying inferences : 17
% 7.72/2.50 # Training examples: 0 positive, 0 negative
% 7.72/2.50 # Parsed axioms : 28
% 7.72/2.50 # Removed by relevancy pruning/SinE : 0
% 7.72/2.50 # Initial clauses : 28
% 7.72/2.50 # Removed in clause preprocessing : 0
% 7.72/2.50 # Initial clauses in saturation : 28
% 7.72/2.50 # Processed clauses : 365
% 7.72/2.50 # ...of these trivial : 28
% 7.72/2.50 # ...subsumed : 126
% 7.72/2.50 # ...remaining for further processing : 211
% 7.72/2.50 # Other redundant clauses eliminated : 1
% 7.72/2.50 # Clauses deleted for lack of memory : 0
% 7.72/2.50 # Backward-subsumed : 22
% 7.72/2.50 # Backward-rewritten : 23
% 7.72/2.50 # Generated clauses : 2835
% 7.72/2.50 # ...of the previous two non-trivial : 2202
% 7.72/2.50 # Contextual simplify-reflections : 15
% 7.72/2.50 # Paramodulations : 2832
% 7.72/2.50 # Factorizations : 0
% 7.72/2.50 # Equation resolutions : 3
% 7.72/2.50 # Propositional unsat checks : 0
% 7.72/2.50 # Propositional unsat check successes : 0
% 7.72/2.50 # Current number of processed clauses : 166
% 7.72/2.50 # Positive orientable unit clauses : 40
% 7.72/2.50 # Positive unorientable unit clauses: 3
% 7.72/2.50 # Negative unit clauses : 3
% 7.72/2.50 # Non-unit-clauses : 120
% 7.72/2.50 # Current number of unprocessed clauses: 1757
% 7.72/2.50 # ...number of literals in the above : 3820
% 7.72/2.50 # Current number of archived formulas : 0
% 7.72/2.50 # Current number of archived clauses : 45
% 7.72/2.50 # Clause-clause subsumption calls (NU) : 1283
% 7.72/2.50 # Rec. Clause-clause subsumption calls : 1192
% 7.72/2.50 # Non-unit clause-clause subsumptions : 153
% 7.72/2.50 # Unit Clause-clause subsumption calls : 186
% 7.72/2.50 # Rewrite failures with RHS unbound : 0
% 7.72/2.50 # BW rewrite match attempts : 89
% 7.72/2.50 # BW rewrite match successes : 48
% 7.72/2.50 # Condensation attempts : 0
% 7.72/2.50 # Condensation successes : 0
% 7.72/2.50 # Termbank termtop insertions : 32217
% 7.72/2.50
% 7.72/2.50 # -------------------------------------------------
% 7.72/2.50 # User time : 0.036 s
% 7.72/2.50 # System time : 0.002 s
% 7.72/2.50 # Total time : 0.038 s
% 7.72/2.50 # ...preprocessing : 0.009 s
% 7.72/2.50 # ...main loop : 0.029 s
% 7.72/2.50 # Maximum resident set size: 7136 pages
% 7.72/2.50
%------------------------------------------------------------------------------