TSTP Solution File: KLE040+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE040+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:48 EDT 2022
% Result : Theorem 8.05s 2.46s
% Output : CNFRefutation 8.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 55 ( 43 unt; 0 nHn; 16 RR)
% Number of literals : 67 ( 48 equ; 15 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_3) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_1) ).
cnf(i_0_12,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_12) ).
cnf(i_0_18,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_18) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_2) ).
cnf(i_0_7,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_7) ).
cnf(i_0_9,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_9) ).
cnf(i_0_16,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_16) ).
cnf(i_0_11,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_11) ).
cnf(i_0_8,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_8) ).
cnf(i_0_14,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_14) ).
cnf(i_0_10,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_10) ).
cnf(i_0_17,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_17) ).
cnf(i_0_5,negated_conjecture,
multiplication(star(esk1_0),star(esk1_0)) != star(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1wcheea8/input.p',i_0_5) ).
cnf(c_0_33,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_34,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_35,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
i_0_12 ).
cnf(c_0_36,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
i_0_18 ).
cnf(c_0_37,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_38,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_7 ).
cnf(c_0_39,plain,
multiplication(one,X1) = X1,
i_0_9 ).
cnf(c_0_40,plain,
addition(X1,addition(X2,addition(X1,X2))) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_34,c_0_33]) ).
cnf(c_0_42,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_35,c_0_36]),c_0_34]),c_0_37]) ).
cnf(c_0_43,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_37]) ).
cnf(c_0_44,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
i_0_16 ).
cnf(c_0_45,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
i_0_11 ).
cnf(c_0_46,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_37]),c_0_41]) ).
cnf(c_0_47,plain,
addition(one,multiplication(addition(X1,one),star(X1))) = star(X1),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_8 ).
cnf(c_0_49,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_14 ).
cnf(c_0_50,plain,
multiplication(X1,one) = X1,
i_0_10 ).
cnf(c_0_51,plain,
( leq(multiplication(X1,star(X2)),X3)
| addition(multiplication(X3,X2),addition(X1,X3)) != X3 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_34]) ).
cnf(c_0_52,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_37,c_0_34]) ).
cnf(c_0_53,plain,
multiplication(addition(X1,one),star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_37]),c_0_43]),c_0_34]),c_0_33]) ).
cnf(c_0_54,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
i_0_17 ).
cnf(c_0_55,plain,
( leq(multiplication(X1,multiplication(X2,star(X2))),X1)
| ~ leq(multiplication(X1,X2),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_33]),c_0_48]) ).
cnf(c_0_56,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_37]) ).
cnf(c_0_57,plain,
( leq(multiplication(X1,star(X2)),X3)
| addition(X3,addition(multiplication(X3,X2),X1)) != X3 ),
inference(rw,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,plain,
addition(multiplication(X1,X2),addition(multiplication(X1,X3),X4)) = addition(multiplication(X1,addition(X2,X3)),X4),
inference(spm,[status(thm)],[c_0_34,c_0_49]) ).
cnf(c_0_59,plain,
multiplication(addition(one,X1),star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_53,c_0_37]) ).
cnf(c_0_60,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_61,plain,
addition(one,addition(star(X1),multiplication(star(X1),X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_54]),c_0_34]),c_0_37]) ).
cnf(c_0_62,plain,
( multiplication(X1,addition(one,multiplication(X2,star(X2)))) = X1
| ~ leq(multiplication(X1,X2),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_55]),c_0_37]),c_0_56]),c_0_37]) ).
cnf(c_0_63,plain,
( leq(multiplication(X1,star(X2)),multiplication(X3,X4))
| addition(multiplication(X3,multiplication(X4,addition(X2,one))),X1) != multiplication(X3,X4) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_48]),c_0_58]),c_0_56]) ).
cnf(c_0_64,plain,
multiplication(star(X1),star(star(X1))) = star(star(X1)),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,plain,
addition(one,multiplication(star(X1),addition(X1,one))) = star(X1),
inference(rw,[status(thm)],[c_0_61,c_0_56]) ).
cnf(c_0_66,plain,
( multiplication(X1,multiplication(X2,star(star(X3)))) = multiplication(X1,X2)
| multiplication(X1,multiplication(X2,addition(X3,one))) != multiplication(X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_60]),c_0_48]),c_0_49]),c_0_37]),c_0_56]),c_0_34]),c_0_33]) ).
cnf(c_0_67,plain,
multiplication(star(X1),addition(X1,one)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_65]),c_0_37]),c_0_56]),c_0_34]),c_0_33]) ).
cnf(c_0_68,plain,
multiplication(X1,star(star(X2))) = multiplication(X1,star(X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_64]),c_0_67])]) ).
cnf(c_0_69,negated_conjecture,
multiplication(star(esk1_0),star(esk1_0)) != star(esk1_0),
i_0_5 ).
cnf(c_0_70,plain,
multiplication(star(X1),star(X1)) = star(star(X1)),
inference(rw,[status(thm)],[c_0_64,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
star(star(esk1_0)) != star(esk1_0),
inference(rw,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_72,plain,
star(star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_68]),c_0_39]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : KLE040+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 16:24:00 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected SinE mode:
% 0.20/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.05/2.46 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.05/2.46 # Version: 2.1pre011
% 8.05/2.46 # Preprocessing time : 0.016 s
% 8.05/2.46
% 8.05/2.46 # Proof found!
% 8.05/2.46 # SZS status Theorem
% 8.05/2.46 # SZS output start CNFRefutation
% See solution above
% 8.05/2.46 # Proof object total steps : 55
% 8.05/2.46 # Proof object clause steps : 41
% 8.05/2.46 # Proof object formula steps : 14
% 8.05/2.46 # Proof object conjectures : 4
% 8.05/2.46 # Proof object clause conjectures : 3
% 8.05/2.46 # Proof object formula conjectures : 1
% 8.05/2.46 # Proof object initial clauses used : 14
% 8.05/2.46 # Proof object initial formulas used : 14
% 8.05/2.46 # Proof object generating inferences : 21
% 8.05/2.46 # Proof object simplifying inferences : 40
% 8.05/2.46 # Training examples: 0 positive, 0 negative
% 8.05/2.46 # Parsed axioms : 18
% 8.05/2.46 # Removed by relevancy pruning/SinE : 0
% 8.05/2.46 # Initial clauses : 18
% 8.05/2.46 # Removed in clause preprocessing : 0
% 8.05/2.46 # Initial clauses in saturation : 18
% 8.05/2.46 # Processed clauses : 397
% 8.05/2.46 # ...of these trivial : 46
% 8.05/2.46 # ...subsumed : 168
% 8.05/2.46 # ...remaining for further processing : 183
% 8.05/2.46 # Other redundant clauses eliminated : 0
% 8.05/2.46 # Clauses deleted for lack of memory : 0
% 8.05/2.46 # Backward-subsumed : 1
% 8.05/2.46 # Backward-rewritten : 61
% 8.05/2.46 # Generated clauses : 4909
% 8.05/2.46 # ...of the previous two non-trivial : 3646
% 8.05/2.46 # Contextual simplify-reflections : 2
% 8.05/2.46 # Paramodulations : 4909
% 8.05/2.46 # Factorizations : 0
% 8.05/2.46 # Equation resolutions : 0
% 8.05/2.46 # Propositional unsat checks : 0
% 8.05/2.46 # Propositional unsat check successes : 0
% 8.05/2.46 # Current number of processed clauses : 121
% 8.05/2.46 # Positive orientable unit clauses : 40
% 8.05/2.46 # Positive unorientable unit clauses: 4
% 8.05/2.46 # Negative unit clauses : 3
% 8.05/2.46 # Non-unit-clauses : 74
% 8.05/2.46 # Current number of unprocessed clauses: 1935
% 8.05/2.46 # ...number of literals in the above : 3397
% 8.05/2.46 # Current number of archived formulas : 0
% 8.05/2.46 # Current number of archived clauses : 62
% 8.05/2.46 # Clause-clause subsumption calls (NU) : 800
% 8.05/2.46 # Rec. Clause-clause subsumption calls : 797
% 8.05/2.46 # Non-unit clause-clause subsumptions : 95
% 8.05/2.46 # Unit Clause-clause subsumption calls : 99
% 8.05/2.46 # Rewrite failures with RHS unbound : 0
% 8.05/2.46 # BW rewrite match attempts : 221
% 8.05/2.46 # BW rewrite match successes : 79
% 8.05/2.46 # Condensation attempts : 0
% 8.05/2.46 # Condensation successes : 0
% 8.05/2.46 # Termbank termtop insertions : 61672
% 8.05/2.46
% 8.05/2.46 # -------------------------------------------------
% 8.05/2.46 # User time : 0.079 s
% 8.05/2.46 # System time : 0.005 s
% 8.05/2.46 # Total time : 0.084 s
% 8.05/2.46 # ...preprocessing : 0.016 s
% 8.05/2.46 # ...main loop : 0.068 s
% 8.05/2.46 # Maximum resident set size: 7128 pages
% 8.05/2.46
%------------------------------------------------------------------------------