TSTP Solution File: KLE150+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE150+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:36 EDT 2022
% Result : Theorem 7.88s 2.53s
% Output : CNFRefutation 7.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 3 RR)
% Number of literals : 14 ( 13 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c0ywnhap/input.p',i_0_9) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c0ywnhap/input.p',i_0_2) ).
cnf(i_0_12,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c0ywnhap/input.p',i_0_12) ).
cnf(i_0_11,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c0ywnhap/input.p',i_0_11) ).
cnf(i_0_6,negated_conjecture,
addition(one,multiplication(esk1_0,zero)) != strong_iteration(multiplication(esk1_0,zero)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-c0ywnhap/input.p',i_0_6) ).
cnf(c_0_18,plain,
addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
i_0_9 ).
cnf(c_0_19,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_20,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
i_0_12 ).
cnf(c_0_22,plain,
addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2))))) = strong_iteration(multiplication(X1,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
multiplication(zero,X1) = zero,
i_0_11 ).
cnf(c_0_24,negated_conjecture,
addition(one,multiplication(esk1_0,zero)) != strong_iteration(multiplication(esk1_0,zero)),
i_0_6 ).
cnf(c_0_25,plain,
strong_iteration(multiplication(X1,zero)) = addition(one,multiplication(X1,zero)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : KLE150+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.16/0.36 % Computer : n023.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 600
% 0.16/0.36 % DateTime : Thu Jun 16 07:39:06 EDT 2022
% 0.16/0.36 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected SinE mode:
% 0.22/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.88/2.53 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.88/2.53 # Version: 2.1pre011
% 7.88/2.53 # Preprocessing time : 0.017 s
% 7.88/2.53
% 7.88/2.53 # Proof found!
% 7.88/2.53 # SZS status Theorem
% 7.88/2.53 # SZS output start CNFRefutation
% See solution above
% 7.88/2.53 # Proof object total steps : 14
% 7.88/2.53 # Proof object clause steps : 9
% 7.88/2.53 # Proof object formula steps : 5
% 7.88/2.53 # Proof object conjectures : 3
% 7.88/2.53 # Proof object clause conjectures : 2
% 7.88/2.53 # Proof object formula conjectures : 1
% 7.88/2.53 # Proof object initial clauses used : 5
% 7.88/2.53 # Proof object initial formulas used : 5
% 7.88/2.53 # Proof object generating inferences : 2
% 7.88/2.53 # Proof object simplifying inferences : 3
% 7.88/2.53 # Training examples: 0 positive, 0 negative
% 7.88/2.53 # Parsed axioms : 20
% 7.88/2.53 # Removed by relevancy pruning/SinE : 0
% 7.88/2.53 # Initial clauses : 20
% 7.88/2.53 # Removed in clause preprocessing : 0
% 7.88/2.53 # Initial clauses in saturation : 20
% 7.88/2.53 # Processed clauses : 73
% 7.88/2.53 # ...of these trivial : 9
% 7.88/2.53 # ...subsumed : 2
% 7.88/2.53 # ...remaining for further processing : 62
% 7.88/2.53 # Other redundant clauses eliminated : 0
% 7.88/2.53 # Clauses deleted for lack of memory : 0
% 7.88/2.53 # Backward-subsumed : 0
% 7.88/2.53 # Backward-rewritten : 17
% 7.88/2.53 # Generated clauses : 396
% 7.88/2.53 # ...of the previous two non-trivial : 260
% 7.88/2.53 # Contextual simplify-reflections : 0
% 7.88/2.53 # Paramodulations : 396
% 7.88/2.53 # Factorizations : 0
% 7.88/2.53 # Equation resolutions : 0
% 7.88/2.53 # Propositional unsat checks : 0
% 7.88/2.53 # Propositional unsat check successes : 0
% 7.88/2.53 # Current number of processed clauses : 45
% 7.88/2.53 # Positive orientable unit clauses : 31
% 7.88/2.53 # Positive unorientable unit clauses: 1
% 7.88/2.53 # Negative unit clauses : 0
% 7.88/2.53 # Non-unit-clauses : 13
% 7.88/2.53 # Current number of unprocessed clauses: 172
% 7.88/2.53 # ...number of literals in the above : 282
% 7.88/2.53 # Current number of archived formulas : 0
% 7.88/2.53 # Current number of archived clauses : 17
% 7.88/2.53 # Clause-clause subsumption calls (NU) : 26
% 7.88/2.53 # Rec. Clause-clause subsumption calls : 26
% 7.88/2.53 # Non-unit clause-clause subsumptions : 1
% 7.88/2.53 # Unit Clause-clause subsumption calls : 6
% 7.88/2.53 # Rewrite failures with RHS unbound : 0
% 7.88/2.53 # BW rewrite match attempts : 27
% 7.88/2.53 # BW rewrite match successes : 16
% 7.88/2.53 # Condensation attempts : 0
% 7.88/2.53 # Condensation successes : 0
% 7.88/2.53 # Termbank termtop insertions : 4280
% 7.88/2.53
% 7.88/2.53 # -------------------------------------------------
% 7.88/2.53 # User time : 0.019 s
% 7.88/2.53 # System time : 0.004 s
% 7.88/2.53 # Total time : 0.024 s
% 7.88/2.53 # ...preprocessing : 0.017 s
% 7.88/2.53 # ...main loop : 0.007 s
% 7.88/2.53 # Maximum resident set size: 7128 pages
% 7.88/2.53
%------------------------------------------------------------------------------