%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR115+51 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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 6.46s 2.81s
% Output : CNFRefutation 6.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 18 unt; 0 nHn; 23 RR)
% Number of literals : 49 ( 0 equ; 32 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 10 con; 0-0 aty)
% Number of variables : 26 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_686,negated_conjecture,
( ~ agt(X1,X2)
| ~ obj(X1,X3)
| ~ attr(X4,X5)
| ~ attr(X2,X6)
| ~ subs(X1,n374bernehmen_1_1)
| ~ sub(X6,name_1_1)
| ~ prop(X3,britisch__1_1)
| ~ val(X6,bmw_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7pjrzj1y/input.p',i_0_686) ).
cnf(i_0_185,hypothesis,
val(c166,bmw_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7pjrzj1y/input.p',i_0_185) ).
cnf(i_0_186,hypothesis,
sub(c166,name_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7pjrzj1y/input.p',i_0_186) ).
cnf(i_0_189,hypothesis,
attr(c165,c166),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7pjrzj1y/input.p',i_0_189) ).
cnf(i_0_182,hypothesis,
prop(c218,britisch__1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7pjrzj1y/input.p',i_0_182) ).
cnf(i_0_191,hypothesis,
obj(c163,c218),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7pjrzj1y/input.p',i_0_191) ).
cnf(i_0_192,hypothesis,
agt(c163,c165),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7pjrzj1y/input.p',i_0_192) ).
cnf(i_0_190,hypothesis,
subs(c163,n374bernehmen_1_1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7pjrzj1y/input.p',i_0_190) ).
cnf(i_0_196,hypothesis,
attr(c0,c1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7pjrzj1y/input.p',i_0_196) ).
cnf(c_0_696,negated_conjecture,
( ~ agt(X1,X2)
| ~ obj(X1,X3)
| ~ attr(X4,X5)
| ~ attr(X2,X6)
| ~ subs(X1,n374bernehmen_1_1)
| ~ sub(X6,name_1_1)
| ~ prop(X3,britisch__1_1)
| ~ val(X6,bmw_0) ),
i_0_686 ).
cnf(c_0_697,hypothesis,
val(c166,bmw_0),
i_0_185 ).
cnf(c_0_698,hypothesis,
sub(c166,name_1_1),
i_0_186 ).
cnf(c_0_699,negated_conjecture,
( ~ attr(X1,c166)
| ~ attr(X2,X3)
| ~ prop(X4,britisch__1_1)
| ~ obj(X5,X4)
| ~ agt(X5,X1)
| ~ subs(X5,n374bernehmen_1_1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_696,c_0_697]),c_0_698])]) ).
cnf(c_0_700,hypothesis,
attr(c165,c166),
i_0_189 ).
cnf(c_0_701,hypothesis,
( ~ attr(X1,X2)
| ~ prop(X3,britisch__1_1)
| ~ obj(X4,X3)
| ~ agt(X4,c165)
| ~ subs(X4,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_699,c_0_700]) ).
cnf(c_0_702,hypothesis,
prop(c218,britisch__1_1),
i_0_182 ).
cnf(c_0_703,hypothesis,
( ~ attr(X1,X2)
| ~ obj(X3,c218)
| ~ agt(X3,c165)
| ~ subs(X3,n374bernehmen_1_1) ),
inference(spm,[status(thm)],[c_0_701,c_0_702]) ).
cnf(c_0_704,hypothesis,
obj(c163,c218),
i_0_191 ).
cnf(c_0_705,hypothesis,
agt(c163,c165),
i_0_192 ).
cnf(c_0_706,hypothesis,
subs(c163,n374bernehmen_1_1),
i_0_190 ).
cnf(c_0_707,hypothesis,
attr(c0,c1),
i_0_196 ).
cnf(c_0_708,hypothesis,
~ attr(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_703,c_0_704]),c_0_705]),c_0_706])]) ).
cnf(c_0_709,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_707,c_0_708]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : CSR115+51 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 08:13:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.42/0.62 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.42/0.62 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.42/0.62 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.42/0.62 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.46/2.81 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 6.46/2.81 # Version: 2.1pre011
% 6.46/2.81 # Preprocessing time : 0.021 s
% 6.46/2.81
% 6.46/2.81 # Proof found!
% 6.46/2.81 # SZS status Theorem
% 6.46/2.81 # SZS output start CNFRefutation
% See solution above
% 6.46/2.81 # Proof object total steps : 23
% 6.46/2.81 # Proof object clause steps : 14
% 6.46/2.81 # Proof object formula steps : 9
% 6.46/2.81 # Proof object conjectures : 3
% 6.46/2.81 # Proof object clause conjectures : 2
% 6.46/2.81 # Proof object formula conjectures : 1
% 6.46/2.81 # Proof object initial clauses used : 9
% 6.46/2.81 # Proof object initial formulas used : 9
% 6.46/2.81 # Proof object generating inferences : 4
% 6.46/2.81 # Proof object simplifying inferences : 6
% 6.46/2.81 # Training examples: 0 positive, 0 negative
% 6.46/2.81 # Parsed axioms : 706
% 6.46/2.81 # Removed by relevancy pruning/SinE : 0
% 6.46/2.81 # Initial clauses : 706
% 6.46/2.81 # Removed in clause preprocessing : 0
% 6.46/2.81 # Initial clauses in saturation : 706
% 6.46/2.81 # Processed clauses : 717
% 6.46/2.81 # ...of these trivial : 0
% 6.46/2.81 # ...subsumed : 0
% 6.46/2.81 # ...remaining for further processing : 717
% 6.46/2.81 # Other redundant clauses eliminated : 0
% 6.46/2.81 # Clauses deleted for lack of memory : 0
% 6.46/2.81 # Backward-subsumed : 0
% 6.46/2.81 # Backward-rewritten : 0
% 6.46/2.81 # Generated clauses : 889
% 6.46/2.81 # ...of the previous two non-trivial : 882
% 6.46/2.81 # Contextual simplify-reflections : 0
% 6.46/2.81 # Paramodulations : 886
% 6.46/2.81 # Factorizations : 0
% 6.46/2.81 # Equation resolutions : 0
% 6.46/2.81 # Propositional unsat checks : 0
% 6.46/2.81 # Propositional unsat check successes : 0
% 6.46/2.81 # Current number of processed clauses : 714
% 6.46/2.81 # Positive orientable unit clauses : 397
% 6.46/2.81 # Positive unorientable unit clauses: 0
% 6.46/2.81 # Negative unit clauses : 1
% 6.46/2.81 # Non-unit-clauses : 316
% 6.46/2.81 # Current number of unprocessed clauses: 871
% 6.46/2.81 # ...number of literals in the above : 3125
% 6.46/2.81 # Current number of archived formulas : 0
% 6.46/2.81 # Current number of archived clauses : 3
% 6.46/2.81 # Clause-clause subsumption calls (NU) : 18456
% 6.46/2.81 # Rec. Clause-clause subsumption calls : 6760
% 6.46/2.81 # Non-unit clause-clause subsumptions : 0
% 6.46/2.81 # Unit Clause-clause subsumption calls : 865
% 6.46/2.81 # Rewrite failures with RHS unbound : 0
% 6.46/2.81 # BW rewrite match attempts : 1
% 6.46/2.81 # BW rewrite match successes : 0
% 6.46/2.81 # Condensation attempts : 0
% 6.46/2.81 # Condensation successes : 0
% 6.46/2.81 # Termbank termtop insertions : 24965
% 6.46/2.81
% 6.46/2.81 # -------------------------------------------------
% 6.46/2.81 # User time : 0.045 s
% 6.46/2.81 # System time : 0.003 s
% 6.46/2.81 # Total time : 0.048 s
% 6.46/2.81 # ...preprocessing : 0.021 s
% 6.46/2.81 # ...main loop : 0.027 s
% 6.46/2.81 # Maximum resident set size: 8820 pages
% 6.46/2.81
%------------------------------------------------------------------------------