TSTP Solution File: KLE007+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE007+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:29 EDT 2022
% Result : Theorem 8.38s 2.43s
% Output : CNFRefutation 8.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 15 unt; 0 nHn; 15 RR)
% Number of literals : 30 ( 17 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 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 : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_20,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dy6evmnm/input.p',i_0_20) ).
cnf(i_0_24,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dy6evmnm/input.p',i_0_24) ).
cnf(i_0_5,negated_conjecture,
addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))) != one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dy6evmnm/input.p',i_0_5) ).
cnf(i_0_16,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dy6evmnm/input.p',i_0_16) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dy6evmnm/input.p',i_0_2) ).
cnf(i_0_12,plain,
multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dy6evmnm/input.p',i_0_12) ).
cnf(i_0_7,negated_conjecture,
test(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dy6evmnm/input.p',i_0_7) ).
cnf(i_0_6,negated_conjecture,
test(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dy6evmnm/input.p',i_0_6) ).
cnf(c_0_33,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
i_0_20 ).
cnf(c_0_34,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
i_0_24 ).
cnf(c_0_35,negated_conjecture,
addition(multiplication(addition(esk1_0,c(esk1_0)),esk2_0),multiplication(addition(esk1_0,c(esk1_0)),c(esk2_0))) != one,
i_0_5 ).
cnf(c_0_36,plain,
addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
i_0_16 ).
cnf(c_0_37,plain,
( addition(X1,X2) = one
| c(X2) != X1
| ~ test(X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_39,negated_conjecture,
multiplication(addition(esk1_0,c(esk1_0)),addition(esk2_0,c(esk2_0))) != one,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_37]),c_0_38]) ).
cnf(c_0_41,plain,
multiplication(X1,one) = X1,
i_0_12 ).
cnf(c_0_42,negated_conjecture,
test(esk2_0),
i_0_7 ).
cnf(c_0_43,negated_conjecture,
addition(esk1_0,c(esk1_0)) != one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42])]) ).
cnf(c_0_44,negated_conjecture,
test(esk1_0),
i_0_6 ).
cnf(c_0_45,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_40]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE007+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n022.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 11:58:49 EDT 2022
% 0.20/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.38/2.43 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.38/2.43 # Version: 2.1pre011
% 8.38/2.43 # Preprocessing time : 0.023 s
% 8.38/2.43
% 8.38/2.43 # Proof found!
% 8.38/2.43 # SZS status Theorem
% 8.38/2.43 # SZS output start CNFRefutation
% See solution above
% 8.38/2.43 # Proof object total steps : 21
% 8.38/2.43 # Proof object clause steps : 13
% 8.38/2.43 # Proof object formula steps : 8
% 8.38/2.43 # Proof object conjectures : 8
% 8.38/2.43 # Proof object clause conjectures : 5
% 8.38/2.43 # Proof object formula conjectures : 3
% 8.38/2.43 # Proof object initial clauses used : 8
% 8.38/2.43 # Proof object initial formulas used : 8
% 8.38/2.43 # Proof object generating inferences : 4
% 8.38/2.43 # Proof object simplifying inferences : 7
% 8.38/2.43 # Training examples: 0 positive, 0 negative
% 8.38/2.43 # Parsed axioms : 27
% 8.38/2.43 # Removed by relevancy pruning/SinE : 0
% 8.38/2.43 # Initial clauses : 27
% 8.38/2.43 # Removed in clause preprocessing : 0
% 8.38/2.43 # Initial clauses in saturation : 27
% 8.38/2.43 # Processed clauses : 40
% 8.38/2.43 # ...of these trivial : 1
% 8.38/2.43 # ...subsumed : 0
% 8.38/2.43 # ...remaining for further processing : 39
% 8.38/2.43 # Other redundant clauses eliminated : 0
% 8.38/2.43 # Clauses deleted for lack of memory : 0
% 8.38/2.43 # Backward-subsumed : 0
% 8.38/2.43 # Backward-rewritten : 1
% 8.38/2.43 # Generated clauses : 117
% 8.38/2.43 # ...of the previous two non-trivial : 73
% 8.38/2.43 # Contextual simplify-reflections : 0
% 8.38/2.43 # Paramodulations : 115
% 8.38/2.43 # Factorizations : 0
% 8.38/2.43 # Equation resolutions : 2
% 8.38/2.43 # Propositional unsat checks : 0
% 8.38/2.43 # Propositional unsat check successes : 0
% 8.38/2.43 # Current number of processed clauses : 38
% 8.38/2.43 # Positive orientable unit clauses : 14
% 8.38/2.43 # Positive unorientable unit clauses: 1
% 8.38/2.43 # Negative unit clauses : 2
% 8.38/2.43 # Non-unit-clauses : 21
% 8.38/2.43 # Current number of unprocessed clauses: 60
% 8.38/2.43 # ...number of literals in the above : 128
% 8.38/2.43 # Current number of archived formulas : 0
% 8.38/2.43 # Current number of archived clauses : 1
% 8.38/2.43 # Clause-clause subsumption calls (NU) : 29
% 8.38/2.43 # Rec. Clause-clause subsumption calls : 28
% 8.38/2.43 # Non-unit clause-clause subsumptions : 0
% 8.38/2.43 # Unit Clause-clause subsumption calls : 1
% 8.38/2.43 # Rewrite failures with RHS unbound : 0
% 8.38/2.43 # BW rewrite match attempts : 17
% 8.38/2.43 # BW rewrite match successes : 11
% 8.38/2.43 # Condensation attempts : 0
% 8.38/2.43 # Condensation successes : 0
% 8.38/2.43 # Termbank termtop insertions : 1414
% 8.38/2.43
% 8.38/2.43 # -------------------------------------------------
% 8.38/2.43 # User time : 0.019 s
% 8.38/2.43 # System time : 0.007 s
% 8.38/2.43 # Total time : 0.026 s
% 8.38/2.43 # ...preprocessing : 0.023 s
% 8.38/2.43 # ...main loop : 0.003 s
% 8.38/2.43 # Maximum resident set size: 7132 pages
% 8.38/2.43
%------------------------------------------------------------------------------