TSTP Solution File: KLE005+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE005+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:28 EDT 2022
% Result : Theorem 7.66s 2.41s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 12 unt; 2 nHn; 9 RR)
% Number of literals : 37 ( 27 equ; 17 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_21,plain,
( c(X1) = X2
| ~ test(X1)
| ~ complement(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2smsx4a/input.p',i_0_21) ).
cnf(i_0_17,plain,
( complement(X1,X2)
| addition(X2,X1) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2smsx4a/input.p',i_0_17) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2smsx4a/input.p',i_0_4) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2smsx4a/input.p',i_0_2) ).
cnf(i_0_6,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2smsx4a/input.p',i_0_6) ).
cnf(i_0_13,plain,
multiplication(X1,zero) = zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2smsx4a/input.p',i_0_13) ).
cnf(i_0_23,plain,
( c(X1) = zero
| test(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2smsx4a/input.p',i_0_23) ).
cnf(i_0_5,negated_conjecture,
c(one) != zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y2smsx4a/input.p',i_0_5) ).
cnf(c_0_32,plain,
( c(X1) = X2
| ~ test(X1)
| ~ complement(X1,X2) ),
i_0_21 ).
cnf(c_0_33,plain,
( complement(X1,X2)
| addition(X2,X1) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
i_0_17 ).
cnf(c_0_34,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_35,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_36,plain,
( c(X1) = X2
| multiplication(X2,X1) != zero
| multiplication(X1,X2) != zero
| addition(X2,X1) != one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
multiplication(zero,X1) = zero,
i_0_6 ).
cnf(c_0_39,plain,
multiplication(X1,zero) = zero,
i_0_13 ).
cnf(c_0_40,plain,
( c(X1) = zero
| test(X1) ),
i_0_23 ).
cnf(c_0_41,negated_conjecture,
c(one) != zero,
i_0_5 ).
cnf(c_0_42,plain,
( c(X1) = zero
| X1 != one ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39])]),c_0_40]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_41,c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : KLE005+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Thu Jun 16 07:46:12 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected SinE mode:
% 0.22/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.66/2.41 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.66/2.41 # Version: 2.1pre011
% 7.66/2.41 # Preprocessing time : 0.017 s
% 7.66/2.41
% 7.66/2.41 # Proof found!
% 7.66/2.41 # SZS status Theorem
% 7.66/2.41 # SZS output start CNFRefutation
% See solution above
% 7.66/2.41 # Proof object total steps : 20
% 7.66/2.41 # Proof object clause steps : 12
% 7.66/2.41 # Proof object formula steps : 8
% 7.66/2.41 # Proof object conjectures : 3
% 7.66/2.41 # Proof object clause conjectures : 2
% 7.66/2.41 # Proof object formula conjectures : 1
% 7.66/2.41 # Proof object initial clauses used : 8
% 7.66/2.41 # Proof object initial formulas used : 8
% 7.66/2.41 # Proof object generating inferences : 4
% 7.66/2.41 # Proof object simplifying inferences : 4
% 7.66/2.41 # Training examples: 0 positive, 0 negative
% 7.66/2.41 # Parsed axioms : 23
% 7.66/2.41 # Removed by relevancy pruning/SinE : 0
% 7.66/2.41 # Initial clauses : 23
% 7.66/2.41 # Removed in clause preprocessing : 0
% 7.66/2.41 # Initial clauses in saturation : 23
% 7.66/2.41 # Processed clauses : 33
% 7.66/2.41 # ...of these trivial : 1
% 7.66/2.41 # ...subsumed : 0
% 7.66/2.41 # ...remaining for further processing : 32
% 7.66/2.41 # Other redundant clauses eliminated : 0
% 7.66/2.41 # Clauses deleted for lack of memory : 0
% 7.66/2.41 # Backward-subsumed : 0
% 7.66/2.41 # Backward-rewritten : 0
% 7.66/2.41 # Generated clauses : 90
% 7.66/2.41 # ...of the previous two non-trivial : 46
% 7.66/2.41 # Contextual simplify-reflections : 1
% 7.66/2.41 # Paramodulations : 88
% 7.66/2.41 # Factorizations : 0
% 7.66/2.41 # Equation resolutions : 2
% 7.66/2.41 # Propositional unsat checks : 0
% 7.66/2.41 # Propositional unsat check successes : 0
% 7.66/2.41 # Current number of processed clauses : 32
% 7.66/2.41 # Positive orientable unit clauses : 12
% 7.66/2.41 # Positive unorientable unit clauses: 1
% 7.66/2.41 # Negative unit clauses : 1
% 7.66/2.41 # Non-unit-clauses : 18
% 7.66/2.41 # Current number of unprocessed clauses: 36
% 7.66/2.41 # ...number of literals in the above : 72
% 7.66/2.41 # Current number of archived formulas : 0
% 7.66/2.41 # Current number of archived clauses : 0
% 7.66/2.41 # Clause-clause subsumption calls (NU) : 16
% 7.66/2.41 # Rec. Clause-clause subsumption calls : 11
% 7.66/2.41 # Non-unit clause-clause subsumptions : 1
% 7.66/2.41 # Unit Clause-clause subsumption calls : 0
% 7.66/2.41 # Rewrite failures with RHS unbound : 0
% 7.66/2.41 # BW rewrite match attempts : 6
% 7.66/2.41 # BW rewrite match successes : 4
% 7.66/2.41 # Condensation attempts : 0
% 7.66/2.41 # Condensation successes : 0
% 7.66/2.41 # Termbank termtop insertions : 1047
% 7.66/2.41
% 7.66/2.41 # -------------------------------------------------
% 7.66/2.41 # User time : 0.012 s
% 7.66/2.41 # System time : 0.008 s
% 7.66/2.41 # Total time : 0.019 s
% 7.66/2.41 # ...preprocessing : 0.017 s
% 7.66/2.41 # ...main loop : 0.002 s
% 7.66/2.41 # Maximum resident set size: 7128 pages
% 7.66/2.41
%------------------------------------------------------------------------------