TSTP Solution File: CSR115+49 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+49 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:19 EDT 2022
% Result : Theorem 7.01s 2.68s
% Output : CNFRefutation 7.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 16 unt; 0 nHn; 26 RR)
% Number of literals : 62 ( 0 equ; 45 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-3 aty)
% Number of variables : 47 ( 31 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_718,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ subs(X7,n374bernehmen_1_1)
| ~ sub(X4,name_1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X5,firma_1_1)
| ~ val(X4,bmw_0)
| ~ val(X6,bmw_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r333vlyo/input.p',i_0_718) ).
cnf(i_0_216,hypothesis,
val(c74,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r333vlyo/input.p',i_0_216) ).
cnf(i_0_217,hypothesis,
sub(c74,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r333vlyo/input.p',i_0_217) ).
cnf(i_0_219,hypothesis,
attr(c73,c74),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r333vlyo/input.p',i_0_219) ).
cnf(i_0_218,hypothesis,
sub(c73,firma_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r333vlyo/input.p',i_0_218) ).
cnf(i_0_251,plain,
( subs(esk14_3(X1,X2,X3),X3)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r333vlyo/input.p',i_0_251) ).
cnf(i_0_427,plain,
chea(n374bernehmen_1_1,annahme_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r333vlyo/input.p',i_0_427) ).
cnf(i_0_225,hypothesis,
subs(c25,annahme_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r333vlyo/input.p',i_0_225) ).
cnf(i_0_230,hypothesis,
attr(c18,c19),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r333vlyo/input.p',i_0_230) ).
cnf(c_0_728,negated_conjecture,
( ~ attr(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ subs(X7,n374bernehmen_1_1)
| ~ sub(X4,name_1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X5,firma_1_1)
| ~ val(X4,bmw_0)
| ~ val(X6,bmw_0) ),
i_0_718 ).
cnf(c_0_729,hypothesis,
val(c74,bmw_0),
i_0_216 ).
cnf(c_0_730,hypothesis,
sub(c74,name_1_1),
i_0_217 ).
cnf(c_0_731,negated_conjecture,
( ~ val(X1,bmw_0)
| ~ attr(X2,c74)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ sub(X2,firma_1_1)
| ~ sub(X1,name_1_1)
| ~ subs(X6,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_728,c_0_729]),c_0_730])]) ).
cnf(c_0_732,hypothesis,
( ~ attr(X1,c74)
| ~ attr(X2,c74)
| ~ attr(X3,X4)
| ~ sub(X1,firma_1_1)
| ~ subs(X5,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_731,c_0_729]),c_0_730])]) ).
cnf(c_0_733,hypothesis,
attr(c73,c74),
i_0_219 ).
cnf(c_0_734,hypothesis,
sub(c73,firma_1_1),
i_0_218 ).
cnf(c_0_735,hypothesis,
( ~ attr(X1,c74)
| ~ attr(X2,X3)
| ~ subs(X4,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_732,c_0_733]),c_0_734])]) ).
cnf(c_0_736,hypothesis,
( ~ attr(X1,X2)
| ~ subs(X3,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_735,c_0_733]) ).
cnf(c_0_737,plain,
( subs(esk14_3(X1,X2,X3),X3)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
i_0_251 ).
cnf(c_0_738,plain,
( ~ chea(n374bernehmen_1_1,X1)
| ~ attr(X2,X3)
| ~ subs(X4,X1) ),
inference(spm,[status(thm)],[c_0_736,c_0_737]) ).
cnf(c_0_739,plain,
chea(n374bernehmen_1_1,annahme_1_1),
i_0_427 ).
cnf(c_0_740,plain,
( ~ attr(X1,X2)
| ~ subs(X3,annahme_1_1) ),
inference(spm,[status(thm)],[c_0_738,c_0_739]) ).
cnf(c_0_741,hypothesis,
subs(c25,annahme_1_1),
i_0_225 ).
cnf(c_0_742,hypothesis,
attr(c18,c19),
i_0_230 ).
cnf(c_0_743,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_740,c_0_741]) ).
cnf(c_0_744,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_742,c_0_743]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR115+49 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jun 10 09:17:55 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.59 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.01/2.68 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 7.01/2.68 # Version: 2.1pre011
% 7.01/2.68 # Preprocessing time : 0.036 s
% 7.01/2.68
% 7.01/2.68 # Proof found!
% 7.01/2.68 # SZS status Theorem
% 7.01/2.68 # SZS output start CNFRefutation
% See solution above
% 7.01/2.68 # Proof object total steps : 26
% 7.01/2.68 # Proof object clause steps : 17
% 7.01/2.68 # Proof object formula steps : 9
% 7.01/2.68 # Proof object conjectures : 3
% 7.01/2.68 # Proof object clause conjectures : 2
% 7.01/2.68 # Proof object formula conjectures : 1
% 7.01/2.68 # Proof object initial clauses used : 9
% 7.01/2.68 # Proof object initial formulas used : 9
% 7.01/2.68 # Proof object generating inferences : 7
% 7.01/2.68 # Proof object simplifying inferences : 7
% 7.01/2.68 # Training examples: 0 positive, 0 negative
% 7.01/2.68 # Parsed axioms : 738
% 7.01/2.68 # Removed by relevancy pruning/SinE : 0
% 7.01/2.68 # Initial clauses : 738
% 7.01/2.68 # Removed in clause preprocessing : 0
% 7.01/2.68 # Initial clauses in saturation : 738
% 7.01/2.68 # Processed clauses : 762
% 7.01/2.68 # ...of these trivial : 0
% 7.01/2.68 # ...subsumed : 0
% 7.01/2.68 # ...remaining for further processing : 762
% 7.01/2.68 # Other redundant clauses eliminated : 0
% 7.01/2.68 # Clauses deleted for lack of memory : 0
% 7.01/2.68 # Backward-subsumed : 4
% 7.01/2.68 # Backward-rewritten : 0
% 7.01/2.68 # Generated clauses : 1729
% 7.01/2.68 # ...of the previous two non-trivial : 1721
% 7.01/2.68 # Contextual simplify-reflections : 0
% 7.01/2.68 # Paramodulations : 1725
% 7.01/2.68 # Factorizations : 0
% 7.01/2.68 # Equation resolutions : 0
% 7.01/2.68 # Propositional unsat checks : 0
% 7.01/2.68 # Propositional unsat check successes : 0
% 7.01/2.68 # Current number of processed clauses : 754
% 7.01/2.68 # Positive orientable unit clauses : 431
% 7.01/2.68 # Positive unorientable unit clauses: 0
% 7.01/2.68 # Negative unit clauses : 1
% 7.01/2.68 # Non-unit-clauses : 322
% 7.01/2.68 # Current number of unprocessed clauses: 1689
% 7.01/2.68 # ...number of literals in the above : 5484
% 7.01/2.68 # Current number of archived formulas : 0
% 7.01/2.68 # Current number of archived clauses : 8
% 7.01/2.68 # Clause-clause subsumption calls (NU) : 29550
% 7.01/2.68 # Rec. Clause-clause subsumption calls : 9965
% 7.01/2.68 # Non-unit clause-clause subsumptions : 4
% 7.01/2.68 # Unit Clause-clause subsumption calls : 1381
% 7.01/2.68 # Rewrite failures with RHS unbound : 0
% 7.01/2.68 # BW rewrite match attempts : 0
% 7.01/2.68 # BW rewrite match successes : 0
% 7.01/2.68 # Condensation attempts : 0
% 7.01/2.68 # Condensation successes : 0
% 7.01/2.68 # Termbank termtop insertions : 33156
% 7.01/2.68
% 7.01/2.68 # -------------------------------------------------
% 7.01/2.68 # User time : 0.064 s
% 7.01/2.68 # System time : 0.012 s
% 7.01/2.68 # Total time : 0.076 s
% 7.01/2.68 # ...preprocessing : 0.036 s
% 7.01/2.68 # ...main loop : 0.041 s
% 7.01/2.68 # Maximum resident set size: 9576 pages
% 7.01/2.68
%------------------------------------------------------------------------------