%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+50 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:19 EDT 2022
% Result : Theorem 8.34s 2.75s
% Output : CNFRefutation 8.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 16 unt; 0 nHn; 25 RR)
% Number of literals : 48 ( 0 equ; 31 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-3 aty)
% Number of variables : 39 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_718,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ subs(X5,n374bernehmen_1_1)
| ~ sub(X6,firma_1_1)
| ~ sub(X4,name_1_1)
| ~ val(X4,bmw_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ouqu5kf/input.p',i_0_718) ).
cnf(i_0_216,hypothesis,
val(c74,bmw_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ouqu5kf/input.p',i_0_216) ).
cnf(i_0_217,hypothesis,
sub(c74,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ouqu5kf/input.p',i_0_217) ).
cnf(i_0_219,hypothesis,
attr(c73,c74),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ouqu5kf/input.p',i_0_219) ).
cnf(i_0_218,hypothesis,
sub(c73,firma_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ouqu5kf/input.p',i_0_218) ).
cnf(i_0_251,plain,
( subs(esk14_3(X1,X2,X3),X3)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ouqu5kf/input.p',i_0_251) ).
cnf(i_0_427,plain,
chea(n374bernehmen_1_1,annahme_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ouqu5kf/input.p',i_0_427) ).
cnf(i_0_225,hypothesis,
subs(c25,annahme_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ouqu5kf/input.p',i_0_225) ).
cnf(i_0_230,hypothesis,
attr(c18,c19),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0ouqu5kf/input.p',i_0_230) ).
cnf(c_0_728,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ subs(X5,n374bernehmen_1_1)
| ~ sub(X6,firma_1_1)
| ~ sub(X4,name_1_1)
| ~ val(X4,bmw_0) ),
i_0_718 ).
cnf(c_0_729,hypothesis,
val(c74,bmw_0),
i_0_216 ).
cnf(c_0_730,hypothesis,
sub(c74,name_1_1),
i_0_217 ).
cnf(c_0_731,negated_conjecture,
( ~ attr(X1,c74)
| ~ attr(X2,X3)
| ~ sub(X4,firma_1_1)
| ~ subs(X5,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_728,c_0_729]),c_0_730])]) ).
cnf(c_0_732,hypothesis,
attr(c73,c74),
i_0_219 ).
cnf(c_0_733,hypothesis,
( ~ attr(X1,X2)
| ~ sub(X3,firma_1_1)
| ~ subs(X4,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_731,c_0_732]) ).
cnf(c_0_734,hypothesis,
sub(c73,firma_1_1),
i_0_218 ).
cnf(c_0_735,hypothesis,
( ~ attr(X1,X2)
| ~ subs(X3,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_733,c_0_734]) ).
cnf(c_0_736,plain,
( subs(esk14_3(X1,X2,X3),X3)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
i_0_251 ).
cnf(c_0_737,plain,
( ~ chea(n374bernehmen_1_1,X1)
| ~ attr(X2,X3)
| ~ subs(X4,X1) ),
inference(spm,[status(thm)],[c_0_735,c_0_736]) ).
cnf(c_0_738,plain,
chea(n374bernehmen_1_1,annahme_1_1),
i_0_427 ).
cnf(c_0_739,plain,
( ~ attr(X1,X2)
| ~ subs(X3,annahme_1_1) ),
inference(spm,[status(thm)],[c_0_737,c_0_738]) ).
cnf(c_0_740,hypothesis,
subs(c25,annahme_1_1),
i_0_225 ).
cnf(c_0_741,hypothesis,
attr(c18,c19),
i_0_230 ).
cnf(c_0_742,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_739,c_0_740]) ).
cnf(c_0_743,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_741,c_0_742]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR115+50 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 11 04:16:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.40/0.58 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.58 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.40/0.58 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.40/0.58 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.34/2.75 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.34/2.75 # Version: 2.1pre011
% 8.34/2.75 # Preprocessing time : 0.021 s
% 8.34/2.75
% 8.34/2.75 # Proof found!
% 8.34/2.75 # SZS status Theorem
% 8.34/2.75 # SZS output start CNFRefutation
% See solution above
% 8.34/2.75 # Proof object total steps : 25
% 8.34/2.75 # Proof object clause steps : 16
% 8.34/2.75 # Proof object formula steps : 9
% 8.34/2.75 # Proof object conjectures : 3
% 8.34/2.75 # Proof object clause conjectures : 2
% 8.34/2.75 # Proof object formula conjectures : 1
% 8.34/2.75 # Proof object initial clauses used : 9
% 8.34/2.75 # Proof object initial formulas used : 9
% 8.34/2.75 # Proof object generating inferences : 6
% 8.34/2.75 # Proof object simplifying inferences : 3
% 8.34/2.75 # Training examples: 0 positive, 0 negative
% 8.34/2.75 # Parsed axioms : 738
% 8.34/2.75 # Removed by relevancy pruning/SinE : 0
% 8.34/2.75 # Initial clauses : 738
% 8.34/2.75 # Removed in clause preprocessing : 0
% 8.34/2.75 # Initial clauses in saturation : 738
% 8.34/2.75 # Processed clauses : 762
% 8.34/2.75 # ...of these trivial : 0
% 8.34/2.75 # ...subsumed : 0
% 8.34/2.75 # ...remaining for further processing : 762
% 8.34/2.75 # Other redundant clauses eliminated : 0
% 8.34/2.75 # Clauses deleted for lack of memory : 0
% 8.34/2.75 # Backward-subsumed : 3
% 8.34/2.75 # Backward-rewritten : 0
% 8.34/2.75 # Generated clauses : 1726
% 8.34/2.75 # ...of the previous two non-trivial : 1718
% 8.34/2.75 # Contextual simplify-reflections : 0
% 8.34/2.75 # Paramodulations : 1722
% 8.34/2.75 # Factorizations : 0
% 8.34/2.75 # Equation resolutions : 0
% 8.34/2.75 # Propositional unsat checks : 0
% 8.34/2.75 # Propositional unsat check successes : 0
% 8.34/2.75 # Current number of processed clauses : 755
% 8.34/2.75 # Positive orientable unit clauses : 431
% 8.34/2.75 # Positive unorientable unit clauses: 0
% 8.34/2.75 # Negative unit clauses : 1
% 8.34/2.75 # Non-unit-clauses : 323
% 8.34/2.75 # Current number of unprocessed clauses: 1688
% 8.34/2.75 # ...number of literals in the above : 5480
% 8.34/2.75 # Current number of archived formulas : 0
% 8.34/2.75 # Current number of archived clauses : 7
% 8.34/2.75 # Clause-clause subsumption calls (NU) : 29249
% 8.34/2.75 # Rec. Clause-clause subsumption calls : 9969
% 8.34/2.75 # Non-unit clause-clause subsumptions : 3
% 8.34/2.75 # Unit Clause-clause subsumption calls : 1380
% 8.34/2.75 # Rewrite failures with RHS unbound : 0
% 8.34/2.75 # BW rewrite match attempts : 0
% 8.34/2.75 # BW rewrite match successes : 0
% 8.34/2.75 # Condensation attempts : 0
% 8.34/2.75 # Condensation successes : 0
% 8.34/2.75 # Termbank termtop insertions : 32965
% 8.34/2.75
% 8.34/2.75 # -------------------------------------------------
% 8.34/2.75 # User time : 0.047 s
% 8.34/2.75 # System time : 0.008 s
% 8.34/2.75 # Total time : 0.055 s
% 8.34/2.75 # ...preprocessing : 0.021 s
% 8.34/2.75 # ...main loop : 0.033 s
% 8.34/2.75 # Maximum resident set size: 9572 pages
% 8.34/2.75
%------------------------------------------------------------------------------