%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+5 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:21 EDT 2022
% Result : Theorem 5.19s 2.74s
% Output : CNFRefutation 5.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 32 ( 18 unt; 0 nHn; 32 RR)
% Number of literals : 67 ( 0 equ; 44 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-3 aty)
% Number of variables : 50 ( 29 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_879,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ sub(X2,firma_1_1)
| ~ sub(X6,name_1_1)
| ~ prop(X2,britisch__1_1)
| ~ val(X6,bmw_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tdxdnbmm/input.p',i_0_879) ).
cnf(i_0_382,hypothesis,
val(c55668,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tdxdnbmm/input.p',i_0_382) ).
cnf(i_0_383,hypothesis,
sub(c55668,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tdxdnbmm/input.p',i_0_383) ).
cnf(i_0_386,hypothesis,
attr(c55667,c55668),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tdxdnbmm/input.p',i_0_386) ).
cnf(i_0_376,hypothesis,
prop(c55986,britisch__1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tdxdnbmm/input.p',i_0_376) ).
cnf(i_0_375,hypothesis,
sub(c55986,firma_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tdxdnbmm/input.p',i_0_375) ).
cnf(i_0_738,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tdxdnbmm/input.p',i_0_738) ).
cnf(i_0_705,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tdxdnbmm/input.p',i_0_705) ).
cnf(i_0_210,hypothesis,
fact(c55986,real),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tdxdnbmm/input.p',i_0_210) ).
cnf(i_0_837,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-tdxdnbmm/input.p',i_0_837) ).
cnf(i_0_640,plain,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tdxdnbmm/input.p',i_0_640) ).
cnf(i_0_377,hypothesis,
attr(c55986,c55987),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tdxdnbmm/input.p',i_0_377) ).
cnf(c_0_892,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ sub(X2,firma_1_1)
| ~ sub(X6,name_1_1)
| ~ prop(X2,britisch__1_1)
| ~ val(X6,bmw_0) ),
i_0_879 ).
cnf(c_0_893,hypothesis,
val(c55668,bmw_0),
i_0_382 ).
cnf(c_0_894,hypothesis,
sub(c55668,name_1_1),
i_0_383 ).
cnf(c_0_895,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,c55668)
| ~ attr(X4,X5)
| ~ prop(X2,britisch__1_1)
| ~ sub(X2,firma_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_892,c_0_893]),c_0_894])]) ).
cnf(c_0_896,hypothesis,
attr(c55667,c55668),
i_0_386 ).
cnf(c_0_897,hypothesis,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ prop(X2,britisch__1_1)
| ~ sub(X2,firma_1_1) ),
inference(spm,[status(thm)],[c_0_895,c_0_896]) ).
cnf(c_0_898,hypothesis,
prop(c55986,britisch__1_1),
i_0_376 ).
cnf(c_0_899,hypothesis,
sub(c55986,firma_1_1),
i_0_375 ).
cnf(c_0_900,hypothesis,
( ~ obj(X1,c55986)
| ~ attr(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_897,c_0_898]),c_0_899])]) ).
cnf(c_0_901,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
i_0_738 ).
cnf(c_0_902,plain,
( ~ loc(c55986,X1)
| ~ has_fact_leq(c55986,real)
| ~ attr(X2,X3) ),
inference(spm,[status(thm)],[c_0_900,c_0_901]) ).
cnf(c_0_903,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
i_0_705 ).
cnf(c_0_904,hypothesis,
fact(c55986,real),
i_0_210 ).
cnf(c_0_905,plain,
( ~ loc(c55986,X1)
| ~ attr(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_902,c_0_903]),c_0_904])]) ).
cnf(c_0_906,plain,
( loc(X1,esk50_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
i_0_837 ).
cnf(c_0_907,plain,
( ~ state_adjective_state_binding(X1,X2)
| ~ attr(X3,X4)
| ~ prop(c55986,X1) ),
inference(spm,[status(thm)],[c_0_905,c_0_906]) ).
cnf(c_0_908,plain,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
i_0_640 ).
cnf(c_0_909,hypothesis,
attr(c55986,c55987),
i_0_377 ).
cnf(c_0_910,plain,
~ attr(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_907,c_0_908]),c_0_898])]) ).
cnf(c_0_911,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_909,c_0_910]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR115+5 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jun 11 02:40:12 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.37/0.59 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.37/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.37/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.37/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.19/2.74 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 5.19/2.74 # Version: 2.1pre011
% 5.19/2.74 # Preprocessing time : 0.032 s
% 5.19/2.74
% 5.19/2.74 # Proof found!
% 5.19/2.74 # SZS status Theorem
% 5.19/2.74 # SZS output start CNFRefutation
% See solution above
% 5.19/2.74 # Proof object total steps : 32
% 5.19/2.74 # Proof object clause steps : 20
% 5.19/2.74 # Proof object formula steps : 12
% 5.19/2.74 # Proof object conjectures : 3
% 5.19/2.74 # Proof object clause conjectures : 2
% 5.19/2.74 # Proof object formula conjectures : 1
% 5.19/2.74 # Proof object initial clauses used : 12
% 5.19/2.74 # Proof object initial formulas used : 12
% 5.19/2.74 # Proof object generating inferences : 7
% 5.19/2.74 # Proof object simplifying inferences : 9
% 5.19/2.74 # Training examples: 0 positive, 0 negative
% 5.19/2.74 # Parsed axioms : 899
% 5.19/2.74 # Removed by relevancy pruning/SinE : 0
% 5.19/2.74 # Initial clauses : 899
% 5.19/2.74 # Removed in clause preprocessing : 0
% 5.19/2.74 # Initial clauses in saturation : 899
% 5.19/2.74 # Processed clauses : 942
% 5.19/2.74 # ...of these trivial : 0
% 5.19/2.74 # ...subsumed : 2
% 5.19/2.74 # ...remaining for further processing : 940
% 5.19/2.74 # Other redundant clauses eliminated : 0
% 5.19/2.74 # Clauses deleted for lack of memory : 0
% 5.19/2.74 # Backward-subsumed : 4
% 5.19/2.74 # Backward-rewritten : 0
% 5.19/2.74 # Generated clauses : 1848
% 5.19/2.74 # ...of the previous two non-trivial : 1838
% 5.19/2.74 # Contextual simplify-reflections : 5
% 5.19/2.74 # Paramodulations : 1842
% 5.19/2.74 # Factorizations : 0
% 5.19/2.74 # Equation resolutions : 0
% 5.19/2.74 # Propositional unsat checks : 0
% 5.19/2.74 # Propositional unsat check successes : 0
% 5.19/2.74 # Current number of processed clauses : 930
% 5.19/2.74 # Positive orientable unit clauses : 594
% 5.19/2.74 # Positive unorientable unit clauses: 0
% 5.19/2.74 # Negative unit clauses : 1
% 5.19/2.74 # Non-unit-clauses : 335
% 5.19/2.74 # Current number of unprocessed clauses: 1791
% 5.19/2.74 # ...number of literals in the above : 5812
% 5.19/2.74 # Current number of archived formulas : 0
% 5.19/2.74 # Current number of archived clauses : 10
% 5.19/2.74 # Clause-clause subsumption calls (NU) : 27176
% 5.19/2.74 # Rec. Clause-clause subsumption calls : 9047
% 5.19/2.74 # Non-unit clause-clause subsumptions : 11
% 5.19/2.74 # Unit Clause-clause subsumption calls : 2246
% 5.19/2.74 # Rewrite failures with RHS unbound : 0
% 5.19/2.74 # BW rewrite match attempts : 0
% 5.19/2.74 # BW rewrite match successes : 0
% 5.19/2.74 # Condensation attempts : 0
% 5.19/2.74 # Condensation successes : 0
% 5.19/2.74 # Termbank termtop insertions : 35631
% 5.19/2.74
% 5.19/2.74 # -------------------------------------------------
% 5.19/2.74 # User time : 0.063 s
% 5.19/2.74 # System time : 0.008 s
% 5.19/2.74 # Total time : 0.071 s
% 5.19/2.74 # ...preprocessing : 0.032 s
% 5.19/2.74 # ...main loop : 0.039 s
% 5.19/2.74 # Maximum resident set size: 10500 pages
% 5.19/2.74
%------------------------------------------------------------------------------