%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+83 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:26 EDT 2022
% Result : Theorem 9.49s 2.98s
% Output : CNFRefutation 9.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of clauses : 45 ( 23 unt; 0 nHn; 45 RR)
% Number of literals : 143 ( 0 equ; 111 neg)
% Maximal clause size : 13 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 13 con; 0-3 aty)
% Number of variables : 84 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_753,negated_conjecture,
( ~ agt(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ val(X4,X8)
| ~ subs(X1,n374bernehmen_1_1)
| ~ sub(X4,jahr__1_1)
| ~ sub(X7,name_1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X5,firma_1_1)
| ~ val(X7,bmw_0)
| ~ val(X6,bmw_0)
| ~ has_card_leq(X8,int1994) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_753) ).
cnf(i_0_575,plain,
( has_card_leq(X1,X2)
| ~ card(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_575) ).
cnf(i_0_130,hypothesis,
card(c1744,int1994),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_130) ).
cnf(i_0_235,hypothesis,
val(c1798,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_235) ).
cnf(i_0_236,hypothesis,
sub(c1798,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_236) ).
cnf(i_0_252,hypothesis,
val(c1748,c1744),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_252) ).
cnf(i_0_253,hypothesis,
sub(c1748,jahr__1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_253) ).
cnf(i_0_238,hypothesis,
attr(c1797,c1798),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_238) ).
cnf(i_0_237,hypothesis,
sub(c1797,firma_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_237) ).
cnf(i_0_254,hypothesis,
attr(c1747,c1748),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_254) ).
cnf(i_0_274,plain,
( agt(X1,X2)
| ~ agt(X3,X2)
| ~ chea(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_274) ).
cnf(i_0_283,plain,
( chea(esk14_3(X1,X2,X3),X1)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_283) ).
cnf(i_0_282,plain,
( subs(esk14_3(X1,X2,X3),X3)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_282) ).
cnf(i_0_461,plain,
chea(n374bernehmen_1_1,annahme_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_461) ).
cnf(i_0_251,hypothesis,
agt(c1750,c1797),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_251) ).
cnf(i_0_248,hypothesis,
subs(c1750,annahme_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6tbg0kfz/input.p',i_0_248) ).
cnf(c_0_770,negated_conjecture,
( ~ agt(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ val(X4,X8)
| ~ subs(X1,n374bernehmen_1_1)
| ~ sub(X4,jahr__1_1)
| ~ sub(X7,name_1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X5,firma_1_1)
| ~ val(X7,bmw_0)
| ~ val(X6,bmw_0)
| ~ has_card_leq(X8,int1994) ),
i_0_753 ).
cnf(c_0_771,plain,
( has_card_leq(X1,X2)
| ~ card(X1,X2) ),
i_0_575 ).
cnf(c_0_772,plain,
( ~ card(X1,int1994)
| ~ val(X2,bmw_0)
| ~ val(X3,bmw_0)
| ~ val(X4,X1)
| ~ attr(X5,X3)
| ~ attr(X6,X4)
| ~ attr(X7,X2)
| ~ agt(X8,X7)
| ~ sub(X2,name_1_1)
| ~ sub(X3,name_1_1)
| ~ sub(X5,firma_1_1)
| ~ sub(X4,jahr__1_1)
| ~ subs(X8,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_770,c_0_771]) ).
cnf(c_0_773,hypothesis,
card(c1744,int1994),
i_0_130 ).
cnf(c_0_774,hypothesis,
( ~ val(X1,bmw_0)
| ~ val(X2,bmw_0)
| ~ val(X3,c1744)
| ~ attr(X4,X2)
| ~ attr(X5,X3)
| ~ attr(X6,X1)
| ~ agt(X7,X6)
| ~ sub(X1,name_1_1)
| ~ sub(X2,name_1_1)
| ~ sub(X4,firma_1_1)
| ~ sub(X3,jahr__1_1)
| ~ subs(X7,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_772,c_0_773]) ).
cnf(c_0_775,hypothesis,
val(c1798,bmw_0),
i_0_235 ).
cnf(c_0_776,hypothesis,
sub(c1798,name_1_1),
i_0_236 ).
cnf(c_0_777,hypothesis,
( ~ val(X1,bmw_0)
| ~ val(X2,c1744)
| ~ attr(X3,c1798)
| ~ attr(X4,X1)
| ~ attr(X5,X2)
| ~ agt(X6,X3)
| ~ sub(X1,name_1_1)
| ~ sub(X4,firma_1_1)
| ~ sub(X2,jahr__1_1)
| ~ subs(X6,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_774,c_0_775]),c_0_776])]) ).
cnf(c_0_778,hypothesis,
( ~ val(X1,c1744)
| ~ attr(X2,c1798)
| ~ attr(X3,c1798)
| ~ attr(X4,X1)
| ~ agt(X5,X2)
| ~ sub(X3,firma_1_1)
| ~ sub(X1,jahr__1_1)
| ~ subs(X5,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_777,c_0_775]),c_0_776])]) ).
cnf(c_0_779,hypothesis,
val(c1748,c1744),
i_0_252 ).
cnf(c_0_780,hypothesis,
sub(c1748,jahr__1_1),
i_0_253 ).
cnf(c_0_781,hypothesis,
( ~ attr(X1,c1798)
| ~ attr(X2,c1798)
| ~ attr(X3,c1748)
| ~ agt(X4,X1)
| ~ sub(X2,firma_1_1)
| ~ subs(X4,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_778,c_0_779]),c_0_780])]) ).
cnf(c_0_782,hypothesis,
attr(c1797,c1798),
i_0_238 ).
cnf(c_0_783,hypothesis,
( ~ attr(X1,c1798)
| ~ attr(X2,c1748)
| ~ agt(X3,c1797)
| ~ sub(X1,firma_1_1)
| ~ subs(X3,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_781,c_0_782]) ).
cnf(c_0_784,hypothesis,
sub(c1797,firma_1_1),
i_0_237 ).
cnf(c_0_785,hypothesis,
( ~ attr(X1,c1748)
| ~ agt(X2,c1797)
| ~ subs(X2,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_783,c_0_782]),c_0_784])]) ).
cnf(c_0_786,hypothesis,
attr(c1747,c1748),
i_0_254 ).
cnf(c_0_787,plain,
( agt(X1,X2)
| ~ agt(X3,X2)
| ~ chea(X1,X3) ),
i_0_274 ).
cnf(c_0_788,plain,
( chea(esk14_3(X1,X2,X3),X1)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
i_0_283 ).
cnf(c_0_789,hypothesis,
( ~ agt(X1,c1797)
| ~ subs(X1,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_785,c_0_786]) ).
cnf(c_0_790,plain,
( agt(esk14_3(X1,X2,X3),X4)
| ~ chea(X3,X2)
| ~ agt(X1,X4)
| ~ subs(X1,X2) ),
inference(spm,[status(thm)],[c_0_787,c_0_788]) ).
cnf(c_0_791,hypothesis,
( ~ chea(X1,X2)
| ~ agt(X3,c1797)
| ~ subs(esk14_3(X3,X2,X1),n374bernehmen_1_1)
| ~ subs(X3,X2) ),
inference(spm,[status(thm)],[c_0_789,c_0_790]) ).
cnf(c_0_792,plain,
( subs(esk14_3(X1,X2,X3),X3)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
i_0_282 ).
cnf(c_0_793,plain,
( ~ chea(n374bernehmen_1_1,X1)
| ~ agt(X2,c1797)
| ~ subs(X2,X1) ),
inference(spm,[status(thm)],[c_0_791,c_0_792]) ).
cnf(c_0_794,plain,
chea(n374bernehmen_1_1,annahme_1_1),
i_0_461 ).
cnf(c_0_795,plain,
( ~ agt(X1,c1797)
| ~ subs(X1,annahme_1_1) ),
inference(spm,[status(thm)],[c_0_793,c_0_794]) ).
cnf(c_0_796,hypothesis,
agt(c1750,c1797),
i_0_251 ).
cnf(c_0_797,hypothesis,
subs(c1750,annahme_1_1),
i_0_248 ).
cnf(c_0_798,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_795,c_0_796]),c_0_797])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR115+83 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n021.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 : Fri Jun 10 18:24:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.42/0.60 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.42/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.42/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.49/2.98 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 9.49/2.98 # Version: 2.1pre011
% 9.49/2.98 # Preprocessing time : 0.039 s
% 9.49/2.98
% 9.49/2.98 # Proof found!
% 9.49/2.98 # SZS status Theorem
% 9.49/2.98 # SZS output start CNFRefutation
% See solution above
% 9.49/2.98 # Proof object total steps : 45
% 9.49/2.98 # Proof object clause steps : 29
% 9.49/2.98 # Proof object formula steps : 16
% 9.49/2.98 # Proof object conjectures : 2
% 9.49/2.98 # Proof object clause conjectures : 1
% 9.49/2.98 # Proof object formula conjectures : 1
% 9.49/2.98 # Proof object initial clauses used : 16
% 9.49/2.98 # Proof object initial formulas used : 16
% 9.49/2.98 # Proof object generating inferences : 13
% 9.49/2.98 # Proof object simplifying inferences : 10
% 9.49/2.98 # Training examples: 0 positive, 0 negative
% 9.49/2.98 # Parsed axioms : 773
% 9.49/2.98 # Removed by relevancy pruning/SinE : 0
% 9.49/2.98 # Initial clauses : 773
% 9.49/2.98 # Removed in clause preprocessing : 0
% 9.49/2.98 # Initial clauses in saturation : 773
% 9.49/2.98 # Processed clauses : 1350
% 9.49/2.98 # ...of these trivial : 0
% 9.49/2.98 # ...subsumed : 117
% 9.49/2.98 # ...remaining for further processing : 1233
% 9.49/2.98 # Other redundant clauses eliminated : 0
% 9.49/2.98 # Clauses deleted for lack of memory : 0
% 9.49/2.98 # Backward-subsumed : 15
% 9.49/2.98 # Backward-rewritten : 0
% 9.49/2.98 # Generated clauses : 1869
% 9.49/2.98 # ...of the previous two non-trivial : 1847
% 9.49/2.98 # Contextual simplify-reflections : 132
% 9.49/2.98 # Paramodulations : 1869
% 9.49/2.98 # Factorizations : 0
% 9.49/2.98 # Equation resolutions : 0
% 9.49/2.98 # Propositional unsat checks : 0
% 9.49/2.98 # Propositional unsat check successes : 0
% 9.49/2.98 # Current number of processed clauses : 1218
% 9.49/2.98 # Positive orientable unit clauses : 520
% 9.49/2.98 # Positive unorientable unit clauses: 0
% 9.49/2.98 # Negative unit clauses : 1
% 9.49/2.98 # Non-unit-clauses : 697
% 9.49/2.98 # Current number of unprocessed clauses: 1240
% 9.49/2.98 # ...number of literals in the above : 4672
% 9.49/2.98 # Current number of archived formulas : 0
% 9.49/2.98 # Current number of archived clauses : 15
% 9.49/2.98 # Clause-clause subsumption calls (NU) : 244708
% 9.49/2.98 # Rec. Clause-clause subsumption calls : 19660
% 9.49/2.98 # Non-unit clause-clause subsumptions : 261
% 9.49/2.98 # Unit Clause-clause subsumption calls : 4315
% 9.49/2.98 # Rewrite failures with RHS unbound : 0
% 9.49/2.98 # BW rewrite match attempts : 4
% 9.49/2.98 # BW rewrite match successes : 3
% 9.49/2.98 # Condensation attempts : 0
% 9.49/2.98 # Condensation successes : 0
% 9.49/2.98 # Termbank termtop insertions : 51166
% 9.49/2.98
% 9.49/2.98 # -------------------------------------------------
% 9.49/2.98 # User time : 0.162 s
% 9.49/2.98 # System time : 0.011 s
% 9.49/2.98 # Total time : 0.174 s
% 9.49/2.98 # ...preprocessing : 0.039 s
% 9.49/2.98 # ...main loop : 0.135 s
% 9.49/2.98 # Maximum resident set size: 11292 pages
% 9.49/2.98
%------------------------------------------------------------------------------