TSTP Solution File: KLE128+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE128+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:27 EDT 2022
% Result : Theorem 8.76s 2.45s
% Output : CNFRefutation 8.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 23 unt; 0 nHn; 12 RR)
% Number of literals : 29 ( 28 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lyp6rp_6/input.p',i_0_16) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lyp6rp_6/input.p',i_0_2) ).
cnf(i_0_28,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lyp6rp_6/input.p',i_0_28) ).
cnf(i_0_14,plain,
multiplication(antidomain(X1),X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lyp6rp_6/input.p',i_0_14) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lyp6rp_6/input.p',i_0_4) ).
cnf(i_0_13,plain,
( addition(antidomain(antidomain(X1)),addition(divergence(X2),antidomain(antidomain(multiplication(star(X2),antidomain(antidomain(antidomain(antidomain(X3))))))))) = addition(divergence(X2),antidomain(antidomain(multiplication(star(X2),antidomain(antidomain(antidomain(antidomain(X3))))))))
| addition(antidomain(antidomain(X1)),addition(antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1))))))),antidomain(antidomain(X3)))) != addition(antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1))))))),antidomain(antidomain(X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lyp6rp_6/input.p',i_0_13) ).
cnf(i_0_31,plain,
multiplication(X1,zero) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lyp6rp_6/input.p',i_0_31) ).
cnf(i_0_22,negated_conjecture,
addition(antidomain(antidomain(esk2_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0)))))))) = antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0))))))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lyp6rp_6/input.p',i_0_22) ).
cnf(i_0_23,negated_conjecture,
divergence(esk1_0) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lyp6rp_6/input.p',i_0_23) ).
cnf(i_0_21,negated_conjecture,
antidomain(antidomain(esk2_0)) != zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lyp6rp_6/input.p',i_0_21) ).
cnf(c_0_42,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
i_0_16 ).
cnf(c_0_43,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_44,plain,
multiplication(X1,one) = X1,
i_0_28 ).
cnf(c_0_45,plain,
multiplication(antidomain(X1),X1) = zero,
i_0_14 ).
cnf(c_0_46,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_47,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_46,c_0_43]) ).
cnf(c_0_50,plain,
( addition(antidomain(antidomain(X1)),addition(divergence(X2),antidomain(antidomain(multiplication(star(X2),antidomain(antidomain(antidomain(antidomain(X3))))))))) = addition(divergence(X2),antidomain(antidomain(multiplication(star(X2),antidomain(antidomain(antidomain(antidomain(X3))))))))
| addition(antidomain(antidomain(X1)),addition(antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1))))))),antidomain(antidomain(X3)))) != addition(antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1))))))),antidomain(antidomain(X3))) ),
i_0_13 ).
cnf(c_0_51,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_52,plain,
multiplication(X1,zero) = zero,
i_0_31 ).
cnf(c_0_53,plain,
( addition(antidomain(antidomain(X1)),divergence(X2)) = divergence(X2)
| addition(antidomain(antidomain(X1)),antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1)))))))) != antidomain(antidomain(multiplication(X2,antidomain(antidomain(antidomain(antidomain(X1))))))) ),
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(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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_48]),c_0_51]),c_0_48]),c_0_52]),c_0_51]),c_0_48]),c_0_46]),c_0_48]),c_0_51]),c_0_48]),c_0_52]),c_0_51]),c_0_48]),c_0_46]),c_0_48]),c_0_46]),c_0_48]),c_0_46]) ).
cnf(c_0_54,negated_conjecture,
addition(antidomain(antidomain(esk2_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0)))))))) = antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0))))))),
i_0_22 ).
cnf(c_0_55,negated_conjecture,
divergence(esk1_0) = zero,
i_0_23 ).
cnf(c_0_56,negated_conjecture,
antidomain(antidomain(esk2_0)) != zero,
i_0_21 ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_46]),c_0_55]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KLE128+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 16 13:16:13 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.20/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.76/2.45 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.76/2.45 # Version: 2.1pre011
% 8.76/2.45 # Preprocessing time : 0.020 s
% 8.76/2.45
% 8.76/2.45 # Proof found!
% 8.76/2.45 # SZS status Theorem
% 8.76/2.45 # SZS output start CNFRefutation
% See solution above
% 8.76/2.45 # Proof object total steps : 26
% 8.76/2.45 # Proof object clause steps : 16
% 8.76/2.45 # Proof object formula steps : 10
% 8.76/2.45 # Proof object conjectures : 7
% 8.76/2.45 # Proof object clause conjectures : 4
% 8.76/2.45 # Proof object formula conjectures : 3
% 8.76/2.45 # Proof object initial clauses used : 10
% 8.76/2.45 # Proof object initial formulas used : 10
% 8.76/2.45 # Proof object generating inferences : 5
% 8.76/2.45 # Proof object simplifying inferences : 24
% 8.76/2.45 # Training examples: 0 positive, 0 negative
% 8.76/2.45 # Parsed axioms : 24
% 8.76/2.45 # Removed by relevancy pruning/SinE : 0
% 8.76/2.45 # Initial clauses : 24
% 8.76/2.45 # Removed in clause preprocessing : 0
% 8.76/2.45 # Initial clauses in saturation : 24
% 8.76/2.45 # Processed clauses : 40
% 8.76/2.45 # ...of these trivial : 3
% 8.76/2.45 # ...subsumed : 0
% 8.76/2.45 # ...remaining for further processing : 37
% 8.76/2.45 # Other redundant clauses eliminated : 0
% 8.76/2.45 # Clauses deleted for lack of memory : 0
% 8.76/2.45 # Backward-subsumed : 0
% 8.76/2.45 # Backward-rewritten : 2
% 8.76/2.45 # Generated clauses : 226
% 8.76/2.45 # ...of the previous two non-trivial : 157
% 8.76/2.45 # Contextual simplify-reflections : 0
% 8.76/2.45 # Paramodulations : 226
% 8.76/2.45 # Factorizations : 0
% 8.76/2.45 # Equation resolutions : 0
% 8.76/2.45 # Propositional unsat checks : 0
% 8.76/2.45 # Propositional unsat check successes : 0
% 8.76/2.45 # Current number of processed clauses : 35
% 8.76/2.45 # Positive orientable unit clauses : 29
% 8.76/2.45 # Positive unorientable unit clauses: 1
% 8.76/2.45 # Negative unit clauses : 1
% 8.76/2.45 # Non-unit-clauses : 4
% 8.76/2.45 # Current number of unprocessed clauses: 117
% 8.76/2.45 # ...number of literals in the above : 148
% 8.76/2.45 # Current number of archived formulas : 0
% 8.76/2.45 # Current number of archived clauses : 2
% 8.76/2.45 # Clause-clause subsumption calls (NU) : 1
% 8.76/2.45 # Rec. Clause-clause subsumption calls : 1
% 8.76/2.45 # Non-unit clause-clause subsumptions : 0
% 8.76/2.45 # Unit Clause-clause subsumption calls : 3
% 8.76/2.45 # Rewrite failures with RHS unbound : 0
% 8.76/2.45 # BW rewrite match attempts : 31
% 8.76/2.45 # BW rewrite match successes : 9
% 8.76/2.45 # Condensation attempts : 0
% 8.76/2.45 # Condensation successes : 0
% 8.76/2.45 # Termbank termtop insertions : 4324
% 8.76/2.45
% 8.76/2.45 # -------------------------------------------------
% 8.76/2.45 # User time : 0.018 s
% 8.76/2.45 # System time : 0.006 s
% 8.76/2.45 # Total time : 0.024 s
% 8.76/2.45 # ...preprocessing : 0.020 s
% 8.76/2.45 # ...main loop : 0.004 s
% 8.76/2.45 # Maximum resident set size: 7136 pages
% 8.76/2.45
%------------------------------------------------------------------------------