TSTP Solution File: KLE022+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE022+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:38 EDT 2022
% Result : Theorem 7.21s 2.16s
% Output : CNFRefutation 7.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 12 unt; 0 nHn; 12 RR)
% Number of literals : 26 ( 14 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mr67lclx/input.p',i_0_23) ).
cnf(i_0_5,negated_conjecture,
addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))) != esk1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mr67lclx/input.p',i_0_5) ).
cnf(i_0_15,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mr67lclx/input.p',i_0_15) ).
cnf(i_0_19,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mr67lclx/input.p',i_0_19) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mr67lclx/input.p',i_0_2) ).
cnf(i_0_11,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mr67lclx/input.p',i_0_11) ).
cnf(i_0_6,negated_conjecture,
test(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mr67lclx/input.p',i_0_6) ).
cnf(c_0_31,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
i_0_23 ).
cnf(c_0_32,negated_conjecture,
addition(multiplication(esk1_0,esk2_0),multiplication(esk1_0,c(esk2_0))) != esk1_0,
i_0_5 ).
cnf(c_0_33,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_15 ).
cnf(c_0_34,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_19 ).
cnf(c_0_35,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_37,negated_conjecture,
multiplication(esk1_0,addition(esk2_0,c(esk2_0))) != esk1_0,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_39,plain,
multiplication(X1,one) = X1,
i_0_11 ).
cnf(c_0_40,negated_conjecture,
test(esk2_0),
i_0_6 ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : KLE022+1 : TPTP v8.1.0. Released v4.0.0.
% 0.02/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Thu Jun 16 16:17:01 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.14/0.35 # ENIGMATIC: Selected SinE mode:
% 0.14/0.36 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.36 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.14/0.36 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.14/0.36 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.21/2.16 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.21/2.16 # Version: 2.1pre011
% 7.21/2.16 # Preprocessing time : 0.010 s
% 7.21/2.16
% 7.21/2.16 # Proof found!
% 7.21/2.16 # SZS status Theorem
% 7.21/2.16 # SZS output start CNFRefutation
% See solution above
% 7.21/2.16 # Proof object total steps : 18
% 7.21/2.16 # Proof object clause steps : 11
% 7.21/2.16 # Proof object formula steps : 7
% 7.21/2.16 # Proof object conjectures : 6
% 7.21/2.16 # Proof object clause conjectures : 4
% 7.21/2.16 # Proof object formula conjectures : 2
% 7.21/2.16 # Proof object initial clauses used : 7
% 7.21/2.16 # Proof object initial formulas used : 7
% 7.21/2.16 # Proof object generating inferences : 3
% 7.21/2.16 # Proof object simplifying inferences : 5
% 7.21/2.16 # Training examples: 0 positive, 0 negative
% 7.21/2.16 # Parsed axioms : 24
% 7.21/2.16 # Removed by relevancy pruning/SinE : 0
% 7.21/2.16 # Initial clauses : 24
% 7.21/2.16 # Removed in clause preprocessing : 0
% 7.21/2.16 # Initial clauses in saturation : 24
% 7.21/2.16 # Processed clauses : 144
% 7.21/2.16 # ...of these trivial : 17
% 7.21/2.16 # ...subsumed : 37
% 7.21/2.16 # ...remaining for further processing : 90
% 7.21/2.16 # Other redundant clauses eliminated : 2
% 7.21/2.16 # Clauses deleted for lack of memory : 0
% 7.21/2.16 # Backward-subsumed : 2
% 7.21/2.16 # Backward-rewritten : 9
% 7.21/2.16 # Generated clauses : 950
% 7.21/2.16 # ...of the previous two non-trivial : 619
% 7.21/2.16 # Contextual simplify-reflections : 13
% 7.21/2.16 # Paramodulations : 945
% 7.21/2.16 # Factorizations : 0
% 7.21/2.16 # Equation resolutions : 5
% 7.21/2.16 # Propositional unsat checks : 0
% 7.21/2.16 # Propositional unsat check successes : 0
% 7.21/2.16 # Current number of processed clauses : 79
% 7.21/2.16 # Positive orientable unit clauses : 32
% 7.21/2.16 # Positive unorientable unit clauses: 3
% 7.21/2.16 # Negative unit clauses : 2
% 7.21/2.16 # Non-unit-clauses : 42
% 7.21/2.16 # Current number of unprocessed clauses: 488
% 7.21/2.16 # ...number of literals in the above : 1020
% 7.21/2.16 # Current number of archived formulas : 0
% 7.21/2.16 # Current number of archived clauses : 11
% 7.21/2.16 # Clause-clause subsumption calls (NU) : 197
% 7.21/2.16 # Rec. Clause-clause subsumption calls : 153
% 7.21/2.16 # Non-unit clause-clause subsumptions : 25
% 7.21/2.16 # Unit Clause-clause subsumption calls : 19
% 7.21/2.16 # Rewrite failures with RHS unbound : 0
% 7.21/2.16 # BW rewrite match attempts : 55
% 7.21/2.16 # BW rewrite match successes : 43
% 7.21/2.16 # Condensation attempts : 0
% 7.21/2.16 # Condensation successes : 0
% 7.21/2.16 # Termbank termtop insertions : 9040
% 7.21/2.16
% 7.21/2.16 # -------------------------------------------------
% 7.21/2.16 # User time : 0.015 s
% 7.21/2.16 # System time : 0.003 s
% 7.21/2.16 # Total time : 0.018 s
% 7.21/2.16 # ...preprocessing : 0.010 s
% 7.21/2.16 # ...main loop : 0.008 s
% 7.21/2.16 # Maximum resident set size: 7136 pages
% 7.21/2.16
%------------------------------------------------------------------------------