%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+7 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:25 EDT 2022
% Result : Theorem 8.64s 2.82s
% Output : CNFRefutation 8.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 16 unt; 0 nHn; 32 RR)
% Number of literals : 87 ( 0 equ; 65 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-3 aty)
% Number of variables : 68 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_801,negated_conjecture,
( ~ agt(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ subs(X1,n374bernehmen_1_1)
| ~ sub(X7,name_1_1)
| ~ sub(X6,name_1_1)
| ~ val(X7,bmw_0)
| ~ val(X6,bmw_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jh2x83z5/input.p',i_0_801) ).
cnf(i_0_285,hypothesis,
val(c2007,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jh2x83z5/input.p',i_0_285) ).
cnf(i_0_286,hypothesis,
sub(c2007,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jh2x83z5/input.p',i_0_286) ).
cnf(i_0_289,hypothesis,
attr(c2006,c2007),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jh2x83z5/input.p',i_0_289) ).
cnf(i_0_322,plain,
( agt(X1,X2)
| ~ agt(X3,X2)
| ~ chea(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jh2x83z5/input.p',i_0_322) ).
cnf(i_0_331,plain,
( chea(esk14_3(X1,X2,X3),X1)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jh2x83z5/input.p',i_0_331) ).
cnf(i_0_330,plain,
( subs(esk14_3(X1,X2,X3),X3)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jh2x83z5/input.p',i_0_330) ).
cnf(i_0_506,plain,
chea(n374bernehmen_1_1,annahme_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jh2x83z5/input.p',i_0_506) ).
cnf(i_0_302,hypothesis,
agt(c1730,c2006),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jh2x83z5/input.p',i_0_302) ).
cnf(i_0_299,hypothesis,
subs(c1730,annahme_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jh2x83z5/input.p',i_0_299) ).
cnf(i_0_308,hypothesis,
attr(c1724,c1725),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jh2x83z5/input.p',i_0_308) ).
cnf(c_0_813,negated_conjecture,
( ~ agt(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ subs(X1,n374bernehmen_1_1)
| ~ sub(X7,name_1_1)
| ~ sub(X6,name_1_1)
| ~ val(X7,bmw_0)
| ~ val(X6,bmw_0) ),
i_0_801 ).
cnf(c_0_814,hypothesis,
val(c2007,bmw_0),
i_0_285 ).
cnf(c_0_815,hypothesis,
sub(c2007,name_1_1),
i_0_286 ).
cnf(c_0_816,negated_conjecture,
( ~ val(X1,bmw_0)
| ~ attr(X2,c2007)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ agt(X6,X2)
| ~ sub(X1,name_1_1)
| ~ subs(X6,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_813,c_0_814]),c_0_815])]) ).
cnf(c_0_817,hypothesis,
( ~ attr(X1,c2007)
| ~ attr(X2,c2007)
| ~ attr(X3,X4)
| ~ agt(X5,X1)
| ~ subs(X5,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_816,c_0_814]),c_0_815])]) ).
cnf(c_0_818,hypothesis,
attr(c2006,c2007),
i_0_289 ).
cnf(c_0_819,hypothesis,
( ~ attr(X1,c2007)
| ~ attr(X2,X3)
| ~ agt(X4,c2006)
| ~ subs(X4,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_817,c_0_818]) ).
cnf(c_0_820,plain,
( agt(X1,X2)
| ~ agt(X3,X2)
| ~ chea(X1,X3) ),
i_0_322 ).
cnf(c_0_821,plain,
( chea(esk14_3(X1,X2,X3),X1)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
i_0_331 ).
cnf(c_0_822,hypothesis,
( ~ attr(X1,X2)
| ~ agt(X3,c2006)
| ~ subs(X3,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_819,c_0_818]) ).
cnf(c_0_823,plain,
( agt(esk14_3(X1,X2,X3),X4)
| ~ chea(X3,X2)
| ~ agt(X1,X4)
| ~ subs(X1,X2) ),
inference(spm,[status(thm)],[c_0_820,c_0_821]) ).
cnf(c_0_824,hypothesis,
( ~ chea(X1,X2)
| ~ attr(X3,X4)
| ~ agt(X5,c2006)
| ~ subs(esk14_3(X5,X2,X1),n374bernehmen_1_1)
| ~ subs(X5,X2) ),
inference(spm,[status(thm)],[c_0_822,c_0_823]) ).
cnf(c_0_825,plain,
( subs(esk14_3(X1,X2,X3),X3)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
i_0_330 ).
cnf(c_0_826,plain,
( ~ chea(n374bernehmen_1_1,X1)
| ~ attr(X2,X3)
| ~ agt(X4,c2006)
| ~ subs(X4,X1) ),
inference(spm,[status(thm)],[c_0_824,c_0_825]) ).
cnf(c_0_827,plain,
chea(n374bernehmen_1_1,annahme_1_1),
i_0_506 ).
cnf(c_0_828,plain,
( ~ attr(X1,X2)
| ~ agt(X3,c2006)
| ~ subs(X3,annahme_1_1) ),
inference(spm,[status(thm)],[c_0_826,c_0_827]) ).
cnf(c_0_829,hypothesis,
agt(c1730,c2006),
i_0_302 ).
cnf(c_0_830,hypothesis,
subs(c1730,annahme_1_1),
i_0_299 ).
cnf(c_0_831,hypothesis,
attr(c1724,c1725),
i_0_308 ).
cnf(c_0_832,hypothesis,
~ attr(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_828,c_0_829]),c_0_830])]) ).
cnf(c_0_833,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_831,c_0_832]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR115+7 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 19:22:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.37/0.62 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.62 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.37/0.62 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.37/0.62 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.64/2.82 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.64/2.82 # Version: 2.1pre011
% 8.64/2.82 # Preprocessing time : 0.038 s
% 8.64/2.82
% 8.64/2.82 # Proof found!
% 8.64/2.82 # SZS status Theorem
% 8.64/2.82 # SZS output start CNFRefutation
% See solution above
% 8.64/2.82 # Proof object total steps : 32
% 8.64/2.82 # Proof object clause steps : 21
% 8.64/2.82 # Proof object formula steps : 11
% 8.64/2.82 # Proof object conjectures : 3
% 8.64/2.82 # Proof object clause conjectures : 2
% 8.64/2.82 # Proof object formula conjectures : 1
% 8.64/2.82 # Proof object initial clauses used : 11
% 8.64/2.82 # Proof object initial formulas used : 11
% 8.64/2.82 # Proof object generating inferences : 9
% 8.64/2.82 # Proof object simplifying inferences : 7
% 8.64/2.82 # Training examples: 0 positive, 0 negative
% 8.64/2.82 # Parsed axioms : 821
% 8.64/2.82 # Removed by relevancy pruning/SinE : 0
% 8.64/2.82 # Initial clauses : 821
% 8.64/2.82 # Removed in clause preprocessing : 0
% 8.64/2.82 # Initial clauses in saturation : 821
% 8.64/2.82 # Processed clauses : 1362
% 8.64/2.82 # ...of these trivial : 0
% 8.64/2.82 # ...subsumed : 78
% 8.64/2.82 # ...remaining for further processing : 1284
% 8.64/2.82 # Other redundant clauses eliminated : 0
% 8.64/2.82 # Clauses deleted for lack of memory : 0
% 8.64/2.82 # Backward-subsumed : 15
% 8.64/2.82 # Backward-rewritten : 0
% 8.64/2.82 # Generated clauses : 1723
% 8.64/2.82 # ...of the previous two non-trivial : 1703
% 8.64/2.82 # Contextual simplify-reflections : 16
% 8.64/2.82 # Paramodulations : 1719
% 8.64/2.82 # Factorizations : 0
% 8.64/2.82 # Equation resolutions : 0
% 8.64/2.82 # Propositional unsat checks : 0
% 8.64/2.82 # Propositional unsat check successes : 0
% 8.64/2.82 # Current number of processed clauses : 1265
% 8.64/2.82 # Positive orientable unit clauses : 583
% 8.64/2.82 # Positive unorientable unit clauses: 0
% 8.64/2.82 # Negative unit clauses : 2
% 8.64/2.82 # Non-unit-clauses : 680
% 8.64/2.82 # Current number of unprocessed clauses: 1092
% 8.64/2.82 # ...number of literals in the above : 4166
% 8.64/2.82 # Current number of archived formulas : 0
% 8.64/2.82 # Current number of archived clauses : 19
% 8.64/2.82 # Clause-clause subsumption calls (NU) : 150131
% 8.64/2.82 # Rec. Clause-clause subsumption calls : 22809
% 8.64/2.82 # Non-unit clause-clause subsumptions : 102
% 8.64/2.82 # Unit Clause-clause subsumption calls : 5118
% 8.64/2.82 # Rewrite failures with RHS unbound : 0
% 8.64/2.82 # BW rewrite match attempts : 2
% 8.64/2.82 # BW rewrite match successes : 0
% 8.64/2.82 # Condensation attempts : 0
% 8.64/2.82 # Condensation successes : 0
% 8.64/2.82 # Termbank termtop insertions : 45170
% 8.64/2.82
% 8.64/2.82 # -------------------------------------------------
% 8.64/2.82 # User time : 0.131 s
% 8.64/2.82 # System time : 0.009 s
% 8.64/2.82 # Total time : 0.140 s
% 8.64/2.82 # ...preprocessing : 0.038 s
% 8.64/2.82 # ...main loop : 0.103 s
% 8.64/2.82 # Maximum resident set size: 11028 pages
% 8.64/2.82
%------------------------------------------------------------------------------