%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+18 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:13 EDT 2022
% Result : Theorem 8.47s 2.87s
% Output : CNFRefutation 8.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 37 ( 19 unt; 0 nHn; 37 RR)
% Number of literals : 104 ( 0 equ; 77 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-3 aty)
% Number of variables : 74 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_819,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ val(X4,X7)
| ~ sub(X4,jahr__1_1)
| ~ sub(X6,name_1_1)
| ~ prop(X2,britisch__1_1)
| ~ has_card_leq(X7,int1994) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_819) ).
cnf(i_0_641,plain,
( has_card_leq(X1,X2)
| ~ card(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_641) ).
cnf(i_0_324,hypothesis,
prop(c131,britisch__1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_324) ).
cnf(i_0_678,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_678) ).
cnf(i_0_645,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_645) ).
cnf(i_0_237,hypothesis,
fact(c131,real),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_237) ).
cnf(i_0_777,plain,
( loc(X1,esk50_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_777) ).
cnf(i_0_579,plain,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_579) ).
cnf(i_0_305,hypothesis,
val(c84,c81),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_305) ).
cnf(i_0_71,hypothesis,
card(c81,int1994),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_71) ).
cnf(i_0_306,hypothesis,
sub(c84,jahr__1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_306) ).
cnf(i_0_307,hypothesis,
attr(c83,c84),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_307) ).
cnf(i_0_325,hypothesis,
attr(c131,c132),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_325) ).
cnf(i_0_322,hypothesis,
sub(c132,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fhyeo7c8/input.p',i_0_322) ).
cnf(c_0_834,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ val(X4,X7)
| ~ sub(X4,jahr__1_1)
| ~ sub(X6,name_1_1)
| ~ prop(X2,britisch__1_1)
| ~ has_card_leq(X7,int1994) ),
i_0_819 ).
cnf(c_0_835,plain,
( has_card_leq(X1,X2)
| ~ card(X1,X2) ),
i_0_641 ).
cnf(c_0_836,plain,
( ~ obj(X1,X2)
| ~ card(X3,int1994)
| ~ val(X4,X3)
| ~ attr(X5,X6)
| ~ attr(X7,X4)
| ~ prop(X2,britisch__1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X4,jahr__1_1) ),
inference(spm,[status(thm)],[c_0_834,c_0_835]) ).
cnf(c_0_837,hypothesis,
prop(c131,britisch__1_1),
i_0_324 ).
cnf(c_0_838,hypothesis,
( ~ obj(X1,c131)
| ~ card(X2,int1994)
| ~ val(X3,X2)
| ~ attr(X4,X5)
| ~ attr(X6,X3)
| ~ sub(X5,name_1_1)
| ~ sub(X3,jahr__1_1) ),
inference(spm,[status(thm)],[c_0_836,c_0_837]) ).
cnf(c_0_839,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
i_0_678 ).
cnf(c_0_840,plain,
( ~ loc(c131,X1)
| ~ has_fact_leq(c131,real)
| ~ card(X2,int1994)
| ~ val(X3,X2)
| ~ attr(X4,X5)
| ~ attr(X6,X3)
| ~ sub(X5,name_1_1)
| ~ sub(X3,jahr__1_1) ),
inference(spm,[status(thm)],[c_0_838,c_0_839]) ).
cnf(c_0_841,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
i_0_645 ).
cnf(c_0_842,hypothesis,
fact(c131,real),
i_0_237 ).
cnf(c_0_843,plain,
( ~ loc(c131,X1)
| ~ card(X2,int1994)
| ~ val(X3,X2)
| ~ attr(X4,X5)
| ~ attr(X6,X3)
| ~ sub(X5,name_1_1)
| ~ sub(X3,jahr__1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_840,c_0_841]),c_0_842])]) ).
cnf(c_0_844,plain,
( loc(X1,esk50_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
i_0_777 ).
cnf(c_0_845,plain,
( ~ state_adjective_state_binding(X1,X2)
| ~ card(X3,int1994)
| ~ val(X4,X3)
| ~ attr(X5,X6)
| ~ attr(X7,X4)
| ~ prop(c131,X1)
| ~ sub(X6,name_1_1)
| ~ sub(X4,jahr__1_1) ),
inference(spm,[status(thm)],[c_0_843,c_0_844]) ).
cnf(c_0_846,plain,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
i_0_579 ).
cnf(c_0_847,plain,
( ~ card(X1,int1994)
| ~ val(X2,X1)
| ~ attr(X3,X4)
| ~ attr(X5,X2)
| ~ sub(X4,name_1_1)
| ~ sub(X2,jahr__1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_845,c_0_846]),c_0_837])]) ).
cnf(c_0_848,hypothesis,
val(c84,c81),
i_0_305 ).
cnf(c_0_849,hypothesis,
card(c81,int1994),
i_0_71 ).
cnf(c_0_850,hypothesis,
sub(c84,jahr__1_1),
i_0_306 ).
cnf(c_0_851,hypothesis,
( ~ attr(X1,c84)
| ~ attr(X2,X3)
| ~ sub(X3,name_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_847,c_0_848]),c_0_849]),c_0_850])]) ).
cnf(c_0_852,hypothesis,
attr(c83,c84),
i_0_307 ).
cnf(c_0_853,hypothesis,
( ~ attr(X1,X2)
| ~ sub(X2,name_1_1) ),
inference(spm,[status(thm)],[c_0_851,c_0_852]) ).
cnf(c_0_854,hypothesis,
attr(c131,c132),
i_0_325 ).
cnf(c_0_855,hypothesis,
sub(c132,name_1_1),
i_0_322 ).
cnf(c_0_856,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_853,c_0_854]),c_0_855])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR115+18 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 11 07:32:21 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected SinE mode:
% 0.40/0.61 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.61 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.40/0.61 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.40/0.61 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.47/2.87 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 8.47/2.87 # Version: 2.1pre011
% 8.47/2.87 # Preprocessing time : 0.025 s
% 8.47/2.87
% 8.47/2.87 # Proof found!
% 8.47/2.87 # SZS status Theorem
% 8.47/2.87 # SZS output start CNFRefutation
% See solution above
% 8.47/2.87 # Proof object total steps : 37
% 8.47/2.87 # Proof object clause steps : 23
% 8.47/2.87 # Proof object formula steps : 14
% 8.47/2.87 # Proof object conjectures : 2
% 8.47/2.87 # Proof object clause conjectures : 1
% 8.47/2.87 # Proof object formula conjectures : 1
% 8.47/2.87 # Proof object initial clauses used : 14
% 8.47/2.87 # Proof object initial formulas used : 14
% 8.47/2.87 # Proof object generating inferences : 9
% 8.47/2.87 # Proof object simplifying inferences : 9
% 8.47/2.87 # Training examples: 0 positive, 0 negative
% 8.47/2.87 # Parsed axioms : 839
% 8.47/2.87 # Removed by relevancy pruning/SinE : 0
% 8.47/2.87 # Initial clauses : 839
% 8.47/2.87 # Removed in clause preprocessing : 0
% 8.47/2.87 # Initial clauses in saturation : 839
% 8.47/2.87 # Processed clauses : 870
% 8.47/2.87 # ...of these trivial : 0
% 8.47/2.87 # ...subsumed : 1
% 8.47/2.87 # ...remaining for further processing : 869
% 8.47/2.87 # Other redundant clauses eliminated : 0
% 8.47/2.87 # Clauses deleted for lack of memory : 0
% 8.47/2.87 # Backward-subsumed : 17
% 8.47/2.87 # Backward-rewritten : 0
% 8.47/2.87 # Generated clauses : 1793
% 8.47/2.87 # ...of the previous two non-trivial : 1790
% 8.47/2.87 # Contextual simplify-reflections : 2
% 8.47/2.87 # Paramodulations : 1793
% 8.47/2.87 # Factorizations : 0
% 8.47/2.87 # Equation resolutions : 0
% 8.47/2.87 # Propositional unsat checks : 0
% 8.47/2.87 # Propositional unsat check successes : 0
% 8.47/2.87 # Current number of processed clauses : 852
% 8.47/2.87 # Positive orientable unit clauses : 537
% 8.47/2.87 # Positive unorientable unit clauses: 0
% 8.47/2.87 # Negative unit clauses : 0
% 8.47/2.87 # Non-unit-clauses : 315
% 8.47/2.87 # Current number of unprocessed clauses: 1702
% 8.47/2.87 # ...number of literals in the above : 5393
% 8.47/2.87 # Current number of archived formulas : 0
% 8.47/2.87 # Current number of archived clauses : 17
% 8.47/2.87 # Clause-clause subsumption calls (NU) : 27149
% 8.47/2.87 # Rec. Clause-clause subsumption calls : 9695
% 8.47/2.87 # Non-unit clause-clause subsumptions : 20
% 8.47/2.87 # Unit Clause-clause subsumption calls : 2870
% 8.47/2.87 # Rewrite failures with RHS unbound : 0
% 8.47/2.87 # BW rewrite match attempts : 0
% 8.47/2.87 # BW rewrite match successes : 0
% 8.47/2.87 # Condensation attempts : 0
% 8.47/2.87 # Condensation successes : 0
% 8.47/2.87 # Termbank termtop insertions : 35027
% 8.47/2.87
% 8.47/2.87 # -------------------------------------------------
% 8.47/2.87 # User time : 0.060 s
% 8.47/2.87 # System time : 0.008 s
% 8.47/2.87 # Total time : 0.068 s
% 8.47/2.87 # ...preprocessing : 0.025 s
% 8.47/2.87 # ...main loop : 0.043 s
% 8.47/2.87 # Maximum resident set size: 10236 pages
% 8.47/2.87
%------------------------------------------------------------------------------