TSTP Solution File: CSR115+27 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+27 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:15 EDT 2022
% Result : Theorem 8.23s 2.72s
% Output : CNFRefutation 8.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 36 ( 16 unt; 0 nHn; 36 RR)
% Number of literals : 122 ( 0 equ; 97 neg)
% Maximal clause size : 11 ( 3 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 : 97 ( 27 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_778,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ val(X4,X8)
| ~ sub(X4,jahr__1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X7,name_1_1)
| ~ has_card_leq(X8,int1994) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jtajv4p7/input.p',i_0_778) ).
cnf(i_0_600,plain,
( has_card_leq(X1,X2)
| ~ card(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jtajv4p7/input.p',i_0_600) ).
cnf(i_0_757,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jtajv4p7/input.p',i_0_757) ).
cnf(i_0_774,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jtajv4p7/input.p',i_0_774) ).
cnf(i_0_775,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jtajv4p7/input.p',i_0_775) ).
cnf(i_0_776,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jtajv4p7/input.p',i_0_776) ).
cnf(i_0_279,hypothesis,
val(c85,c80),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jtajv4p7/input.p',i_0_279) ).
cnf(i_0_70,hypothesis,
card(c80,int1994),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jtajv4p7/input.p',i_0_70) ).
cnf(i_0_280,hypothesis,
sub(c85,jahr__1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jtajv4p7/input.p',i_0_280) ).
cnf(i_0_281,hypothesis,
attr(c84,c85),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jtajv4p7/input.p',i_0_281) ).
cnf(i_0_297,hypothesis,
attr(c11,c12),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jtajv4p7/input.p',i_0_297) ).
cnf(i_0_295,hypothesis,
sub(c12,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jtajv4p7/input.p',i_0_295) ).
cnf(i_0_296,hypothesis,
sub(c11,stadt__1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jtajv4p7/input.p',i_0_296) ).
cnf(c_0_792,negated_conjecture,
( ~ obj(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ val(X4,X8)
| ~ sub(X4,jahr__1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X7,name_1_1)
| ~ has_card_leq(X8,int1994) ),
i_0_778 ).
cnf(c_0_793,plain,
( has_card_leq(X1,X2)
| ~ card(X1,X2) ),
i_0_600 ).
cnf(c_0_794,plain,
( ~ obj(X1,X2)
| ~ card(X3,int1994)
| ~ val(X4,X3)
| ~ attr(X5,X6)
| ~ attr(X7,X4)
| ~ attr(X2,X8)
| ~ sub(X8,name_1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X4,jahr__1_1) ),
inference(spm,[status(thm)],[c_0_792,c_0_793]) ).
cnf(c_0_795,plain,
( obj(esk54_3(X1,X2,X3),X2)
| ~ arg1(X1,X2)
| ~ arg2(X1,X3)
| ~ subr(X1,sub_0) ),
i_0_757 ).
cnf(c_0_796,plain,
( ~ arg2(X1,X2)
| ~ arg1(X1,X3)
| ~ subr(X1,sub_0)
| ~ card(X4,int1994)
| ~ val(X5,X4)
| ~ attr(X6,X7)
| ~ attr(X8,X5)
| ~ attr(X3,X9)
| ~ sub(X9,name_1_1)
| ~ sub(X7,name_1_1)
| ~ sub(X5,jahr__1_1) ),
inference(spm,[status(thm)],[c_0_794,c_0_795]) ).
cnf(c_0_797,plain,
( subr(esk59_2(X1,X2),sub_0)
| ~ sub(X1,X2) ),
i_0_774 ).
cnf(c_0_798,plain,
( ~ arg2(esk59_2(X1,X2),X3)
| ~ arg1(esk59_2(X1,X2),X4)
| ~ card(X5,int1994)
| ~ val(X6,X5)
| ~ attr(X7,X8)
| ~ attr(X9,X6)
| ~ attr(X4,X10)
| ~ sub(X10,name_1_1)
| ~ sub(X8,name_1_1)
| ~ sub(X6,jahr__1_1)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[c_0_796,c_0_797]) ).
cnf(c_0_799,plain,
( arg2(esk59_2(X1,X2),X2)
| ~ sub(X1,X2) ),
i_0_775 ).
cnf(c_0_800,plain,
( ~ arg1(esk59_2(X1,X2),X3)
| ~ card(X4,int1994)
| ~ val(X5,X4)
| ~ attr(X6,X7)
| ~ attr(X8,X5)
| ~ attr(X3,X9)
| ~ sub(X9,name_1_1)
| ~ sub(X7,name_1_1)
| ~ sub(X5,jahr__1_1)
| ~ sub(X1,X2) ),
inference(spm,[status(thm)],[c_0_798,c_0_799]) ).
cnf(c_0_801,plain,
( arg1(esk59_2(X1,X2),X1)
| ~ sub(X1,X2) ),
i_0_776 ).
cnf(c_0_802,plain,
( ~ card(X1,int1994)
| ~ val(X2,X1)
| ~ attr(X3,X4)
| ~ attr(X5,X2)
| ~ attr(X6,X7)
| ~ sub(X7,name_1_1)
| ~ sub(X4,name_1_1)
| ~ sub(X2,jahr__1_1)
| ~ sub(X6,X8) ),
inference(spm,[status(thm)],[c_0_800,c_0_801]) ).
cnf(c_0_803,hypothesis,
val(c85,c80),
i_0_279 ).
cnf(c_0_804,hypothesis,
card(c80,int1994),
i_0_70 ).
cnf(c_0_805,hypothesis,
sub(c85,jahr__1_1),
i_0_280 ).
cnf(c_0_806,hypothesis,
( ~ attr(X1,c85)
| ~ attr(X2,X3)
| ~ attr(X4,X5)
| ~ sub(X5,name_1_1)
| ~ sub(X3,name_1_1)
| ~ sub(X4,X6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_802,c_0_803]),c_0_804]),c_0_805])]) ).
cnf(c_0_807,hypothesis,
attr(c84,c85),
i_0_281 ).
cnf(c_0_808,hypothesis,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ sub(X4,name_1_1)
| ~ sub(X2,name_1_1)
| ~ sub(X3,X5) ),
inference(spm,[status(thm)],[c_0_806,c_0_807]) ).
cnf(c_0_809,hypothesis,
attr(c11,c12),
i_0_297 ).
cnf(c_0_810,hypothesis,
sub(c12,name_1_1),
i_0_295 ).
cnf(c_0_811,hypothesis,
( ~ attr(X1,X2)
| ~ sub(X2,name_1_1)
| ~ sub(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_808,c_0_809]),c_0_810])]) ).
cnf(c_0_812,hypothesis,
sub(c11,stadt__1_1),
i_0_296 ).
cnf(c_0_813,hypothesis,
~ sub(c11,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_811,c_0_809]),c_0_810])]) ).
cnf(c_0_814,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_812,c_0_813]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR115+27 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n017.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 : Fri Jun 10 07:24:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.41/0.60 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.41/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.41/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.23/2.72 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 8.23/2.72 # Version: 2.1pre011
% 8.23/2.72 # Preprocessing time : 0.022 s
% 8.23/2.72
% 8.23/2.72 # Proof found!
% 8.23/2.72 # SZS status Theorem
% 8.23/2.72 # SZS output start CNFRefutation
% See solution above
% 8.23/2.72 # Proof object total steps : 36
% 8.23/2.72 # Proof object clause steps : 23
% 8.23/2.72 # Proof object formula steps : 13
% 8.23/2.72 # Proof object conjectures : 2
% 8.23/2.72 # Proof object clause conjectures : 1
% 8.23/2.72 # Proof object formula conjectures : 1
% 8.23/2.72 # Proof object initial clauses used : 13
% 8.23/2.72 # Proof object initial formulas used : 13
% 8.23/2.72 # Proof object generating inferences : 9
% 8.23/2.72 # Proof object simplifying inferences : 8
% 8.23/2.72 # Training examples: 0 positive, 0 negative
% 8.23/2.72 # Parsed axioms : 798
% 8.23/2.72 # Removed by relevancy pruning/SinE : 0
% 8.23/2.72 # Initial clauses : 798
% 8.23/2.72 # Removed in clause preprocessing : 0
% 8.23/2.72 # Initial clauses in saturation : 798
% 8.23/2.72 # Processed clauses : 934
% 8.23/2.72 # ...of these trivial : 0
% 8.23/2.72 # ...subsumed : 3
% 8.23/2.72 # ...remaining for further processing : 931
% 8.23/2.72 # Other redundant clauses eliminated : 0
% 8.23/2.72 # Clauses deleted for lack of memory : 0
% 8.23/2.72 # Backward-subsumed : 11
% 8.23/2.72 # Backward-rewritten : 0
% 8.23/2.72 # Generated clauses : 1925
% 8.23/2.72 # ...of the previous two non-trivial : 1908
% 8.23/2.72 # Contextual simplify-reflections : 11
% 8.23/2.72 # Paramodulations : 1924
% 8.23/2.72 # Factorizations : 0
% 8.23/2.72 # Equation resolutions : 0
% 8.23/2.72 # Propositional unsat checks : 0
% 8.23/2.72 # Propositional unsat check successes : 0
% 8.23/2.72 # Current number of processed clauses : 919
% 8.23/2.72 # Positive orientable unit clauses : 529
% 8.23/2.72 # Positive unorientable unit clauses: 0
% 8.23/2.72 # Negative unit clauses : 2
% 8.23/2.72 # Non-unit-clauses : 388
% 8.23/2.72 # Current number of unprocessed clauses: 1727
% 8.23/2.72 # ...number of literals in the above : 6251
% 8.23/2.72 # Current number of archived formulas : 0
% 8.23/2.72 # Current number of archived clauses : 12
% 8.23/2.72 # Clause-clause subsumption calls (NU) : 33639
% 8.23/2.72 # Rec. Clause-clause subsumption calls : 7912
% 8.23/2.72 # Non-unit clause-clause subsumptions : 25
% 8.23/2.72 # Unit Clause-clause subsumption calls : 1454
% 8.23/2.72 # Rewrite failures with RHS unbound : 0
% 8.23/2.72 # BW rewrite match attempts : 0
% 8.23/2.72 # BW rewrite match successes : 0
% 8.23/2.72 # Condensation attempts : 0
% 8.23/2.72 # Condensation successes : 0
% 8.23/2.72 # Termbank termtop insertions : 39371
% 8.23/2.72
% 8.23/2.72 # -------------------------------------------------
% 8.23/2.72 # User time : 0.065 s
% 8.23/2.72 # System time : 0.002 s
% 8.23/2.72 # Total time : 0.067 s
% 8.23/2.72 # ...preprocessing : 0.022 s
% 8.23/2.72 # ...main loop : 0.045 s
% 8.23/2.72 # Maximum resident set size: 10280 pages
% 8.23/2.72
%------------------------------------------------------------------------------