%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+43 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:18 EDT 2022
% Result : Theorem 8.63s 2.52s
% Output : CNFRefutation 8.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 16 unt; 0 nHn; 32 RR)
% Number of literals : 77 ( 0 equ; 56 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-3 aty)
% Number of variables : 65 ( 40 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_739,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ sub(X6,name_1_1)
| ~ sub(X7,name_1_1)
| ~ val(X6,bmw_0)
| ~ val(X7,bmw_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cxm5sd7d/input.p',i_0_739) ).
cnf(i_0_236,hypothesis,
val(c374,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cxm5sd7d/input.p',i_0_236) ).
cnf(i_0_237,hypothesis,
sub(c374,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cxm5sd7d/input.p',i_0_237) ).
cnf(i_0_240,hypothesis,
attr(c373,c374),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cxm5sd7d/input.p',i_0_240) ).
cnf(i_0_598,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cxm5sd7d/input.p',i_0_598) ).
cnf(i_0_565,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cxm5sd7d/input.p',i_0_565) ).
cnf(i_0_118,hypothesis,
fact(c373,real),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cxm5sd7d/input.p',i_0_118) ).
cnf(i_0_697,plain,
( loc(X1,esk50_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cxm5sd7d/input.p',i_0_697) ).
cnf(i_0_239,hypothesis,
prop(c373,bundesdeutsch_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cxm5sd7d/input.p',i_0_239) ).
cnf(i_0_500,plain,
state_adjective_state_binding(bundesdeutsch_1_1,bundesrepublik_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cxm5sd7d/input.p',i_0_500) ).
cnf(i_0_250,hypothesis,
attr(c18,c19),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cxm5sd7d/input.p',i_0_250) ).
cnf(c_0_751,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ sub(X6,name_1_1)
| ~ sub(X7,name_1_1)
| ~ val(X6,bmw_0)
| ~ val(X7,bmw_0) ),
i_0_739 ).
cnf(c_0_752,hypothesis,
val(c374,bmw_0),
i_0_236 ).
cnf(c_0_753,hypothesis,
sub(c374,name_1_1),
i_0_237 ).
cnf(c_0_754,negated_conjecture,
( ~ obj(X1,X2)
| ~ val(X3,bmw_0)
| ~ attr(X2,c374)
| ~ attr(X4,X3)
| ~ attr(X5,X6)
| ~ sub(X3,name_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_751,c_0_752]),c_0_753])]) ).
cnf(c_0_755,hypothesis,
( ~ obj(X1,X2)
| ~ attr(X2,c374)
| ~ attr(X3,c374)
| ~ attr(X4,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_754,c_0_752]),c_0_753])]) ).
cnf(c_0_756,hypothesis,
attr(c373,c374),
i_0_240 ).
cnf(c_0_757,hypothesis,
( ~ obj(X1,c373)
| ~ attr(X2,c374)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_755,c_0_756]) ).
cnf(c_0_758,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
i_0_598 ).
cnf(c_0_759,plain,
( ~ loc(c373,X1)
| ~ has_fact_leq(c373,real)
| ~ attr(X2,c374)
| ~ attr(X3,X4) ),
inference(spm,[status(thm)],[c_0_757,c_0_758]) ).
cnf(c_0_760,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
i_0_565 ).
cnf(c_0_761,hypothesis,
fact(c373,real),
i_0_118 ).
cnf(c_0_762,plain,
( ~ loc(c373,X1)
| ~ attr(X2,c374)
| ~ attr(X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_759,c_0_760]),c_0_761])]) ).
cnf(c_0_763,plain,
( loc(X1,esk50_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
i_0_697 ).
cnf(c_0_764,plain,
( ~ state_adjective_state_binding(X1,X2)
| ~ attr(X3,c374)
| ~ attr(X4,X5)
| ~ prop(c373,X1) ),
inference(spm,[status(thm)],[c_0_762,c_0_763]) ).
cnf(c_0_765,hypothesis,
( ~ state_adjective_state_binding(X1,X2)
| ~ attr(X3,X4)
| ~ prop(c373,X1) ),
inference(spm,[status(thm)],[c_0_764,c_0_756]) ).
cnf(c_0_766,hypothesis,
prop(c373,bundesdeutsch_1_1),
i_0_239 ).
cnf(c_0_767,hypothesis,
( ~ state_adjective_state_binding(bundesdeutsch_1_1,X1)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_765,c_0_766]) ).
cnf(c_0_768,plain,
state_adjective_state_binding(bundesdeutsch_1_1,bundesrepublik_0),
i_0_500 ).
cnf(c_0_769,hypothesis,
attr(c18,c19),
i_0_250 ).
cnf(c_0_770,plain,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_767,c_0_768]) ).
cnf(c_0_771,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_769,c_0_770]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : CSR115+43 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.08 % Command : enigmatic-eprover.py %s %d 1
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Sat Jun 11 03:01:26 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.11/0.33 # ENIGMATIC: Selected SinE mode:
% 0.11/0.43 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.43 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.11/0.43 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.11/0.43 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.63/2.52 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.63/2.52 # Version: 2.1pre011
% 8.63/2.52 # Preprocessing time : 0.020 s
% 8.63/2.52
% 8.63/2.52 # Proof found!
% 8.63/2.52 # SZS status Theorem
% 8.63/2.52 # SZS output start CNFRefutation
% See solution above
% 8.63/2.52 # Proof object total steps : 32
% 8.63/2.52 # Proof object clause steps : 21
% 8.63/2.52 # Proof object formula steps : 11
% 8.63/2.52 # Proof object conjectures : 3
% 8.63/2.52 # Proof object clause conjectures : 2
% 8.63/2.52 # Proof object formula conjectures : 1
% 8.63/2.52 # Proof object initial clauses used : 11
% 8.63/2.52 # Proof object initial formulas used : 11
% 8.63/2.52 # Proof object generating inferences : 9
% 8.63/2.52 # Proof object simplifying inferences : 7
% 8.63/2.52 # Training examples: 0 positive, 0 negative
% 8.63/2.52 # Parsed axioms : 759
% 8.63/2.52 # Removed by relevancy pruning/SinE : 0
% 8.63/2.52 # Initial clauses : 759
% 8.63/2.52 # Removed in clause preprocessing : 0
% 8.63/2.52 # Initial clauses in saturation : 759
% 8.63/2.52 # Processed clauses : 798
% 8.63/2.52 # ...of these trivial : 0
% 8.63/2.52 # ...subsumed : 1
% 8.63/2.52 # ...remaining for further processing : 797
% 8.63/2.52 # Other redundant clauses eliminated : 0
% 8.63/2.52 # Clauses deleted for lack of memory : 0
% 8.63/2.52 # Backward-subsumed : 5
% 8.63/2.52 # Backward-rewritten : 0
% 8.63/2.52 # Generated clauses : 708
% 8.63/2.52 # ...of the previous two non-trivial : 699
% 8.63/2.52 # Contextual simplify-reflections : 7
% 8.63/2.52 # Paramodulations : 703
% 8.63/2.52 # Factorizations : 0
% 8.63/2.52 # Equation resolutions : 0
% 8.63/2.52 # Propositional unsat checks : 0
% 8.63/2.52 # Propositional unsat check successes : 0
% 8.63/2.52 # Current number of processed clauses : 787
% 8.63/2.52 # Positive orientable unit clauses : 454
% 8.63/2.52 # Positive unorientable unit clauses: 0
% 8.63/2.52 # Negative unit clauses : 1
% 8.63/2.52 # Non-unit-clauses : 332
% 8.63/2.52 # Current number of unprocessed clauses: 659
% 8.63/2.52 # ...number of literals in the above : 2830
% 8.63/2.52 # Current number of archived formulas : 0
% 8.63/2.52 # Current number of archived clauses : 10
% 8.63/2.52 # Clause-clause subsumption calls (NU) : 34069
% 8.63/2.52 # Rec. Clause-clause subsumption calls : 12175
% 8.63/2.52 # Non-unit clause-clause subsumptions : 13
% 8.63/2.52 # Unit Clause-clause subsumption calls : 1061
% 8.63/2.52 # Rewrite failures with RHS unbound : 0
% 8.63/2.52 # BW rewrite match attempts : 0
% 8.63/2.52 # BW rewrite match successes : 0
% 8.63/2.52 # Condensation attempts : 0
% 8.63/2.52 # Condensation successes : 0
% 8.63/2.52 # Termbank termtop insertions : 24245
% 8.63/2.52
% 8.63/2.52 # -------------------------------------------------
% 8.63/2.52 # User time : 0.046 s
% 8.63/2.52 # System time : 0.007 s
% 8.63/2.52 # Total time : 0.053 s
% 8.63/2.52 # ...preprocessing : 0.020 s
% 8.63/2.52 # ...main loop : 0.032 s
% 8.63/2.52 # Maximum resident set size: 8916 pages
% 8.63/2.52
%------------------------------------------------------------------------------