TSTP Solution File: CSR115+91 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+91 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:27 EDT 2022
% Result : Theorem 6.97s 2.63s
% Output : CNFRefutation 6.97s
% 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_926,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-cvtehipj/input.p',i_0_926) ).
cnf(i_0_417,hypothesis,
val(c47503,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cvtehipj/input.p',i_0_417) ).
cnf(i_0_418,hypothesis,
sub(c47503,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cvtehipj/input.p',i_0_418) ).
cnf(i_0_420,hypothesis,
attr(c47502,c47503),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cvtehipj/input.p',i_0_420) ).
cnf(i_0_419,hypothesis,
sub(c47502,firma_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cvtehipj/input.p',i_0_419) ).
cnf(i_0_462,plain,
( subs(esk14_3(X1,X2,X3),X3)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cvtehipj/input.p',i_0_462) ).
cnf(i_0_638,plain,
chea(n374bernehmen_1_1,annahme_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cvtehipj/input.p',i_0_638) ).
cnf(i_0_425,hypothesis,
subs(c47465,annahme_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cvtehipj/input.p',i_0_425) ).
cnf(i_0_432,hypothesis,
attr(c47406,c47407),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cvtehipj/input.p',i_0_432) ).
cnf(c_0_936,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_926 ).
cnf(c_0_937,hypothesis,
val(c47503,bmw_0),
i_0_417 ).
cnf(c_0_938,hypothesis,
sub(c47503,name_1_1),
i_0_418 ).
cnf(c_0_939,negated_conjecture,
( ~ val(X1,bmw_0)
| ~ attr(X2,c47503)
| ~ 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_936,c_0_937]),c_0_938])]) ).
cnf(c_0_940,hypothesis,
( ~ attr(X1,c47503)
| ~ attr(X2,c47503)
| ~ 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_939,c_0_937]),c_0_938])]) ).
cnf(c_0_941,hypothesis,
attr(c47502,c47503),
i_0_420 ).
cnf(c_0_942,hypothesis,
sub(c47502,firma_1_1),
i_0_419 ).
cnf(c_0_943,hypothesis,
( ~ attr(X1,c47503)
| ~ attr(X2,X3)
| ~ subs(X4,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_940,c_0_941]),c_0_942])]) ).
cnf(c_0_944,hypothesis,
( ~ attr(X1,X2)
| ~ subs(X3,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_943,c_0_941]) ).
cnf(c_0_945,plain,
( subs(esk14_3(X1,X2,X3),X3)
| ~ subs(X1,X2)
| ~ chea(X3,X2) ),
i_0_462 ).
cnf(c_0_946,plain,
( ~ chea(n374bernehmen_1_1,X1)
| ~ attr(X2,X3)
| ~ subs(X4,X1) ),
inference(spm,[status(thm)],[c_0_944,c_0_945]) ).
cnf(c_0_947,plain,
chea(n374bernehmen_1_1,annahme_1_1),
i_0_638 ).
cnf(c_0_948,plain,
( ~ attr(X1,X2)
| ~ subs(X3,annahme_1_1) ),
inference(spm,[status(thm)],[c_0_946,c_0_947]) ).
cnf(c_0_949,hypothesis,
subs(c47465,annahme_1_1),
i_0_425 ).
cnf(c_0_950,hypothesis,
attr(c47406,c47407),
i_0_432 ).
cnf(c_0_951,hypothesis,
~ attr(X1,X2),
inference(spm,[status(thm)],[c_0_948,c_0_949]) ).
cnf(c_0_952,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_950,c_0_951]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : CSR115+91 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 : Sat Jun 11 04:27:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.40/0.59 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.40/0.59 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.40/0.59 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.40/0.59 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.97/2.63 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 6.97/2.63 # Version: 2.1pre011
% 6.97/2.63 # Preprocessing time : 0.022 s
% 6.97/2.63
% 6.97/2.63 # Proof found!
% 6.97/2.63 # SZS status Theorem
% 6.97/2.63 # SZS output start CNFRefutation
% See solution above
% 6.97/2.63 # Proof object total steps : 26
% 6.97/2.63 # Proof object clause steps : 17
% 6.97/2.63 # Proof object formula steps : 9
% 6.97/2.63 # Proof object conjectures : 3
% 6.97/2.63 # Proof object clause conjectures : 2
% 6.97/2.63 # Proof object formula conjectures : 1
% 6.97/2.63 # Proof object initial clauses used : 9
% 6.97/2.63 # Proof object initial formulas used : 9
% 6.97/2.63 # Proof object generating inferences : 7
% 6.97/2.63 # Proof object simplifying inferences : 7
% 6.97/2.63 # Training examples: 0 positive, 0 negative
% 6.97/2.63 # Parsed axioms : 946
% 6.97/2.63 # Removed by relevancy pruning/SinE : 0
% 6.97/2.63 # Initial clauses : 946
% 6.97/2.63 # Removed in clause preprocessing : 0
% 6.97/2.63 # Initial clauses in saturation : 946
% 6.97/2.63 # Processed clauses : 978
% 6.97/2.63 # ...of these trivial : 0
% 6.97/2.63 # ...subsumed : 0
% 6.97/2.63 # ...remaining for further processing : 978
% 6.97/2.63 # Other redundant clauses eliminated : 0
% 6.97/2.63 # Clauses deleted for lack of memory : 0
% 6.97/2.63 # Backward-subsumed : 6
% 6.97/2.63 # Backward-rewritten : 0
% 6.97/2.63 # Generated clauses : 792
% 6.97/2.63 # ...of the previous two non-trivial : 785
% 6.97/2.63 # Contextual simplify-reflections : 1
% 6.97/2.63 # Paramodulations : 789
% 6.97/2.63 # Factorizations : 0
% 6.97/2.63 # Equation resolutions : 0
% 6.97/2.63 # Propositional unsat checks : 0
% 6.97/2.63 # Propositional unsat check successes : 0
% 6.97/2.63 # Current number of processed clauses : 969
% 6.97/2.63 # Positive orientable unit clauses : 641
% 6.97/2.63 # Positive unorientable unit clauses: 0
% 6.97/2.63 # Negative unit clauses : 1
% 6.97/2.63 # Non-unit-clauses : 327
% 6.97/2.63 # Current number of unprocessed clauses: 746
% 6.97/2.63 # ...number of literals in the above : 2911
% 6.97/2.63 # Current number of archived formulas : 0
% 6.97/2.63 # Current number of archived clauses : 9
% 6.97/2.63 # Clause-clause subsumption calls (NU) : 25488
% 6.97/2.63 # Rec. Clause-clause subsumption calls : 9215
% 6.97/2.63 # Non-unit clause-clause subsumptions : 7
% 6.97/2.63 # Unit Clause-clause subsumption calls : 2179
% 6.97/2.63 # Rewrite failures with RHS unbound : 0
% 6.97/2.63 # BW rewrite match attempts : 0
% 6.97/2.63 # BW rewrite match successes : 0
% 6.97/2.63 # Condensation attempts : 0
% 6.97/2.63 # Condensation successes : 0
% 6.97/2.63 # Termbank termtop insertions : 26267
% 6.97/2.63
% 6.97/2.63 # -------------------------------------------------
% 6.97/2.63 # User time : 0.052 s
% 6.97/2.63 # System time : 0.003 s
% 6.97/2.63 # Total time : 0.056 s
% 6.97/2.63 # ...preprocessing : 0.022 s
% 6.97/2.63 # ...main loop : 0.034 s
% 6.97/2.63 # Maximum resident set size: 9972 pages
% 6.97/2.63
%------------------------------------------------------------------------------