TSTP Solution File: CSR159+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR159+1 : TPTP v8.1.0. Released v7.3.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 : Fri Jul 15 02:49:52 EDT 2022
% Result : Theorem 26.22s 6.39s
% Output : CNFRefutation 26.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 11 unt; 0 nHn; 19 RR)
% Number of literals : 29 ( 2 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 22 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3441,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__disjointDecomposition3(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4h9ldl2b/input.p',i_0_3441) ).
cnf(i_0_3400,plain,
( p__d__disjointDecomposition3(X1,X2,X3)
| ~ p__d__partition3(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4h9ldl2b/input.p',i_0_3400) ).
cnf(i_0_1380,plain,
p__d__partition3(c__Integer,c__OddInteger,c__EvenInteger),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4h9ldl2b/input.p',i_0_1380) ).
cnf(i_0_3386,plain,
( ~ p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__disjoint(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4h9ldl2b/input.p',i_0_3386) ).
cnf(i_0_3,negated_conjecture,
p__d__instance(esk1_0,c__EvenInteger),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4h9ldl2b/input.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
esk2_0 = esk1_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4h9ldl2b/input.p',i_0_1) ).
cnf(i_0_2,negated_conjecture,
p__d__instance(esk2_0,c__OddInteger),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4h9ldl2b/input.p',i_0_2) ).
cnf(c_0_3449,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__disjointDecomposition3(X3,X1,X2) ),
i_0_3441 ).
cnf(c_0_3450,plain,
( p__d__disjointDecomposition3(X1,X2,X3)
| ~ p__d__partition3(X1,X2,X3) ),
i_0_3400 ).
cnf(c_0_3451,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__partition3(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_3449,c_0_3450]) ).
cnf(c_0_3452,plain,
p__d__partition3(c__Integer,c__OddInteger,c__EvenInteger),
i_0_1380 ).
cnf(c_0_3453,plain,
( ~ p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__disjoint(X3,X2) ),
i_0_3386 ).
cnf(c_0_3454,plain,
p__d__disjoint(c__OddInteger,c__EvenInteger),
inference(spm,[status(thm)],[c_0_3451,c_0_3452]) ).
cnf(c_0_3455,negated_conjecture,
p__d__instance(esk1_0,c__EvenInteger),
i_0_3 ).
cnf(c_0_3456,negated_conjecture,
esk2_0 = esk1_0,
i_0_1 ).
cnf(c_0_3457,plain,
( ~ p__d__instance(X1,c__OddInteger)
| ~ p__d__instance(X1,c__EvenInteger) ),
inference(spm,[status(thm)],[c_0_3453,c_0_3454]) ).
cnf(c_0_3458,negated_conjecture,
p__d__instance(esk2_0,c__EvenInteger),
inference(rw,[status(thm)],[c_0_3455,c_0_3456]) ).
cnf(c_0_3459,negated_conjecture,
p__d__instance(esk2_0,c__OddInteger),
i_0_2 ).
cnf(c_0_3460,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3457,c_0_3458]),c_0_3459])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : CSR159+1 : TPTP v8.1.0. Released v7.3.0.
% 0.12/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n022.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 : Fri Jun 10 15:30:06 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.45/0.64 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.45/0.64 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.45/0.64 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.45/0.64 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 26.22/6.39 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 26.22/6.39 # Version: 2.1pre011
% 26.22/6.39 # Preprocessing time : 0.145 s
% 26.22/6.39
% 26.22/6.39 # Proof found!
% 26.22/6.39 # SZS status Theorem
% 26.22/6.39 # SZS output start CNFRefutation
% See solution above
% 26.22/6.39 # Proof object total steps : 19
% 26.22/6.39 # Proof object clause steps : 12
% 26.22/6.39 # Proof object formula steps : 7
% 26.22/6.39 # Proof object conjectures : 8
% 26.22/6.39 # Proof object clause conjectures : 5
% 26.22/6.39 # Proof object formula conjectures : 3
% 26.22/6.39 # Proof object initial clauses used : 7
% 26.22/6.39 # Proof object initial formulas used : 7
% 26.22/6.39 # Proof object generating inferences : 4
% 26.22/6.39 # Proof object simplifying inferences : 3
% 26.22/6.39 # Training examples: 0 positive, 0 negative
% 26.22/6.39 # Parsed axioms : 4242
% 26.22/6.39 # Removed by relevancy pruning/SinE : 0
% 26.22/6.39 # Initial clauses : 4242
% 26.22/6.39 # Removed in clause preprocessing : 0
% 26.22/6.39 # Initial clauses in saturation : 4242
% 26.22/6.39 # Processed clauses : 5781
% 26.22/6.39 # ...of these trivial : 56
% 26.22/6.39 # ...subsumed : 95
% 26.22/6.39 # ...remaining for further processing : 5630
% 26.22/6.39 # Other redundant clauses eliminated : 10
% 26.22/6.39 # Clauses deleted for lack of memory : 0
% 26.22/6.39 # Backward-subsumed : 1
% 26.22/6.39 # Backward-rewritten : 0
% 26.22/6.39 # Generated clauses : 19942
% 26.22/6.39 # ...of the previous two non-trivial : 19106
% 26.22/6.39 # Contextual simplify-reflections : 1661
% 26.22/6.39 # Paramodulations : 19813
% 26.22/6.39 # Factorizations : 47
% 26.22/6.39 # Equation resolutions : 82
% 26.22/6.39 # Propositional unsat checks : 1
% 26.22/6.39 # Propositional unsat check successes : 0
% 26.22/6.39 # Current number of processed clauses : 5623
% 26.22/6.39 # Positive orientable unit clauses : 1312
% 26.22/6.39 # Positive unorientable unit clauses: 0
% 26.22/6.39 # Negative unit clauses : 220
% 26.22/6.39 # Non-unit-clauses : 4091
% 26.22/6.39 # Current number of unprocessed clauses: 17555
% 26.22/6.39 # ...number of literals in the above : 73711
% 26.22/6.39 # Current number of archived formulas : 0
% 26.22/6.39 # Current number of archived clauses : 1
% 26.22/6.39 # Clause-clause subsumption calls (NU) : 4904637
% 26.22/6.39 # Rec. Clause-clause subsumption calls : 2232426
% 26.22/6.39 # Non-unit clause-clause subsumptions : 1755
% 26.22/6.39 # Unit Clause-clause subsumption calls : 521032
% 26.22/6.39 # Rewrite failures with RHS unbound : 0
% 26.22/6.39 # BW rewrite match attempts : 0
% 26.22/6.39 # BW rewrite match successes : 0
% 26.22/6.39 # Condensation attempts : 0
% 26.22/6.39 # Condensation successes : 0
% 26.22/6.39 # Termbank termtop insertions : 481867
% 26.22/6.39
% 26.22/6.39 # -------------------------------------------------
% 26.22/6.39 # User time : 1.761 s
% 26.22/6.39 # System time : 0.032 s
% 26.22/6.39 # Total time : 1.793 s
% 26.22/6.39 # ...preprocessing : 0.145 s
% 26.22/6.39 # ...main loop : 1.649 s
% 26.22/6.39 # Maximum resident set size: 56080 pages
% 26.22/6.39
%------------------------------------------------------------------------------