TSTP Solution File: KLE148+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE148+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:50:35 EDT 2022
% Result : Theorem 4.41s 2.13s
% Output : CNFRefutation 4.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 5 RR)
% Number of literals : 22 ( 21 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-viuvo_s3/input.p',i_0_13) ).
cnf(i_0_7,negated_conjecture,
multiplication(esk1_0,esk2_0) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-viuvo_s3/input.p',i_0_7) ).
cnf(i_0_12,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-viuvo_s3/input.p',i_0_12) ).
cnf(i_0_4,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-viuvo_s3/input.p',i_0_4) ).
cnf(i_0_3,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-viuvo_s3/input.p',i_0_3) ).
cnf(i_0_10,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-viuvo_s3/input.p',i_0_10) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-viuvo_s3/input.p',i_0_2) ).
cnf(i_0_15,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-viuvo_s3/input.p',i_0_15) ).
cnf(i_0_6,negated_conjecture,
multiplication(esk1_0,strong_iteration(esk2_0)) != esk1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-viuvo_s3/input.p',i_0_6) ).
cnf(c_0_25,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_13 ).
cnf(c_0_26,negated_conjecture,
multiplication(esk1_0,esk2_0) = zero,
i_0_7 ).
cnf(c_0_27,plain,
multiplication(zero,X1) = zero,
i_0_12 ).
cnf(c_0_28,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_4 ).
cnf(c_0_29,negated_conjecture,
multiplication(esk1_0,multiplication(esk2_0,X1)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,plain,
addition(X1,zero) = X1,
i_0_3 ).
cnf(c_0_31,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
i_0_10 ).
cnf(c_0_32,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_33,plain,
multiplication(esk1_0,addition(X1,multiplication(esk2_0,X2))) = multiplication(esk1_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_34,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
multiplication(X1,one) = X1,
i_0_15 ).
cnf(c_0_36,negated_conjecture,
multiplication(esk1_0,strong_iteration(esk2_0)) != esk1_0,
i_0_6 ).
cnf(c_0_37,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE148+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 16:26:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.41/2.13 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 4.41/2.13 # Version: 2.1pre011
% 4.41/2.13 # Preprocessing time : 0.009 s
% 4.41/2.13
% 4.41/2.13 # Proof found!
% 4.41/2.13 # SZS status Theorem
% 4.41/2.13 # SZS output start CNFRefutation
% See solution above
% 4.41/2.13 # Proof object total steps : 22
% 4.41/2.13 # Proof object clause steps : 13
% 4.41/2.13 # Proof object formula steps : 9
% 4.41/2.13 # Proof object conjectures : 5
% 4.41/2.13 # Proof object clause conjectures : 3
% 4.41/2.13 # Proof object formula conjectures : 2
% 4.41/2.13 # Proof object initial clauses used : 9
% 4.41/2.13 # Proof object initial formulas used : 9
% 4.41/2.13 # Proof object generating inferences : 3
% 4.41/2.13 # Proof object simplifying inferences : 5
% 4.41/2.13 # Training examples: 0 positive, 0 negative
% 4.41/2.13 # Parsed axioms : 21
% 4.41/2.13 # Removed by relevancy pruning/SinE : 0
% 4.41/2.13 # Initial clauses : 21
% 4.41/2.13 # Removed in clause preprocessing : 0
% 4.41/2.13 # Initial clauses in saturation : 21
% 4.41/2.13 # Processed clauses : 62
% 4.41/2.13 # ...of these trivial : 5
% 4.41/2.13 # ...subsumed : 2
% 4.41/2.13 # ...remaining for further processing : 55
% 4.41/2.13 # Other redundant clauses eliminated : 0
% 4.41/2.13 # Clauses deleted for lack of memory : 0
% 4.41/2.13 # Backward-subsumed : 0
% 4.41/2.13 # Backward-rewritten : 6
% 4.41/2.13 # Generated clauses : 482
% 4.41/2.13 # ...of the previous two non-trivial : 359
% 4.41/2.13 # Contextual simplify-reflections : 0
% 4.41/2.13 # Paramodulations : 482
% 4.41/2.13 # Factorizations : 0
% 4.41/2.13 # Equation resolutions : 0
% 4.41/2.13 # Propositional unsat checks : 0
% 4.41/2.13 # Propositional unsat check successes : 0
% 4.41/2.13 # Current number of processed clauses : 49
% 4.41/2.13 # Positive orientable unit clauses : 35
% 4.41/2.13 # Positive unorientable unit clauses: 2
% 4.41/2.13 # Negative unit clauses : 1
% 4.41/2.13 # Non-unit-clauses : 11
% 4.41/2.13 # Current number of unprocessed clauses: 272
% 4.41/2.13 # ...number of literals in the above : 367
% 4.41/2.13 # Current number of archived formulas : 0
% 4.41/2.13 # Current number of archived clauses : 6
% 4.41/2.13 # Clause-clause subsumption calls (NU) : 15
% 4.41/2.13 # Rec. Clause-clause subsumption calls : 15
% 4.41/2.13 # Non-unit clause-clause subsumptions : 1
% 4.41/2.13 # Unit Clause-clause subsumption calls : 3
% 4.41/2.13 # Rewrite failures with RHS unbound : 0
% 4.41/2.13 # BW rewrite match attempts : 23
% 4.41/2.13 # BW rewrite match successes : 18
% 4.41/2.13 # Condensation attempts : 0
% 4.41/2.13 # Condensation successes : 0
% 4.41/2.13 # Termbank termtop insertions : 5183
% 4.41/2.13
% 4.41/2.13 # -------------------------------------------------
% 4.41/2.13 # User time : 0.012 s
% 4.41/2.13 # System time : 0.001 s
% 4.41/2.13 # Total time : 0.013 s
% 4.41/2.13 # ...preprocessing : 0.009 s
% 4.41/2.13 # ...main loop : 0.004 s
% 4.41/2.13 # Maximum resident set size: 7136 pages
% 4.41/2.13
%------------------------------------------------------------------------------