TSTP Solution File: CSR115+95 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+95 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:28 EDT 2022
% Result : Theorem 8.21s 2.76s
% Output : CNFRefutation 8.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 40 ( 20 unt; 0 nHn; 40 RR)
% Number of literals : 108 ( 0 equ; 79 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 11 con; 0-3 aty)
% Number of variables : 78 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_746,negated_conjecture,
( ~ agt(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ subs(X1,n374bernehmen_1_1)
| ~ sub(X7,name_1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X5,firma_1_1)
| ~ val(X7,bmw_0)
| ~ val(X6,bmw_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_746) ).
cnf(i_0_232,hypothesis,
val(c1948,bmw_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_232) ).
cnf(i_0_233,hypothesis,
sub(c1948,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_233) ).
cnf(i_0_236,hypothesis,
attr(c1947,c1948),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_236) ).
cnf(i_0_745,plain,
( sub(X1,X2)
| ~ sub(X3,X2)
| ~ sub(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_745) ).
cnf(i_0_255,hypothesis,
sub(autobauer_1_1,firma_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_255) ).
cnf(i_0_234,hypothesis,
sub(c1947,autobauer_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_234) ).
cnf(i_0_267,plain,
( agt(X1,X2)
| ~ agt(X3,X2)
| ~ chea(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_267) ).
cnf(i_0_276,plain,
( chea(esk14_3(X1,X2,X3),X1)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_276) ).
cnf(i_0_275,plain,
( subs(esk14_3(X1,X2,X3),X3)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_275) ).
cnf(i_0_451,plain,
chea(n374bernehmen_1_1,annahme_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_451) ).
cnf(i_0_245,hypothesis,
agt(c1671,c1947),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_245) ).
cnf(i_0_242,hypothesis,
subs(c1671,annahme_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_242) ).
cnf(i_0_251,hypothesis,
attr(c1665,c1666),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyvb9zct/input.p',i_0_251) ).
cnf(c_0_761,negated_conjecture,
( ~ agt(X1,X2)
| ~ attr(X3,X4)
| ~ attr(X5,X6)
| ~ attr(X2,X7)
| ~ subs(X1,n374bernehmen_1_1)
| ~ sub(X7,name_1_1)
| ~ sub(X6,name_1_1)
| ~ sub(X5,firma_1_1)
| ~ val(X7,bmw_0)
| ~ val(X6,bmw_0) ),
i_0_746 ).
cnf(c_0_762,hypothesis,
val(c1948,bmw_0),
i_0_232 ).
cnf(c_0_763,hypothesis,
sub(c1948,name_1_1),
i_0_233 ).
cnf(c_0_764,negated_conjecture,
( ~ val(X1,bmw_0)
| ~ attr(X2,c1948)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ agt(X6,X2)
| ~ sub(X1,name_1_1)
| ~ sub(X3,firma_1_1)
| ~ subs(X6,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_761,c_0_762]),c_0_763])]) ).
cnf(c_0_765,hypothesis,
( ~ attr(X1,c1948)
| ~ attr(X2,c1948)
| ~ attr(X3,X4)
| ~ agt(X5,X1)
| ~ sub(X2,firma_1_1)
| ~ subs(X5,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_764,c_0_762]),c_0_763])]) ).
cnf(c_0_766,hypothesis,
attr(c1947,c1948),
i_0_236 ).
cnf(c_0_767,hypothesis,
( ~ attr(X1,c1948)
| ~ attr(X2,X3)
| ~ agt(X4,c1947)
| ~ sub(X1,firma_1_1)
| ~ subs(X4,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_765,c_0_766]) ).
cnf(c_0_768,plain,
( sub(X1,X2)
| ~ sub(X3,X2)
| ~ sub(X1,X3) ),
i_0_745 ).
cnf(c_0_769,hypothesis,
sub(autobauer_1_1,firma_1_1),
i_0_255 ).
cnf(c_0_770,hypothesis,
( ~ attr(X1,X2)
| ~ agt(X3,c1947)
| ~ sub(c1947,firma_1_1)
| ~ subs(X3,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_767,c_0_766]) ).
cnf(c_0_771,plain,
( sub(X1,firma_1_1)
| ~ sub(X1,autobauer_1_1) ),
inference(spm,[status(thm)],[c_0_768,c_0_769]) ).
cnf(c_0_772,hypothesis,
sub(c1947,autobauer_1_1),
i_0_234 ).
cnf(c_0_773,plain,
( agt(X1,X2)
| ~ agt(X3,X2)
| ~ chea(X1,X3) ),
i_0_267 ).
cnf(c_0_774,plain,
( chea(esk14_3(X1,X2,X3),X1)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
i_0_276 ).
cnf(c_0_775,plain,
( ~ attr(X1,X2)
| ~ agt(X3,c1947)
| ~ subs(X3,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_770,c_0_771]),c_0_772])]) ).
cnf(c_0_776,plain,
( agt(esk14_3(X1,X2,X3),X4)
| ~ chea(X3,X2)
| ~ agt(X1,X4)
| ~ subs(X1,X2) ),
inference(spm,[status(thm)],[c_0_773,c_0_774]) ).
cnf(c_0_777,plain,
( ~ chea(X1,X2)
| ~ attr(X3,X4)
| ~ agt(X5,c1947)
| ~ subs(esk14_3(X5,X2,X1),n374bernehmen_1_1)
| ~ subs(X5,X2) ),
inference(spm,[status(thm)],[c_0_775,c_0_776]) ).
cnf(c_0_778,plain,
( subs(esk14_3(X1,X2,X3),X3)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
i_0_275 ).
cnf(c_0_779,plain,
( ~ chea(n374bernehmen_1_1,X1)
| ~ attr(X2,X3)
| ~ agt(X4,c1947)
| ~ subs(X4,X1) ),
inference(spm,[status(thm)],[c_0_777,c_0_778]) ).
cnf(c_0_780,plain,
chea(n374bernehmen_1_1,annahme_1_1),
i_0_451 ).
cnf(c_0_781,plain,
( ~ attr(X1,X2)
| ~ agt(X3,c1947)
| ~ subs(X3,annahme_1_1) ),
inference(spm,[status(thm)],[c_0_779,c_0_780]) ).
cnf(c_0_782,hypothesis,
agt(c1671,c1947),
i_0_245 ).
cnf(c_0_783,hypothesis,
subs(c1671,annahme_1_1),
i_0_242 ).
cnf(c_0_784,hypothesis,
attr(c1665,c1666),
i_0_251 ).
cnf(c_0_785,hypothesis,
~ attr(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_781,c_0_782]),c_0_783])]) ).
cnf(c_0_786,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_784,c_0_785]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR115+95 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 10 12:32:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.59 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.21/2.76 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 8.21/2.76 # Version: 2.1pre011
% 8.21/2.76 # Preprocessing time : 0.036 s
% 8.21/2.76
% 8.21/2.76 # Proof found!
% 8.21/2.76 # SZS status Theorem
% 8.21/2.76 # SZS output start CNFRefutation
% See solution above
% 8.21/2.76 # Proof object total steps : 40
% 8.21/2.76 # Proof object clause steps : 26
% 8.21/2.76 # Proof object formula steps : 14
% 8.21/2.76 # Proof object conjectures : 3
% 8.21/2.76 # Proof object clause conjectures : 2
% 8.21/2.76 # Proof object formula conjectures : 1
% 8.21/2.76 # Proof object initial clauses used : 14
% 8.21/2.76 # Proof object initial formulas used : 14
% 8.21/2.76 # Proof object generating inferences : 11
% 8.21/2.76 # Proof object simplifying inferences : 9
% 8.21/2.76 # Training examples: 0 positive, 0 negative
% 8.21/2.76 # Parsed axioms : 766
% 8.21/2.76 # Removed by relevancy pruning/SinE : 0
% 8.21/2.76 # Initial clauses : 766
% 8.21/2.76 # Removed in clause preprocessing : 0
% 8.21/2.76 # Initial clauses in saturation : 766
% 8.21/2.76 # Processed clauses : 1305
% 8.21/2.76 # ...of these trivial : 0
% 8.21/2.76 # ...subsumed : 75
% 8.21/2.76 # ...remaining for further processing : 1230
% 8.21/2.76 # Other redundant clauses eliminated : 0
% 8.21/2.76 # Clauses deleted for lack of memory : 0
% 8.21/2.76 # Backward-subsumed : 13
% 8.21/2.76 # Backward-rewritten : 0
% 8.21/2.76 # Generated clauses : 1692
% 8.21/2.76 # ...of the previous two non-trivial : 1670
% 8.21/2.76 # Contextual simplify-reflections : 16
% 8.21/2.76 # Paramodulations : 1689
% 8.21/2.76 # Factorizations : 0
% 8.21/2.76 # Equation resolutions : 0
% 8.21/2.76 # Propositional unsat checks : 0
% 8.21/2.76 # Propositional unsat check successes : 0
% 8.21/2.76 # Current number of processed clauses : 1214
% 8.21/2.76 # Positive orientable unit clauses : 514
% 8.21/2.76 # Positive unorientable unit clauses: 0
% 8.21/2.76 # Negative unit clauses : 2
% 8.21/2.76 # Non-unit-clauses : 698
% 8.21/2.76 # Current number of unprocessed clauses: 1071
% 8.21/2.76 # ...number of literals in the above : 4168
% 8.21/2.76 # Current number of archived formulas : 0
% 8.21/2.76 # Current number of archived clauses : 16
% 8.21/2.76 # Clause-clause subsumption calls (NU) : 170849
% 8.21/2.76 # Rec. Clause-clause subsumption calls : 19271
% 8.21/2.76 # Non-unit clause-clause subsumptions : 96
% 8.21/2.76 # Unit Clause-clause subsumption calls : 5642
% 8.21/2.76 # Rewrite failures with RHS unbound : 0
% 8.21/2.76 # BW rewrite match attempts : 4
% 8.21/2.76 # BW rewrite match successes : 2
% 8.21/2.76 # Condensation attempts : 0
% 8.21/2.76 # Condensation successes : 0
% 8.21/2.76 # Termbank termtop insertions : 45516
% 8.21/2.76
% 8.21/2.76 # -------------------------------------------------
% 8.21/2.76 # User time : 0.129 s
% 8.21/2.76 # System time : 0.007 s
% 8.21/2.76 # Total time : 0.136 s
% 8.21/2.76 # ...preprocessing : 0.036 s
% 8.21/2.76 # ...main loop : 0.100 s
% 8.21/2.76 # Maximum resident set size: 10764 pages
% 8.21/2.76
%------------------------------------------------------------------------------