TSTP Solution File: CSR115+81 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+81 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:25 EDT 2022
% Result : Theorem 4.79s 2.66s
% Output : CNFRefutation 4.79s
% 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 : 56 ( 0 equ; 43 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 34 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_701,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/sandbox/tmp/enigma-theBenchmark.p-qom7xe2y/input.p',i_0_701) ).
cnf(i_0_209,hypothesis,
val(c58,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qom7xe2y/input.p',i_0_209) ).
cnf(i_0_210,hypothesis,
sub(c58,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qom7xe2y/input.p',i_0_210) ).
cnf(i_0_212,hypothesis,
attr(c57,c58),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qom7xe2y/input.p',i_0_212) ).
cnf(i_0_211,hypothesis,
sub(c57,firma_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qom7xe2y/input.p',i_0_211) ).
cnf(i_0_216,hypothesis,
agt(c45,c57),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qom7xe2y/input.p',i_0_216) ).
cnf(i_0_213,hypothesis,
subs(c45,n374bernehmen_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qom7xe2y/input.p',i_0_213) ).
cnf(c_0_709,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_701 ).
cnf(c_0_710,hypothesis,
val(c58,bmw_0),
i_0_209 ).
cnf(c_0_711,hypothesis,
sub(c58,name_1_1),
i_0_210 ).
cnf(c_0_712,negated_conjecture,
( ~ val(X1,bmw_0)
| ~ attr(X2,c58)
| ~ 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_709,c_0_710]),c_0_711])]) ).
cnf(c_0_713,hypothesis,
( ~ attr(X1,c58)
| ~ attr(X2,c58)
| ~ 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_712,c_0_710]),c_0_711])]) ).
cnf(c_0_714,hypothesis,
attr(c57,c58),
i_0_212 ).
cnf(c_0_715,hypothesis,
( ~ attr(X1,c58)
| ~ attr(X2,X3)
| ~ agt(X4,c57)
| ~ sub(X1,firma_1_1)
| ~ subs(X4,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_713,c_0_714]) ).
cnf(c_0_716,hypothesis,
sub(c57,firma_1_1),
i_0_211 ).
cnf(c_0_717,hypothesis,
( ~ attr(X1,X2)
| ~ agt(X3,c57)
| ~ subs(X3,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_715,c_0_714]),c_0_716])]) ).
cnf(c_0_718,hypothesis,
agt(c45,c57),
i_0_216 ).
cnf(c_0_719,hypothesis,
subs(c45,n374bernehmen_1_1),
i_0_213 ).
cnf(c_0_720,hypothesis,
~ attr(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_717,c_0_718]),c_0_719])]) ).
cnf(c_0_721,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_714,c_0_720]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR115+81 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.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 01:54:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.39/0.60 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.39/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.39/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.79/2.66 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 4.79/2.66 # Version: 2.1pre011
% 4.79/2.66 # Preprocessing time : 0.022 s
% 4.79/2.66
% 4.79/2.66 # Proof found!
% 4.79/2.66 # SZS status Theorem
% 4.79/2.66 # SZS output start CNFRefutation
% See solution above
% 4.79/2.66 # Proof object total steps : 20
% 4.79/2.66 # Proof object clause steps : 13
% 4.79/2.66 # Proof object formula steps : 7
% 4.79/2.66 # Proof object conjectures : 3
% 4.79/2.66 # Proof object clause conjectures : 2
% 4.79/2.66 # Proof object formula conjectures : 1
% 4.79/2.66 # Proof object initial clauses used : 7
% 4.79/2.66 # Proof object initial formulas used : 7
% 4.79/2.66 # Proof object generating inferences : 5
% 4.79/2.66 # Proof object simplifying inferences : 9
% 4.79/2.66 # Training examples: 0 positive, 0 negative
% 4.79/2.66 # Parsed axioms : 721
% 4.79/2.66 # Removed by relevancy pruning/SinE : 0
% 4.79/2.66 # Initial clauses : 721
% 4.79/2.66 # Removed in clause preprocessing : 0
% 4.79/2.66 # Initial clauses in saturation : 721
% 4.79/2.66 # Processed clauses : 738
% 4.79/2.66 # ...of these trivial : 0
% 4.79/2.66 # ...subsumed : 0
% 4.79/2.66 # ...remaining for further processing : 738
% 4.79/2.66 # Other redundant clauses eliminated : 0
% 4.79/2.66 # Clauses deleted for lack of memory : 0
% 4.79/2.66 # Backward-subsumed : 1
% 4.79/2.66 # Backward-rewritten : 0
% 4.79/2.66 # Generated clauses : 1714
% 4.79/2.66 # ...of the previous two non-trivial : 1709
% 4.79/2.66 # Contextual simplify-reflections : 1
% 4.79/2.66 # Paramodulations : 1713
% 4.79/2.66 # Factorizations : 0
% 4.79/2.66 # Equation resolutions : 0
% 4.79/2.66 # Propositional unsat checks : 0
% 4.79/2.66 # Propositional unsat check successes : 0
% 4.79/2.66 # Current number of processed clauses : 736
% 4.79/2.66 # Positive orientable unit clauses : 415
% 4.79/2.66 # Positive unorientable unit clauses: 0
% 4.79/2.66 # Negative unit clauses : 1
% 4.79/2.66 # Non-unit-clauses : 320
% 4.79/2.66 # Current number of unprocessed clauses: 1692
% 4.79/2.66 # ...number of literals in the above : 5559
% 4.79/2.66 # Current number of archived formulas : 0
% 4.79/2.66 # Current number of archived clauses : 2
% 4.79/2.66 # Clause-clause subsumption calls (NU) : 23437
% 4.79/2.66 # Rec. Clause-clause subsumption calls : 8153
% 4.79/2.66 # Non-unit clause-clause subsumptions : 2
% 4.79/2.66 # Unit Clause-clause subsumption calls : 1386
% 4.79/2.66 # Rewrite failures with RHS unbound : 0
% 4.79/2.66 # BW rewrite match attempts : 1
% 4.79/2.66 # BW rewrite match successes : 0
% 4.79/2.66 # Condensation attempts : 0
% 4.79/2.66 # Condensation successes : 0
% 4.79/2.66 # Termbank termtop insertions : 33114
% 4.79/2.66
% 4.79/2.66 # -------------------------------------------------
% 4.79/2.66 # User time : 0.052 s
% 4.79/2.66 # System time : 0.007 s
% 4.79/2.66 # Total time : 0.059 s
% 4.79/2.66 # ...preprocessing : 0.022 s
% 4.79/2.66 # ...main loop : 0.036 s
% 4.79/2.66 # Maximum resident set size: 9440 pages
% 4.79/2.66
%------------------------------------------------------------------------------