TSTP Solution File: KLE100+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE100+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:07 EDT 2022
% Result : Theorem 9.40s 2.58s
% Output : CNFRefutation 9.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 47 unt; 0 nHn; 14 RR)
% Number of literals : 47 ( 46 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 54 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9t947rt/input.p',i_0_14) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9t947rt/input.p',i_0_2) ).
cnf(i_0_25,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9t947rt/input.p',i_0_25) ).
cnf(i_0_12,plain,
multiplication(antidomain(X1),X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9t947rt/input.p',i_0_12) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9t947rt/input.p',i_0_4) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9t947rt/input.p',i_0_1) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9t947rt/input.p',i_0_3) ).
cnf(i_0_13,plain,
addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2))))) = antidomain(multiplication(X1,antidomain(antidomain(X2)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9t947rt/input.p',i_0_13) ).
cnf(i_0_20,negated_conjecture,
multiplication(antidomain(esk3_0),multiplication(esk1_0,antidomain(antidomain(esk2_0)))) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9t947rt/input.p',i_0_20) ).
cnf(i_0_22,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9t947rt/input.p',i_0_22) ).
cnf(i_0_24,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9t947rt/input.p',i_0_24) ).
cnf(i_0_29,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9t947rt/input.p',i_0_29) ).
cnf(i_0_19,negated_conjecture,
addition(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0))))))),antidomain(antidomain(esk3_0))) != antidomain(antidomain(esk3_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u9t947rt/input.p',i_0_19) ).
cnf(c_0_43,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
i_0_14 ).
cnf(c_0_44,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_45,plain,
multiplication(X1,one) = X1,
i_0_25 ).
cnf(c_0_46,plain,
multiplication(antidomain(X1),X1) = zero,
i_0_12 ).
cnf(c_0_47,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_50,plain,
addition(zero,antidomain(zero)) = one,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_49,c_0_44]) ).
cnf(c_0_52,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_53,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_54,plain,
addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2))))) = antidomain(multiplication(X1,antidomain(antidomain(X2)))),
i_0_13 ).
cnf(c_0_55,negated_conjecture,
multiplication(antidomain(esk3_0),multiplication(esk1_0,antidomain(antidomain(esk2_0)))) = zero,
i_0_20 ).
cnf(c_0_56,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_22 ).
cnf(c_0_59,negated_conjecture,
addition(one,antidomain(multiplication(antidomain(esk3_0),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(esk2_0)))))))) = antidomain(multiplication(antidomain(esk3_0),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(esk2_0))))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_60,plain,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_47]),c_0_44]) ).
cnf(c_0_61,plain,
multiplication(addition(X1,antidomain(X2)),X2) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_46]),c_0_49]) ).
cnf(c_0_62,negated_conjecture,
antidomain(multiplication(antidomain(esk3_0),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(esk2_0))))))) = one,
inference(rw,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,plain,
multiplication(one,X1) = X1,
i_0_24 ).
cnf(c_0_64,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_29 ).
cnf(c_0_65,plain,
multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
inference(spm,[status(thm)],[c_0_61,c_0_44]) ).
cnf(c_0_66,plain,
multiplication(antidomain(esk3_0),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(esk2_0)))))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_62]),c_0_63]) ).
cnf(c_0_67,negated_conjecture,
addition(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0))))))),antidomain(antidomain(esk3_0))) != antidomain(antidomain(esk3_0)),
i_0_19 ).
cnf(c_0_68,plain,
multiplication(antidomain(X1),addition(X2,X1)) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_46]),c_0_49]) ).
cnf(c_0_69,plain,
multiplication(antidomain(antidomain(X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_47]),c_0_63]) ).
cnf(c_0_70,plain,
multiplication(addition(antidomain(esk3_0),X1),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(esk2_0)))))) = multiplication(X1,antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(esk2_0)))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_66]),c_0_51]) ).
cnf(c_0_71,negated_conjecture,
addition(antidomain(antidomain(esk3_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0)))))))) != antidomain(antidomain(esk3_0)),
inference(rw,[status(thm)],[c_0_67,c_0_44]) ).
cnf(c_0_72,plain,
antidomain(antidomain(antidomain(X1))) = antidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_47]),c_0_45]),c_0_69]) ).
cnf(c_0_73,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_45]),c_0_44]) ).
cnf(c_0_74,plain,
multiplication(antidomain(antidomain(esk3_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(esk2_0)))))) = antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(esk2_0))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_47]),c_0_63]) ).
cnf(c_0_75,negated_conjecture,
addition(antidomain(antidomain(esk3_0)),antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(esk2_0)))))) != antidomain(antidomain(esk3_0)),
inference(rw,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_76,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_44]),c_0_60]),c_0_45]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : KLE100+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 08:00:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.40/2.58 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 9.40/2.58 # Version: 2.1pre011
% 9.40/2.58 # Preprocessing time : 0.019 s
% 9.40/2.58
% 9.40/2.58 # Proof found!
% 9.40/2.58 # SZS status Theorem
% 9.40/2.58 # SZS output start CNFRefutation
% See solution above
% 9.40/2.58 # Proof object total steps : 47
% 9.40/2.58 # Proof object clause steps : 34
% 9.40/2.58 # Proof object formula steps : 13
% 9.40/2.58 # Proof object conjectures : 8
% 9.40/2.58 # Proof object clause conjectures : 6
% 9.40/2.58 # Proof object formula conjectures : 2
% 9.40/2.58 # Proof object initial clauses used : 13
% 9.40/2.58 # Proof object initial formulas used : 13
% 9.40/2.58 # Proof object generating inferences : 16
% 9.40/2.58 # Proof object simplifying inferences : 20
% 9.40/2.58 # Training examples: 0 positive, 0 negative
% 9.40/2.58 # Parsed axioms : 21
% 9.40/2.58 # Removed by relevancy pruning/SinE : 0
% 9.40/2.58 # Initial clauses : 21
% 9.40/2.58 # Removed in clause preprocessing : 0
% 9.40/2.58 # Initial clauses in saturation : 21
% 9.40/2.58 # Processed clauses : 640
% 9.40/2.58 # ...of these trivial : 253
% 9.40/2.58 # ...subsumed : 81
% 9.40/2.58 # ...remaining for further processing : 306
% 9.40/2.58 # Other redundant clauses eliminated : 0
% 9.40/2.58 # Clauses deleted for lack of memory : 0
% 9.40/2.58 # Backward-subsumed : 0
% 9.40/2.58 # Backward-rewritten : 67
% 9.40/2.58 # Generated clauses : 17156
% 9.40/2.58 # ...of the previous two non-trivial : 9771
% 9.40/2.58 # Contextual simplify-reflections : 0
% 9.40/2.58 # Paramodulations : 17156
% 9.40/2.58 # Factorizations : 0
% 9.40/2.58 # Equation resolutions : 0
% 9.40/2.58 # Propositional unsat checks : 0
% 9.40/2.58 # Propositional unsat check successes : 0
% 9.40/2.58 # Current number of processed clauses : 239
% 9.40/2.58 # Positive orientable unit clauses : 232
% 9.40/2.58 # Positive unorientable unit clauses: 4
% 9.40/2.58 # Negative unit clauses : 1
% 9.40/2.58 # Non-unit-clauses : 2
% 9.40/2.58 # Current number of unprocessed clauses: 8090
% 9.40/2.58 # ...number of literals in the above : 8090
% 9.40/2.58 # Current number of archived formulas : 0
% 9.40/2.58 # Current number of archived clauses : 67
% 9.40/2.58 # Clause-clause subsumption calls (NU) : 0
% 9.40/2.58 # Rec. Clause-clause subsumption calls : 0
% 9.40/2.58 # Non-unit clause-clause subsumptions : 0
% 9.40/2.58 # Unit Clause-clause subsumption calls : 13
% 9.40/2.58 # Rewrite failures with RHS unbound : 0
% 9.40/2.58 # BW rewrite match attempts : 557
% 9.40/2.58 # BW rewrite match successes : 137
% 9.40/2.58 # Condensation attempts : 0
% 9.40/2.58 # Condensation successes : 0
% 9.40/2.58 # Termbank termtop insertions : 258631
% 9.40/2.58
% 9.40/2.58 # -------------------------------------------------
% 9.40/2.58 # User time : 0.172 s
% 9.40/2.58 # System time : 0.016 s
% 9.40/2.58 # Total time : 0.188 s
% 9.40/2.58 # ...preprocessing : 0.019 s
% 9.40/2.58 # ...main loop : 0.168 s
% 9.40/2.58 # Maximum resident set size: 15276 pages
% 9.40/2.58
%------------------------------------------------------------------------------