TSTP Solution File: CSR115+52 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+52 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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 9.56s 3.08s
% Output : CNFRefutation 9.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 14 unt; 0 nHn; 20 RR)
% Number of literals : 51 ( 0 equ; 38 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 34 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_686,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)
| ~ val(X7,bmw_0)
| ~ val(X6,bmw_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p5ff9gku/input.p',i_0_686) ).
cnf(i_0_185,hypothesis,
val(c166,bmw_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p5ff9gku/input.p',i_0_185) ).
cnf(i_0_186,hypothesis,
sub(c166,name_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p5ff9gku/input.p',i_0_186) ).
cnf(i_0_189,hypothesis,
attr(c165,c166),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p5ff9gku/input.p',i_0_189) ).
cnf(i_0_192,hypothesis,
agt(c163,c165),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p5ff9gku/input.p',i_0_192) ).
cnf(i_0_190,hypothesis,
subs(c163,n374bernehmen_1_1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p5ff9gku/input.p',i_0_190) ).
cnf(i_0_196,hypothesis,
attr(c0,c1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p5ff9gku/input.p',i_0_196) ).
cnf(c_0_694,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)
| ~ val(X7,bmw_0)
| ~ val(X6,bmw_0) ),
i_0_686 ).
cnf(c_0_695,hypothesis,
val(c166,bmw_0),
i_0_185 ).
cnf(c_0_696,hypothesis,
sub(c166,name_1_1),
i_0_186 ).
cnf(c_0_697,negated_conjecture,
( ~ val(X1,bmw_0)
| ~ attr(X2,c166)
| ~ attr(X3,X1)
| ~ attr(X4,X5)
| ~ agt(X6,X2)
| ~ sub(X1,name_1_1)
| ~ subs(X6,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_694,c_0_695]),c_0_696])]) ).
cnf(c_0_698,hypothesis,
( ~ attr(X1,c166)
| ~ attr(X2,c166)
| ~ attr(X3,X4)
| ~ agt(X5,X1)
| ~ subs(X5,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_697,c_0_695]),c_0_696])]) ).
cnf(c_0_699,hypothesis,
attr(c165,c166),
i_0_189 ).
cnf(c_0_700,hypothesis,
( ~ attr(X1,c166)
| ~ attr(X2,X3)
| ~ agt(X4,c165)
| ~ subs(X4,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_698,c_0_699]) ).
cnf(c_0_701,hypothesis,
( ~ attr(X1,X2)
| ~ agt(X3,c165)
| ~ subs(X3,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_700,c_0_699]) ).
cnf(c_0_702,hypothesis,
agt(c163,c165),
i_0_192 ).
cnf(c_0_703,hypothesis,
subs(c163,n374bernehmen_1_1),
i_0_190 ).
cnf(c_0_704,hypothesis,
attr(c0,c1),
i_0_196 ).
cnf(c_0_705,hypothesis,
~ attr(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_701,c_0_702]),c_0_703])]) ).
cnf(c_0_706,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_704,c_0_705]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : CSR115+52 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.15 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.36 % Computer : n009.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jun 11 17:31:09 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.49 # ENIGMATIC: Selected SinE mode:
% 0.46/0.65 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.46/0.65 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.46/0.65 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.46/0.65 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.56/3.08 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 9.56/3.08 # Version: 2.1pre011
% 9.56/3.08 # Preprocessing time : 0.025 s
% 9.56/3.08
% 9.56/3.08 # Proof found!
% 9.56/3.08 # SZS status Theorem
% 9.56/3.08 # SZS output start CNFRefutation
% See solution above
% 9.56/3.08 # Proof object total steps : 20
% 9.56/3.08 # Proof object clause steps : 13
% 9.56/3.08 # Proof object formula steps : 7
% 9.56/3.08 # Proof object conjectures : 3
% 9.56/3.08 # Proof object clause conjectures : 2
% 9.56/3.08 # Proof object formula conjectures : 1
% 9.56/3.08 # Proof object initial clauses used : 7
% 9.56/3.08 # Proof object initial formulas used : 7
% 9.56/3.08 # Proof object generating inferences : 5
% 9.56/3.08 # Proof object simplifying inferences : 7
% 9.56/3.08 # Training examples: 0 positive, 0 negative
% 9.56/3.08 # Parsed axioms : 706
% 9.56/3.08 # Removed by relevancy pruning/SinE : 0
% 9.56/3.08 # Initial clauses : 706
% 9.56/3.08 # Removed in clause preprocessing : 0
% 9.56/3.08 # Initial clauses in saturation : 706
% 9.56/3.08 # Processed clauses : 726
% 9.56/3.08 # ...of these trivial : 0
% 9.56/3.08 # ...subsumed : 0
% 9.56/3.08 # ...remaining for further processing : 726
% 9.56/3.08 # Other redundant clauses eliminated : 0
% 9.56/3.08 # Clauses deleted for lack of memory : 0
% 9.56/3.08 # Backward-subsumed : 2
% 9.56/3.08 # Backward-rewritten : 0
% 9.56/3.08 # Generated clauses : 1703
% 9.56/3.08 # ...of the previous two non-trivial : 1696
% 9.56/3.08 # Contextual simplify-reflections : 1
% 9.56/3.08 # Paramodulations : 1700
% 9.56/3.08 # Factorizations : 0
% 9.56/3.08 # Equation resolutions : 0
% 9.56/3.08 # Propositional unsat checks : 0
% 9.56/3.08 # Propositional unsat check successes : 0
% 9.56/3.08 # Current number of processed clauses : 721
% 9.56/3.08 # Positive orientable unit clauses : 398
% 9.56/3.08 # Positive unorientable unit clauses: 0
% 9.56/3.08 # Negative unit clauses : 1
% 9.56/3.08 # Non-unit-clauses : 322
% 9.56/3.08 # Current number of unprocessed clauses: 1676
% 9.56/3.08 # ...number of literals in the above : 5530
% 9.56/3.08 # Current number of archived formulas : 0
% 9.56/3.08 # Current number of archived clauses : 5
% 9.56/3.08 # Clause-clause subsumption calls (NU) : 18865
% 9.56/3.08 # Rec. Clause-clause subsumption calls : 6767
% 9.56/3.08 # Non-unit clause-clause subsumptions : 3
% 9.56/3.08 # Unit Clause-clause subsumption calls : 897
% 9.56/3.08 # Rewrite failures with RHS unbound : 0
% 9.56/3.08 # BW rewrite match attempts : 1
% 9.56/3.08 # BW rewrite match successes : 0
% 9.56/3.08 # Condensation attempts : 0
% 9.56/3.08 # Condensation successes : 0
% 9.56/3.08 # Termbank termtop insertions : 32811
% 9.56/3.08
% 9.56/3.08 # -------------------------------------------------
% 9.56/3.08 # User time : 0.049 s
% 9.56/3.08 # System time : 0.011 s
% 9.56/3.08 # Total time : 0.060 s
% 9.56/3.08 # ...preprocessing : 0.025 s
% 9.56/3.08 # ...main loop : 0.035 s
% 9.56/3.08 # Maximum resident set size: 9348 pages
% 9.56/3.08
%------------------------------------------------------------------------------