%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+12 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:12 EDT 2022
% Result : Theorem 6.98s 2.65s
% Output : CNFRefutation 6.98s
% 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 : 14 ( 14 usr; 12 con; 0-3 aty)
% Number of variables : 74 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_816,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-5r5fei0j/input.p',i_0_816) ).
cnf(i_0_638,plain,
( has_card_leq(X1,X2)
| ~ card(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5r5fei0j/input.p',i_0_638) ).
cnf(i_0_320,hypothesis,
prop(c14368,britisch__1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5r5fei0j/input.p',i_0_320) ).
cnf(i_0_675,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5r5fei0j/input.p',i_0_675) ).
cnf(i_0_642,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5r5fei0j/input.p',i_0_642) ).
cnf(i_0_191,hypothesis,
fact(c14368,real),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5r5fei0j/input.p',i_0_191) ).
cnf(i_0_774,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-5r5fei0j/input.p',i_0_774) ).
cnf(i_0_577,plain,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5r5fei0j/input.p',i_0_577) ).
cnf(i_0_324,hypothesis,
val(c14116,c14110),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5r5fei0j/input.p',i_0_324) ).
cnf(i_0_230,hypothesis,
card(c14110,int1994),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5r5fei0j/input.p',i_0_230) ).
cnf(i_0_325,hypothesis,
sub(c14116,jahr__1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5r5fei0j/input.p',i_0_325) ).
cnf(i_0_326,hypothesis,
attr(c14115,c14116),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5r5fei0j/input.p',i_0_326) ).
cnf(i_0_309,hypothesis,
attr(c14397,c14398),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5r5fei0j/input.p',i_0_309) ).
cnf(i_0_307,hypothesis,
sub(c14398,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5r5fei0j/input.p',i_0_307) ).
cnf(c_0_831,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_816 ).
cnf(c_0_832,plain,
( has_card_leq(X1,X2)
| ~ card(X1,X2) ),
i_0_638 ).
cnf(c_0_833,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_831,c_0_832]) ).
cnf(c_0_834,hypothesis,
prop(c14368,britisch__1_1),
i_0_320 ).
cnf(c_0_835,hypothesis,
( ~ obj(X1,c14368)
| ~ 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_833,c_0_834]) ).
cnf(c_0_836,plain,
( obj(esk24_2(X1,X2),X2)
| ~ loc(X2,X1)
| ~ has_fact_leq(X2,real) ),
i_0_675 ).
cnf(c_0_837,plain,
( ~ loc(c14368,X1)
| ~ has_fact_leq(c14368,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_835,c_0_836]) ).
cnf(c_0_838,plain,
( has_fact_leq(X1,X2)
| ~ fact(X1,X2) ),
i_0_642 ).
cnf(c_0_839,hypothesis,
fact(c14368,real),
i_0_191 ).
cnf(c_0_840,plain,
( ~ loc(c14368,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_837,c_0_838]),c_0_839])]) ).
cnf(c_0_841,plain,
( loc(X1,esk50_3(X1,X2,X3))
| ~ prop(X1,X2)
| ~ state_adjective_state_binding(X2,X3) ),
i_0_774 ).
cnf(c_0_842,plain,
( ~ state_adjective_state_binding(X1,X2)
| ~ card(X3,int1994)
| ~ val(X4,X3)
| ~ attr(X5,X6)
| ~ attr(X7,X4)
| ~ prop(c14368,X1)
| ~ sub(X6,name_1_1)
| ~ sub(X4,jahr__1_1) ),
inference(spm,[status(thm)],[c_0_840,c_0_841]) ).
cnf(c_0_843,plain,
state_adjective_state_binding(britisch__1_1,grossbritannien_0),
i_0_577 ).
cnf(c_0_844,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_842,c_0_843]),c_0_834])]) ).
cnf(c_0_845,hypothesis,
val(c14116,c14110),
i_0_324 ).
cnf(c_0_846,hypothesis,
card(c14110,int1994),
i_0_230 ).
cnf(c_0_847,hypothesis,
sub(c14116,jahr__1_1),
i_0_325 ).
cnf(c_0_848,hypothesis,
( ~ attr(X1,c14116)
| ~ 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_844,c_0_845]),c_0_846]),c_0_847])]) ).
cnf(c_0_849,hypothesis,
attr(c14115,c14116),
i_0_326 ).
cnf(c_0_850,hypothesis,
( ~ attr(X1,X2)
| ~ sub(X2,name_1_1) ),
inference(spm,[status(thm)],[c_0_848,c_0_849]) ).
cnf(c_0_851,hypothesis,
attr(c14397,c14398),
i_0_309 ).
cnf(c_0_852,hypothesis,
sub(c14398,name_1_1),
i_0_307 ).
cnf(c_0_853,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_850,c_0_851]),c_0_852])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : CSR115+12 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Fri Jun 10 21:30:37 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected SinE mode:
% 0.41/0.59 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.41/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.41/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.41/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.98/2.65 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 6.98/2.65 # Version: 2.1pre011
% 6.98/2.65 # Preprocessing time : 0.024 s
% 6.98/2.65
% 6.98/2.65 # Proof found!
% 6.98/2.65 # SZS status Theorem
% 6.98/2.65 # SZS output start CNFRefutation
% See solution above
% 6.98/2.65 # Proof object total steps : 37
% 6.98/2.65 # Proof object clause steps : 23
% 6.98/2.65 # Proof object formula steps : 14
% 6.98/2.65 # Proof object conjectures : 2
% 6.98/2.65 # Proof object clause conjectures : 1
% 6.98/2.65 # Proof object formula conjectures : 1
% 6.98/2.65 # Proof object initial clauses used : 14
% 6.98/2.65 # Proof object initial formulas used : 14
% 6.98/2.65 # Proof object generating inferences : 9
% 6.98/2.65 # Proof object simplifying inferences : 9
% 6.98/2.65 # Training examples: 0 positive, 0 negative
% 6.98/2.65 # Parsed axioms : 836
% 6.98/2.65 # Removed by relevancy pruning/SinE : 0
% 6.98/2.65 # Initial clauses : 836
% 6.98/2.65 # Removed in clause preprocessing : 0
% 6.98/2.65 # Initial clauses in saturation : 836
% 6.98/2.65 # Processed clauses : 858
% 6.98/2.65 # ...of these trivial : 0
% 6.98/2.65 # ...subsumed : 1
% 6.98/2.65 # ...remaining for further processing : 857
% 6.98/2.65 # Other redundant clauses eliminated : 0
% 6.98/2.65 # Clauses deleted for lack of memory : 0
% 6.98/2.65 # Backward-subsumed : 14
% 6.98/2.65 # Backward-rewritten : 0
% 6.98/2.65 # Generated clauses : 1767
% 6.98/2.65 # ...of the previous two non-trivial : 1763
% 6.98/2.65 # Contextual simplify-reflections : 2
% 6.98/2.65 # Paramodulations : 1767
% 6.98/2.65 # Factorizations : 0
% 6.98/2.65 # Equation resolutions : 0
% 6.98/2.65 # Propositional unsat checks : 0
% 6.98/2.65 # Propositional unsat check successes : 0
% 6.98/2.65 # Current number of processed clauses : 843
% 6.98/2.65 # Positive orientable unit clauses : 531
% 6.98/2.65 # Positive unorientable unit clauses: 0
% 6.98/2.65 # Negative unit clauses : 0
% 6.98/2.65 # Non-unit-clauses : 312
% 6.98/2.65 # Current number of unprocessed clauses: 1687
% 6.98/2.65 # ...number of literals in the above : 5351
% 6.98/2.65 # Current number of archived formulas : 0
% 6.98/2.65 # Current number of archived clauses : 14
% 6.98/2.65 # Clause-clause subsumption calls (NU) : 25476
% 6.98/2.65 # Rec. Clause-clause subsumption calls : 9119
% 6.98/2.65 # Non-unit clause-clause subsumptions : 17
% 6.98/2.65 # Unit Clause-clause subsumption calls : 1466
% 6.98/2.65 # Rewrite failures with RHS unbound : 0
% 6.98/2.65 # BW rewrite match attempts : 0
% 6.98/2.65 # BW rewrite match successes : 0
% 6.98/2.65 # Condensation attempts : 0
% 6.98/2.65 # Condensation successes : 0
% 6.98/2.65 # Termbank termtop insertions : 34628
% 6.98/2.65
% 6.98/2.65 # -------------------------------------------------
% 6.98/2.65 # User time : 0.052 s
% 6.98/2.65 # System time : 0.009 s
% 6.98/2.65 # Total time : 0.061 s
% 6.98/2.65 # ...preprocessing : 0.024 s
% 6.98/2.65 # ...main loop : 0.037 s
% 6.98/2.65 # Maximum resident set size: 10236 pages
% 6.98/2.65
%------------------------------------------------------------------------------