%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KLE004+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:27 EDT 2022
% Result : Theorem 7.48s 2.43s
% Output : CNFRefutation 7.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 14 unt; 0 nHn; 14 RR)
% Number of literals : 44 ( 29 equ; 25 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 : 29 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_21,plain,
( c(X1) = X2
| ~ test(X1)
| ~ complement(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23hx5ihb/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/sandbox/tmp/enigma-theBenchmark.p-23hx5ihb/input.p',i_0_17) ).
cnf(i_0_4,plain,
addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23hx5ihb/input.p',i_0_4) ).
cnf(i_0_13,plain,
multiplication(X1,zero) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23hx5ihb/input.p',i_0_13) ).
cnf(i_0_6,plain,
multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23hx5ihb/input.p',i_0_6) ).
cnf(i_0_15,plain,
( test(X1)
| ~ complement(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23hx5ihb/input.p',i_0_15) ).
cnf(i_0_2,plain,
addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23hx5ihb/input.p',i_0_2) ).
cnf(i_0_5,negated_conjecture,
c(zero) != one,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-23hx5ihb/input.p',i_0_5) ).
cnf(c_0_30,plain,
( c(X1) = X2
| ~ test(X1)
| ~ complement(X1,X2) ),
i_0_21 ).
cnf(c_0_31,plain,
( complement(X1,X2)
| addition(X2,X1) != one
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero ),
i_0_17 ).
cnf(c_0_32,plain,
( c(X1) = X2
| multiplication(X2,X1) != zero
| multiplication(X1,X2) != zero
| addition(X2,X1) != one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
addition(X1,zero) = X1,
i_0_4 ).
cnf(c_0_34,plain,
multiplication(X1,zero) = zero,
i_0_13 ).
cnf(c_0_35,plain,
multiplication(zero,X1) = zero,
i_0_6 ).
cnf(c_0_36,plain,
( test(X1)
| ~ complement(X2,X1) ),
i_0_15 ).
cnf(c_0_37,plain,
addition(X1,X2) = addition(X2,X1),
i_0_2 ).
cnf(c_0_38,plain,
( c(zero) = X1
| X1 != one
| ~ test(zero) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_39,negated_conjecture,
c(zero) != one,
i_0_5 ).
cnf(c_0_40,plain,
( test(X1)
| multiplication(X1,X2) != zero
| multiplication(X2,X1) != zero
| addition(X1,X2) != one ),
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_41,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_37]) ).
cnf(c_0_42,plain,
~ test(zero),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_39]) ).
cnf(c_0_43,plain,
X1 != one,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_35]),c_0_34])]),c_0_42]) ).
cnf(c_0_44,plain,
$false,
inference(er,[status(thm)],[c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : KLE004+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 09:32:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.48/2.43 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 7.48/2.43 # Version: 2.1pre011
% 7.48/2.43 # Preprocessing time : 0.014 s
% 7.48/2.43
% 7.48/2.43 # Proof found!
% 7.48/2.43 # SZS status Theorem
% 7.48/2.43 # SZS output start CNFRefutation
% See solution above
% 7.48/2.43 # Proof object total steps : 23
% 7.48/2.43 # Proof object clause steps : 15
% 7.48/2.43 # Proof object formula steps : 8
% 7.48/2.43 # Proof object conjectures : 2
% 7.48/2.43 # Proof object clause conjectures : 1
% 7.48/2.43 # Proof object formula conjectures : 1
% 7.48/2.43 # Proof object initial clauses used : 8
% 7.48/2.43 # Proof object initial formulas used : 8
% 7.48/2.43 # Proof object generating inferences : 7
% 7.48/2.43 # Proof object simplifying inferences : 8
% 7.48/2.43 # Training examples: 0 positive, 0 negative
% 7.48/2.43 # Parsed axioms : 23
% 7.48/2.43 # Removed by relevancy pruning/SinE : 0
% 7.48/2.43 # Initial clauses : 23
% 7.48/2.43 # Removed in clause preprocessing : 0
% 7.48/2.43 # Initial clauses in saturation : 23
% 7.48/2.43 # Processed clauses : 61
% 7.48/2.43 # ...of these trivial : 1
% 7.48/2.43 # ...subsumed : 13
% 7.48/2.43 # ...remaining for further processing : 47
% 7.48/2.43 # Other redundant clauses eliminated : 1
% 7.48/2.43 # Clauses deleted for lack of memory : 0
% 7.48/2.43 # Backward-subsumed : 0
% 7.48/2.43 # Backward-rewritten : 0
% 7.48/2.43 # Generated clauses : 207
% 7.48/2.43 # ...of the previous two non-trivial : 146
% 7.48/2.43 # Contextual simplify-reflections : 11
% 7.48/2.43 # Paramodulations : 203
% 7.48/2.43 # Factorizations : 0
% 7.48/2.43 # Equation resolutions : 4
% 7.48/2.43 # Propositional unsat checks : 0
% 7.48/2.43 # Propositional unsat check successes : 0
% 7.48/2.43 # Current number of processed clauses : 47
% 7.48/2.43 # Positive orientable unit clauses : 13
% 7.48/2.43 # Positive unorientable unit clauses: 2
% 7.48/2.43 # Negative unit clauses : 5
% 7.48/2.43 # Non-unit-clauses : 27
% 7.48/2.43 # Current number of unprocessed clauses: 108
% 7.48/2.43 # ...number of literals in the above : 203
% 7.48/2.43 # Current number of archived formulas : 0
% 7.48/2.43 # Current number of archived clauses : 0
% 7.48/2.43 # Clause-clause subsumption calls (NU) : 55
% 7.48/2.43 # Rec. Clause-clause subsumption calls : 49
% 7.48/2.43 # Non-unit clause-clause subsumptions : 18
% 7.48/2.43 # Unit Clause-clause subsumption calls : 27
% 7.48/2.43 # Rewrite failures with RHS unbound : 0
% 7.48/2.43 # BW rewrite match attempts : 8
% 7.48/2.43 # BW rewrite match successes : 6
% 7.48/2.43 # Condensation attempts : 0
% 7.48/2.43 # Condensation successes : 0
% 7.48/2.43 # Termbank termtop insertions : 2001
% 7.48/2.43
% 7.48/2.43 # -------------------------------------------------
% 7.48/2.43 # User time : 0.013 s
% 7.48/2.43 # System time : 0.003 s
% 7.48/2.43 # Total time : 0.016 s
% 7.48/2.43 # ...preprocessing : 0.014 s
% 7.48/2.43 # ...main loop : 0.002 s
% 7.48/2.43 # Maximum resident set size: 7124 pages
% 7.48/2.43
%------------------------------------------------------------------------------