%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR162+1 : TPTP v8.1.0. Released v7.3.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 : Fri Jul 15 02:49:52 EDT 2022
% Result : Theorem 23.25s 5.94s
% Output : CNFRefutation 23.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 37 ( 17 unt; 5 nHn; 26 RR)
% Number of literals : 61 ( 2 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-1 aty)
% Number of variables : 47 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,negated_conjecture,
( p__d__instance(X1,c__Putting)
| p__d__instance(esk1_1(X1),c__Covering) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_9f_7euv/input.p',i_0_2) ).
cnf(i_0_1,negated_conjecture,
( esk1_1(X1) = X1
| p__d__instance(X1,c__Putting) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_9f_7euv/input.p',i_0_1) ).
cnf(i_0_3500,plain,
( p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__subclass(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_9f_7euv/input.p',i_0_3500) ).
cnf(i_0_590,plain,
p__d__subclass(c__Covering,c__Putting),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_9f_7euv/input.p',i_0_590) ).
cnf(i_0_589,plain,
p__d__subclass(c__Putting,c__Transfer),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_9f_7euv/input.p',i_0_589) ).
cnf(i_0_572,plain,
p__d__subclass(c__Transfer,c__Translocation),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_9f_7euv/input.p',i_0_572) ).
cnf(i_0_3558,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__disjointDecomposition3(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_9f_7euv/input.p',i_0_3558) ).
cnf(i_0_3517,plain,
( p__d__disjointDecomposition3(X1,X2,X3)
| ~ p__d__partition3(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_9f_7euv/input.p',i_0_3517) ).
cnf(i_0_632,plain,
( p__destination(X1,esk98_1(X1))
| ~ p__d__instance(X1,c__Translocation) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_9f_7euv/input.p',i_0_632) ).
cnf(i_0_117,plain,
p__d__partition3(c__Physical,c__Object,c__Process),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_9f_7euv/input.p',i_0_117) ).
cnf(i_0_3968,plain,
( p__d__instance(X1,c__Process)
| ~ p__destination(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_9f_7euv/input.p',i_0_3968) ).
cnf(i_0_635,plain,
( p__d__instance(esk99_1(X1),c__Object)
| ~ p__d__instance(X1,c__Translocation) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_9f_7euv/input.p',i_0_635) ).
cnf(i_0_3503,plain,
( ~ p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__disjoint(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_9f_7euv/input.p',i_0_3503) ).
cnf(c_0_3982,negated_conjecture,
( p__d__instance(X1,c__Putting)
| p__d__instance(esk1_1(X1),c__Covering) ),
i_0_2 ).
cnf(c_0_3983,negated_conjecture,
( esk1_1(X1) = X1
| p__d__instance(X1,c__Putting) ),
i_0_1 ).
cnf(c_0_3984,plain,
( p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__subclass(X3,X2) ),
i_0_3500 ).
cnf(c_0_3985,plain,
p__d__subclass(c__Covering,c__Putting),
i_0_590 ).
cnf(c_0_3986,negated_conjecture,
( p__d__instance(X1,c__Putting)
| p__d__instance(X1,c__Covering) ),
inference(spm,[status(thm)],[c_0_3982,c_0_3983]) ).
cnf(c_0_3987,plain,
p__d__subclass(c__Putting,c__Transfer),
i_0_589 ).
cnf(c_0_3988,plain,
p__d__instance(X1,c__Putting),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3984,c_0_3985]),c_0_3986]) ).
cnf(c_0_3989,plain,
p__d__subclass(c__Transfer,c__Translocation),
i_0_572 ).
cnf(c_0_3990,plain,
p__d__instance(X1,c__Transfer),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3984,c_0_3987]),c_0_3988])]) ).
cnf(c_0_3991,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__disjointDecomposition3(X3,X1,X2) ),
i_0_3558 ).
cnf(c_0_3992,plain,
( p__d__disjointDecomposition3(X1,X2,X3)
| ~ p__d__partition3(X1,X2,X3) ),
i_0_3517 ).
cnf(c_0_3993,plain,
( p__destination(X1,esk98_1(X1))
| ~ p__d__instance(X1,c__Translocation) ),
i_0_632 ).
cnf(c_0_3994,plain,
p__d__instance(X1,c__Translocation),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3984,c_0_3989]),c_0_3990])]) ).
cnf(c_0_3995,plain,
( p__d__disjoint(X1,X2)
| ~ p__d__partition3(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_3991,c_0_3992]) ).
cnf(c_0_3996,plain,
p__d__partition3(c__Physical,c__Object,c__Process),
i_0_117 ).
cnf(c_0_3997,plain,
( p__d__instance(X1,c__Process)
| ~ p__destination(X1,X2) ),
i_0_3968 ).
cnf(c_0_3998,plain,
p__destination(X1,esk98_1(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3993,c_0_3994])]) ).
cnf(c_0_3999,plain,
( p__d__instance(esk99_1(X1),c__Object)
| ~ p__d__instance(X1,c__Translocation) ),
i_0_635 ).
cnf(c_0_4000,plain,
( ~ p__d__instance(X1,X2)
| ~ p__d__instance(X1,X3)
| ~ p__d__disjoint(X3,X2) ),
i_0_3503 ).
cnf(c_0_4001,plain,
p__d__disjoint(c__Object,c__Process),
inference(spm,[status(thm)],[c_0_3995,c_0_3996]) ).
cnf(c_0_4002,plain,
p__d__instance(X1,c__Process),
inference(spm,[status(thm)],[c_0_3997,c_0_3998]) ).
cnf(c_0_4003,plain,
p__d__instance(esk99_1(X1),c__Object),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3999,c_0_3994])]) ).
cnf(c_0_4004,plain,
~ p__d__instance(X1,c__Object),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4000,c_0_4001]),c_0_4002])]) ).
cnf(c_0_4005,plain,
$false,
inference(sr,[status(thm)],[c_0_4003,c_0_4004]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : CSR162+1 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n017.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 : Sat Jun 11 17:56:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.38/0.60 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.38/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.38/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.38/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 23.25/5.94 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 23.25/5.94 # Version: 2.1pre011
% 23.25/5.94 # Preprocessing time : 0.110 s
% 23.25/5.94
% 23.25/5.94 # Proof found!
% 23.25/5.94 # SZS status Theorem
% 23.25/5.94 # SZS output start CNFRefutation
% See solution above
% 23.25/5.94 # Proof object total steps : 37
% 23.25/5.94 # Proof object clause steps : 24
% 23.25/5.94 # Proof object formula steps : 13
% 23.25/5.94 # Proof object conjectures : 5
% 23.25/5.94 # Proof object clause conjectures : 3
% 23.25/5.94 # Proof object formula conjectures : 2
% 23.25/5.94 # Proof object initial clauses used : 13
% 23.25/5.94 # Proof object initial formulas used : 13
% 23.25/5.94 # Proof object generating inferences : 8
% 23.25/5.94 # Proof object simplifying inferences : 12
% 23.25/5.94 # Training examples: 0 positive, 0 negative
% 23.25/5.94 # Parsed axioms : 4314
% 23.25/5.94 # Removed by relevancy pruning/SinE : 0
% 23.25/5.94 # Initial clauses : 4314
% 23.25/5.94 # Removed in clause preprocessing : 0
% 23.25/5.94 # Initial clauses in saturation : 4314
% 23.25/5.94 # Processed clauses : 5622
% 23.25/5.94 # ...of these trivial : 61
% 23.25/5.94 # ...subsumed : 37
% 23.25/5.94 # ...remaining for further processing : 5524
% 23.25/5.94 # Other redundant clauses eliminated : 7
% 23.25/5.94 # Clauses deleted for lack of memory : 0
% 23.25/5.94 # Backward-subsumed : 5
% 23.25/5.94 # Backward-rewritten : 228
% 23.25/5.94 # Generated clauses : 20642
% 23.25/5.94 # ...of the previous two non-trivial : 19959
% 23.25/5.94 # Contextual simplify-reflections : 1513
% 23.25/5.94 # Paramodulations : 20512
% 23.25/5.94 # Factorizations : 30
% 23.25/5.94 # Equation resolutions : 78
% 23.25/5.94 # Propositional unsat checks : 1
% 23.25/5.94 # Propositional unsat check successes : 0
% 23.25/5.94 # Current number of processed clauses : 5266
% 23.25/5.94 # Positive orientable unit clauses : 1313
% 23.25/5.94 # Positive unorientable unit clauses: 0
% 23.25/5.94 # Negative unit clauses : 87
% 23.25/5.94 # Non-unit-clauses : 3866
% 23.25/5.94 # Current number of unprocessed clauses: 16611
% 23.25/5.94 # ...number of literals in the above : 67784
% 23.25/5.94 # Current number of archived formulas : 0
% 23.25/5.94 # Current number of archived clauses : 255
% 23.25/5.94 # Clause-clause subsumption calls (NU) : 5137918
% 23.25/5.94 # Rec. Clause-clause subsumption calls : 2273176
% 23.25/5.94 # Non-unit clause-clause subsumptions : 1543
% 23.25/5.94 # Unit Clause-clause subsumption calls : 485391
% 23.25/5.94 # Rewrite failures with RHS unbound : 0
% 23.25/5.94 # BW rewrite match attempts : 68
% 23.25/5.94 # BW rewrite match successes : 67
% 23.25/5.94 # Condensation attempts : 0
% 23.25/5.94 # Condensation successes : 0
% 23.25/5.94 # Termbank termtop insertions : 487328
% 23.25/5.94
% 23.25/5.94 # -------------------------------------------------
% 23.25/5.94 # User time : 1.652 s
% 23.25/5.94 # System time : 0.037 s
% 23.25/5.94 # Total time : 1.689 s
% 23.25/5.94 # ...preprocessing : 0.110 s
% 23.25/5.94 # ...main loop : 1.579 s
% 23.25/5.94 # Maximum resident set size: 56748 pages
% 23.25/5.94
%------------------------------------------------------------------------------