%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+78 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:24 EDT 2022
% Result : Theorem 6.96s 2.75s
% Output : CNFRefutation 6.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 13 unt; 0 nHn; 18 RR)
% Number of literals : 34 ( 0 equ; 21 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 23 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_798,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ sub(X2,firma_1_1)
| ~ sub(X6,name_1_1)
| ~ val(X6,bmw_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fvhe9mxc/input.p',i_0_798) ).
cnf(i_0_310,hypothesis,
val(c4653,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fvhe9mxc/input.p',i_0_310) ).
cnf(i_0_311,hypothesis,
sub(c4653,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fvhe9mxc/input.p',i_0_311) ).
cnf(i_0_313,hypothesis,
attr(c4652,c4653),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fvhe9mxc/input.p',i_0_313) ).
cnf(i_0_289,hypothesis,
attr(c5557,c5570),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fvhe9mxc/input.p',i_0_289) ).
cnf(i_0_294,hypothesis,
obj(c5513,c5557),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fvhe9mxc/input.p',i_0_294) ).
cnf(i_0_288,hypothesis,
sub(c5557,firma_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fvhe9mxc/input.p',i_0_288) ).
cnf(c_0_806,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ sub(X2,firma_1_1)
| ~ sub(X6,name_1_1)
| ~ val(X6,bmw_0) ),
i_0_798 ).
cnf(c_0_807,hypothesis,
val(c4653,bmw_0),
i_0_310 ).
cnf(c_0_808,hypothesis,
sub(c4653,name_1_1),
i_0_311 ).
cnf(c_0_809,negated_conjecture,
( ~ attr(X1,c4653)
| ~ attr(X2,X3)
| ~ obj(X4,X5)
| ~ sub(X5,firma_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_806,c_0_807]),c_0_808])]) ).
cnf(c_0_810,hypothesis,
attr(c4652,c4653),
i_0_313 ).
cnf(c_0_811,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,X4)
| ~ sub(X4,firma_1_1) ),
inference(spm,[status(thm)],[c_0_809,c_0_810]) ).
cnf(c_0_812,hypothesis,
attr(c5557,c5570),
i_0_289 ).
cnf(c_0_813,hypothesis,
( ~ obj(X1,X2)
| ~ sub(X2,firma_1_1) ),
inference(spm,[status(thm)],[c_0_811,c_0_812]) ).
cnf(c_0_814,hypothesis,
obj(c5513,c5557),
i_0_294 ).
cnf(c_0_815,hypothesis,
sub(c5557,firma_1_1),
i_0_288 ).
cnf(c_0_816,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_813,c_0_814]),c_0_815])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR115+78 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n019.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 9 17:46:11 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.43/0.62 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.43/0.62 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.43/0.62 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.43/0.62 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.96/2.75 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.96/2.75 # Version: 2.1pre011
% 6.96/2.75 # Preprocessing time : 0.023 s
% 6.96/2.75
% 6.96/2.75 # Proof found!
% 6.96/2.75 # SZS status Theorem
% 6.96/2.75 # SZS output start CNFRefutation
% See solution above
% 6.96/2.75 # Proof object total steps : 18
% 6.96/2.75 # Proof object clause steps : 11
% 6.96/2.75 # Proof object formula steps : 7
% 6.96/2.75 # Proof object conjectures : 3
% 6.96/2.75 # Proof object clause conjectures : 2
% 6.96/2.75 # Proof object formula conjectures : 1
% 6.96/2.75 # Proof object initial clauses used : 7
% 6.96/2.75 # Proof object initial formulas used : 7
% 6.96/2.75 # Proof object generating inferences : 4
% 6.96/2.75 # Proof object simplifying inferences : 4
% 6.96/2.75 # Training examples: 0 positive, 0 negative
% 6.96/2.75 # Parsed axioms : 818
% 6.96/2.75 # Removed by relevancy pruning/SinE : 0
% 6.96/2.75 # Initial clauses : 818
% 6.96/2.75 # Removed in clause preprocessing : 0
% 6.96/2.75 # Initial clauses in saturation : 818
% 6.96/2.75 # Processed clauses : 825
% 6.96/2.75 # ...of these trivial : 0
% 6.96/2.75 # ...subsumed : 0
% 6.96/2.75 # ...remaining for further processing : 825
% 6.96/2.75 # Other redundant clauses eliminated : 0
% 6.96/2.75 # Clauses deleted for lack of memory : 0
% 6.96/2.75 # Backward-subsumed : 4
% 6.96/2.75 # Backward-rewritten : 0
% 6.96/2.75 # Generated clauses : 1663
% 6.96/2.75 # ...of the previous two non-trivial : 1662
% 6.96/2.75 # Contextual simplify-reflections : 1
% 6.96/2.75 # Paramodulations : 1663
% 6.96/2.75 # Factorizations : 0
% 6.96/2.75 # Equation resolutions : 0
% 6.96/2.75 # Propositional unsat checks : 0
% 6.96/2.75 # Propositional unsat check successes : 0
% 6.96/2.75 # Current number of processed clauses : 821
% 6.96/2.75 # Positive orientable unit clauses : 512
% 6.96/2.75 # Positive unorientable unit clauses: 0
% 6.96/2.75 # Negative unit clauses : 0
% 6.96/2.75 # Non-unit-clauses : 309
% 6.96/2.75 # Current number of unprocessed clauses: 1626
% 6.96/2.75 # ...number of literals in the above : 4924
% 6.96/2.75 # Current number of archived formulas : 0
% 6.96/2.75 # Current number of archived clauses : 4
% 6.96/2.75 # Clause-clause subsumption calls (NU) : 35319
% 6.96/2.75 # Rec. Clause-clause subsumption calls : 12297
% 6.96/2.75 # Non-unit clause-clause subsumptions : 5
% 6.96/2.75 # Unit Clause-clause subsumption calls : 2582
% 6.96/2.75 # Rewrite failures with RHS unbound : 0
% 6.96/2.75 # BW rewrite match attempts : 0
% 6.96/2.75 # BW rewrite match successes : 0
% 6.96/2.75 # Condensation attempts : 0
% 6.96/2.75 # Condensation successes : 0
% 6.96/2.75 # Termbank termtop insertions : 32597
% 6.96/2.75
% 6.96/2.75 # -------------------------------------------------
% 6.96/2.75 # User time : 0.052 s
% 6.96/2.75 # System time : 0.008 s
% 6.96/2.75 # Total time : 0.059 s
% 6.96/2.75 # ...preprocessing : 0.023 s
% 6.96/2.75 # ...main loop : 0.037 s
% 6.96/2.75 # Maximum resident set size: 9972 pages
% 6.96/2.75
%------------------------------------------------------------------------------