TSTP Solution File: KLE091+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE091+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:05 EDT 2022
% Result : Theorem 7.90s 2.53s
% Output : CNFRefutation 7.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of clauses : 65 ( 65 unt; 0 nHn; 5 RR)
% Number of literals : 65 ( 64 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 88 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_11) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_2) ).
cnf(i_0_1,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_1) ).
cnf(i_0_18,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_18) ).
cnf(i_0_9,plain,
multiplication(antidomain(X1),X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_9) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_4) ).
cnf(i_0_3,plain,
addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_3) ).
cnf(i_0_10,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-unzmgxsl/input.p',i_0_10) ).
cnf(i_0_5,plain,
multiplication(X1,coantidomain(X1)) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_5) ).
cnf(i_0_22,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_22) ).
cnf(i_0_15,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_15) ).
cnf(i_0_7,plain,
addition(coantidomain(coantidomain(X1)),coantidomain(X1)) = one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_7) ).
cnf(i_0_17,plain,
multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_17) ).
cnf(i_0_6,plain,
addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2))) = coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_6) ).
cnf(i_0_13,negated_conjecture,
antidomain(antidomain(coantidomain(coantidomain(esk1_0)))) != coantidomain(coantidomain(esk1_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-unzmgxsl/input.p',i_0_13) ).
cnf(c_0_38,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
i_0_11 ).
cnf(c_0_39,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_40,plain,
addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
i_0_1 ).
cnf(c_0_41,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
multiplication(X1,one) = X1,
i_0_18 ).
cnf(c_0_43,plain,
multiplication(antidomain(X1),X1) = zero,
i_0_9 ).
cnf(c_0_44,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_45,plain,
addition(antidomain(X1),addition(antidomain(antidomain(X1)),X2)) = addition(one,X2),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
addition(X1,X1) = X1,
i_0_3 ).
cnf(c_0_47,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_39,c_0_44]) ).
cnf(c_0_49,plain,
addition(one,antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_41]) ).
cnf(c_0_50,plain,
addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2))))) = antidomain(multiplication(X1,antidomain(antidomain(X2)))),
i_0_10 ).
cnf(c_0_51,plain,
multiplication(X1,coantidomain(X1)) = zero,
i_0_5 ).
cnf(c_0_52,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_47]),c_0_48]) ).
cnf(c_0_53,plain,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_41]),c_0_49]),c_0_39]) ).
cnf(c_0_54,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_22 ).
cnf(c_0_55,plain,
addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
i_0_15 ).
cnf(c_0_56,plain,
addition(coantidomain(coantidomain(X1)),coantidomain(X1)) = one,
i_0_7 ).
cnf(c_0_57,plain,
antidomain(multiplication(X1,antidomain(antidomain(coantidomain(X1))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_53]) ).
cnf(c_0_58,plain,
multiplication(one,X1) = X1,
i_0_17 ).
cnf(c_0_59,plain,
multiplication(antidomain(X1),addition(X2,X1)) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_43]),c_0_44]) ).
cnf(c_0_60,plain,
multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_43]),c_0_48]) ).
cnf(c_0_61,plain,
addition(coantidomain(X1),coantidomain(coantidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_56,c_0_39]) ).
cnf(c_0_62,plain,
multiplication(X1,antidomain(antidomain(coantidomain(X1)))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_57]),c_0_58]) ).
cnf(c_0_63,plain,
multiplication(antidomain(antidomain(antidomain(X1))),antidomain(X1)) = antidomain(antidomain(antidomain(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_41]),c_0_42]) ).
cnf(c_0_64,plain,
multiplication(antidomain(antidomain(X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_41]),c_0_58]) ).
cnf(c_0_65,plain,
multiplication(X1,addition(coantidomain(X1),X2)) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_51]),c_0_48]) ).
cnf(c_0_66,plain,
addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2))) = coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)),
i_0_6 ).
cnf(c_0_67,plain,
addition(coantidomain(X1),addition(coantidomain(coantidomain(X1)),X2)) = addition(one,X2),
inference(spm,[status(thm)],[c_0_40,c_0_61]) ).
cnf(c_0_68,plain,
multiplication(X1,addition(antidomain(antidomain(coantidomain(X1))),X2)) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_62]),c_0_48]) ).
cnf(c_0_69,plain,
antidomain(antidomain(antidomain(X1))) = antidomain(X1),
inference(rw,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_70,plain,
multiplication(addition(X1,X2),coantidomain(X2)) = multiplication(X1,coantidomain(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_51]),c_0_44]) ).
cnf(c_0_71,plain,
multiplication(X1,coantidomain(coantidomain(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_61]),c_0_42]) ).
cnf(c_0_72,plain,
addition(coantidomain(X1),coantidomain(coantidomain(coantidomain(X1)))) = coantidomain(coantidomain(coantidomain(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_42]),c_0_42]) ).
cnf(c_0_73,plain,
addition(one,coantidomain(coantidomain(X1))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_46]),c_0_61]) ).
cnf(c_0_74,plain,
multiplication(X1,antidomain(coantidomain(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_41]),c_0_42]),c_0_69]) ).
cnf(c_0_75,plain,
coantidomain(coantidomain(coantidomain(X1))) = coantidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_61]),c_0_58]),c_0_71]) ).
cnf(c_0_76,plain,
addition(coantidomain(X1),coantidomain(coantidomain(coantidomain(coantidomain(X1))))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_72]),c_0_73]) ).
cnf(c_0_77,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_58]),c_0_39]) ).
cnf(c_0_78,plain,
multiplication(coantidomain(coantidomain(X1)),antidomain(coantidomain(X1))) = coantidomain(coantidomain(X1)),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_79,plain,
addition(one,coantidomain(X1)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_76]),c_0_73]),c_0_39]) ).
cnf(c_0_80,plain,
addition(coantidomain(coantidomain(X1)),antidomain(coantidomain(X1))) = antidomain(coantidomain(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_39]),c_0_79]),c_0_58]),c_0_39]) ).
cnf(c_0_81,plain,
multiplication(antidomain(X1),addition(X1,X2)) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_43]),c_0_48]) ).
cnf(c_0_82,plain,
multiplication(addition(X1,X2),coantidomain(X1)) = multiplication(X2,coantidomain(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_51]),c_0_48]) ).
cnf(c_0_83,plain,
addition(coantidomain(X1),antidomain(coantidomain(X1))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_80]),c_0_53]) ).
cnf(c_0_84,plain,
multiplication(antidomain(coantidomain(X1)),coantidomain(coantidomain(X1))) = antidomain(coantidomain(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_61]),c_0_42]) ).
cnf(c_0_85,negated_conjecture,
antidomain(antidomain(coantidomain(coantidomain(esk1_0)))) != coantidomain(coantidomain(esk1_0)),
i_0_13 ).
cnf(c_0_86,plain,
antidomain(coantidomain(X1)) = coantidomain(coantidomain(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_58]),c_0_84]) ).
cnf(c_0_87,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_86]),c_0_75]),c_0_86])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE091+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 14:16:42 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.90/2.53 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.90/2.53 # Version: 2.1pre011
% 7.90/2.53 # Preprocessing time : 0.019 s
% 7.90/2.53
% 7.90/2.53 # Proof found!
% 7.90/2.53 # SZS status Theorem
% 7.90/2.53 # SZS output start CNFRefutation
% See solution above
% 7.90/2.53 # Proof object total steps : 65
% 7.90/2.53 # Proof object clause steps : 50
% 7.90/2.53 # Proof object formula steps : 15
% 7.90/2.53 # Proof object conjectures : 3
% 7.90/2.53 # Proof object clause conjectures : 2
% 7.90/2.53 # Proof object formula conjectures : 1
% 7.90/2.53 # Proof object initial clauses used : 15
% 7.90/2.53 # Proof object initial formulas used : 15
% 7.90/2.53 # Proof object generating inferences : 31
% 7.90/2.53 # Proof object simplifying inferences : 42
% 7.90/2.53 # Training examples: 0 positive, 0 negative
% 7.90/2.53 # Parsed axioms : 20
% 7.90/2.53 # Removed by relevancy pruning/SinE : 0
% 7.90/2.53 # Initial clauses : 20
% 7.90/2.53 # Removed in clause preprocessing : 0
% 7.90/2.53 # Initial clauses in saturation : 20
% 7.90/2.53 # Processed clauses : 642
% 7.90/2.53 # ...of these trivial : 273
% 7.90/2.53 # ...subsumed : 170
% 7.90/2.53 # ...remaining for further processing : 199
% 7.90/2.53 # Other redundant clauses eliminated : 0
% 7.90/2.53 # Clauses deleted for lack of memory : 0
% 7.90/2.53 # Backward-subsumed : 0
% 7.90/2.53 # Backward-rewritten : 61
% 7.90/2.53 # Generated clauses : 10982
% 7.90/2.53 # ...of the previous two non-trivial : 5766
% 7.90/2.53 # Contextual simplify-reflections : 0
% 7.90/2.53 # Paramodulations : 10982
% 7.90/2.53 # Factorizations : 0
% 7.90/2.53 # Equation resolutions : 0
% 7.90/2.53 # Propositional unsat checks : 0
% 7.90/2.53 # Propositional unsat check successes : 0
% 7.90/2.53 # Current number of processed clauses : 138
% 7.90/2.53 # Positive orientable unit clauses : 132
% 7.90/2.53 # Positive unorientable unit clauses: 4
% 7.90/2.53 # Negative unit clauses : 0
% 7.90/2.53 # Non-unit-clauses : 2
% 7.90/2.53 # Current number of unprocessed clauses: 3788
% 7.90/2.53 # ...number of literals in the above : 3788
% 7.90/2.53 # Current number of archived formulas : 0
% 7.90/2.53 # Current number of archived clauses : 61
% 7.90/2.53 # Clause-clause subsumption calls (NU) : 0
% 7.90/2.53 # Rec. Clause-clause subsumption calls : 0
% 7.90/2.53 # Non-unit clause-clause subsumptions : 0
% 7.90/2.53 # Unit Clause-clause subsumption calls : 10
% 7.90/2.53 # Rewrite failures with RHS unbound : 0
% 7.90/2.53 # BW rewrite match attempts : 270
% 7.90/2.53 # BW rewrite match successes : 71
% 7.90/2.53 # Condensation attempts : 0
% 7.90/2.53 # Condensation successes : 0
% 7.90/2.53 # Termbank termtop insertions : 127986
% 7.90/2.53
% 7.90/2.53 # -------------------------------------------------
% 7.90/2.53 # User time : 0.117 s
% 7.90/2.53 # System time : 0.009 s
% 7.90/2.53 # Total time : 0.126 s
% 7.90/2.53 # ...preprocessing : 0.019 s
% 7.90/2.53 # ...main loop : 0.108 s
% 7.90/2.53 # Maximum resident set size: 9732 pages
% 7.90/2.53
%------------------------------------------------------------------------------