TSTP Solution File: CSR105+6 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR105+6 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:48:01 EDT 2022
% Result : Theorem 131.58s 20.84s
% Output : CNFRefutation 131.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 18
% Syntax : Number of clauses : 78 ( 18 unt; 23 nHn; 48 RR)
% Number of literals : 172 ( 30 equ; 76 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 14 con; 0-3 aty)
% Number of variables : 133 ( 83 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2938,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(X3,s__SetOrClass) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_2938) ).
cnf(i_0_5016,negated_conjecture,
~ s__overlapsTemporally(s__TimeInterval36_1,s__TimeInterval36_2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_5016) ).
cnf(i_0_415,plain,
( s__instance(esk55_0,s__Object)
| ~ s__instance(X1,s__Chain) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_415) ).
cnf(i_0_2935,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(esk410_3(X3,X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_2935) ).
cnf(i_0_2936,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(esk409_3(X3,X1,X2),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_2936) ).
cnf(i_0_2374,plain,
( s__overlapsTemporally(X1,X1)
| ~ s__instance(X1,s__TimeInterval) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_2374) ).
cnf(i_0_5011,plain,
s__instance(s__TimeInterval36_1,s__TimeInterval),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_5011) ).
cnf(i_0_2369,plain,
( s__instance(s__caliber__m,s__Relation)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,s__Gun) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_2369) ).
cnf(i_0_2157,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_2157) ).
cnf(i_0_2375,plain,
( s__subclass(X1,X1)
| ~ s__instance(X1,s__SetOrClass) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_2375) ).
cnf(i_0_406,plain,
( s__crosses(esk55_0,esk56_0)
| ~ s__instance(X1,s__Chain) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_406) ).
cnf(i_0_416,plain,
( s__instance(esk56_0,s__Object)
| ~ s__instance(X1,s__Chain) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_416) ).
cnf(i_0_407,plain,
( s__crosses(esk54_0,esk55_0)
| ~ s__instance(X1,s__Chain) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_407) ).
cnf(i_0_414,plain,
( s__instance(esk54_0,s__Object)
| ~ s__instance(X1,s__Chain) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_414) ).
cnf(i_0_2476,plain,
( s__crosses(X1,X2)
| ~ s__crosses(X1,X3)
| ~ s__crosses(X3,X2)
| ~ s__instance(X1,s__Object)
| ~ s__instance(X3,s__Object)
| ~ s__instance(X2,s__Object) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_2476) ).
cnf(i_0_2943,plain,
( s__instance(X1,X2)
| X2 != s__UnionFn(X3,X4)
| ~ s__instance(X5,X2)
| ~ s__instance(X6,X4)
| ~ s__instance(X1,X3)
| ~ s__instance(X4,s__SetOrClass)
| ~ s__instance(X3,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_2943) ).
cnf(i_0_405,plain,
( ~ s__instance(X1,s__Chain)
| ~ s__crosses(esk54_0,esk56_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_405) ).
cnf(i_0_2964,plain,
s__instance(s__MonthDuration,s__UnitOfDuration),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x3n5qjik/input.p',i_0_2964) ).
cnf(c_0_5035,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(X3,s__SetOrClass) ),
i_0_2938 ).
cnf(c_0_5036,negated_conjecture,
~ s__overlapsTemporally(s__TimeInterval36_1,s__TimeInterval36_2),
i_0_5016 ).
cnf(c_0_5037,plain,
( X1 = X2
| s__instance(X3,s__SetOrClass) ),
inference(spm,[status(thm)],[c_0_5035,c_0_5035]) ).
cnf(c_0_5038,plain,
( s__instance(esk55_0,s__Object)
| ~ s__instance(X1,s__Chain) ),
i_0_415 ).
cnf(c_0_5039,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(esk410_3(X3,X1,X2),X1) ),
i_0_2935 ).
cnf(c_0_5040,plain,
( X1 = s__UnionFn(X2,X3)
| s__instance(esk409_3(X3,X1,X2),X3) ),
i_0_2936 ).
cnf(c_0_5041,negated_conjecture,
( s__instance(X1,s__SetOrClass)
| ~ s__overlapsTemporally(s__TimeInterval36_1,X2) ),
inference(spm,[status(thm)],[c_0_5036,c_0_5037]) ).
cnf(c_0_5042,plain,
( s__overlapsTemporally(X1,X1)
| ~ s__instance(X1,s__TimeInterval) ),
i_0_2374 ).
cnf(c_0_5043,plain,
s__instance(s__TimeInterval36_1,s__TimeInterval),
i_0_5011 ).
cnf(c_0_5044,plain,
( s__UnionFn(X1,X2) = s__Chain
| s__instance(esk55_0,s__Object) ),
inference(spm,[status(thm)],[c_0_5038,c_0_5039]) ).
cnf(c_0_5045,plain,
( X1 = s__UnionFn(X2,s__Chain)
| s__instance(esk55_0,s__Object) ),
inference(spm,[status(thm)],[c_0_5038,c_0_5040]) ).
cnf(c_0_5046,plain,
( s__instance(s__caliber__m,s__Relation)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,s__Gun) ),
i_0_2369 ).
cnf(c_0_5047,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
i_0_2157 ).
cnf(c_0_5048,plain,
( s__subclass(X1,X1)
| ~ s__instance(X1,s__SetOrClass) ),
i_0_2375 ).
cnf(c_0_5049,plain,
s__instance(X1,s__SetOrClass),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5041,c_0_5042]),c_0_5043])]) ).
cnf(c_0_5050,plain,
( s__crosses(esk55_0,esk56_0)
| ~ s__instance(X1,s__Chain) ),
i_0_406 ).
cnf(c_0_5051,plain,
( s__instance(esk56_0,s__Object)
| ~ s__instance(X1,s__Chain) ),
i_0_416 ).
cnf(c_0_5052,plain,
( X1 = s__Chain
| s__instance(esk55_0,s__Object) ),
inference(spm,[status(thm)],[c_0_5044,c_0_5045]) ).
cnf(c_0_5053,plain,
( s__instance(s__caliber__m,s__Relation)
| ~ s__subclass(X1,s__Gun) ),
inference(csr,[status(thm)],[c_0_5046,c_0_5047]) ).
cnf(c_0_5054,plain,
s__subclass(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5048,c_0_5049])]) ).
cnf(c_0_5055,plain,
( s__UnionFn(X1,X2) = s__Chain
| s__crosses(esk55_0,esk56_0) ),
inference(spm,[status(thm)],[c_0_5050,c_0_5039]) ).
cnf(c_0_5056,plain,
( X1 = s__UnionFn(X2,s__Chain)
| s__crosses(esk55_0,esk56_0) ),
inference(spm,[status(thm)],[c_0_5050,c_0_5040]) ).
cnf(c_0_5057,plain,
( s__UnionFn(X1,X2) = s__Chain
| s__instance(esk56_0,s__Object) ),
inference(spm,[status(thm)],[c_0_5051,c_0_5039]) ).
cnf(c_0_5058,plain,
( X1 = s__UnionFn(X2,s__Chain)
| s__instance(esk56_0,s__Object) ),
inference(spm,[status(thm)],[c_0_5051,c_0_5040]) ).
cnf(c_0_5059,plain,
( s__crosses(esk54_0,esk55_0)
| ~ s__instance(X1,s__Chain) ),
i_0_407 ).
cnf(c_0_5060,plain,
( s__instance(esk54_0,s__Object)
| ~ s__instance(X1,s__Chain) ),
i_0_414 ).
cnf(c_0_5061,plain,
( s__instance(esk55_0,s__Object)
| ~ s__instance(X1,X2) ),
inference(spm,[status(thm)],[c_0_5038,c_0_5052]) ).
cnf(c_0_5062,plain,
s__instance(s__caliber__m,s__Relation),
inference(spm,[status(thm)],[c_0_5053,c_0_5054]) ).
cnf(c_0_5063,plain,
( X1 = s__Chain
| s__crosses(esk55_0,esk56_0) ),
inference(spm,[status(thm)],[c_0_5055,c_0_5056]) ).
cnf(c_0_5064,plain,
( X1 = s__Chain
| s__instance(esk56_0,s__Object) ),
inference(spm,[status(thm)],[c_0_5057,c_0_5058]) ).
cnf(c_0_5065,plain,
( s__UnionFn(X1,X2) = s__Chain
| s__crosses(esk54_0,esk55_0) ),
inference(spm,[status(thm)],[c_0_5059,c_0_5039]) ).
cnf(c_0_5066,plain,
( X1 = s__UnionFn(X2,s__Chain)
| s__crosses(esk54_0,esk55_0) ),
inference(spm,[status(thm)],[c_0_5059,c_0_5040]) ).
cnf(c_0_5067,plain,
( s__UnionFn(X1,X2) = s__Chain
| s__instance(esk54_0,s__Object) ),
inference(spm,[status(thm)],[c_0_5060,c_0_5039]) ).
cnf(c_0_5068,plain,
( X1 = s__UnionFn(X2,s__Chain)
| s__instance(esk54_0,s__Object) ),
inference(spm,[status(thm)],[c_0_5060,c_0_5040]) ).
cnf(c_0_5069,plain,
( s__crosses(X1,X2)
| ~ s__crosses(X1,X3)
| ~ s__crosses(X3,X2)
| ~ s__instance(X1,s__Object)
| ~ s__instance(X3,s__Object)
| ~ s__instance(X2,s__Object) ),
i_0_2476 ).
cnf(c_0_5070,plain,
s__instance(esk55_0,s__Object),
inference(spm,[status(thm)],[c_0_5061,c_0_5062]) ).
cnf(c_0_5071,plain,
( s__crosses(esk55_0,esk56_0)
| ~ s__instance(X1,X2) ),
inference(spm,[status(thm)],[c_0_5050,c_0_5063]) ).
cnf(c_0_5072,plain,
( s__instance(esk56_0,s__Object)
| ~ s__instance(X1,X2) ),
inference(spm,[status(thm)],[c_0_5051,c_0_5064]) ).
cnf(c_0_5073,plain,
( X1 = s__Chain
| s__crosses(esk54_0,esk55_0) ),
inference(spm,[status(thm)],[c_0_5065,c_0_5066]) ).
cnf(c_0_5074,plain,
( X1 = s__Chain
| s__instance(esk54_0,s__Object) ),
inference(spm,[status(thm)],[c_0_5067,c_0_5068]) ).
cnf(c_0_5075,plain,
( s__instance(X1,X2)
| X2 != s__UnionFn(X3,X4)
| ~ s__instance(X5,X2)
| ~ s__instance(X6,X4)
| ~ s__instance(X1,X3)
| ~ s__instance(X4,s__SetOrClass)
| ~ s__instance(X3,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass) ),
i_0_2943 ).
cnf(c_0_5076,plain,
( s__crosses(X1,X2)
| ~ s__crosses(esk55_0,X2)
| ~ s__crosses(X1,esk55_0)
| ~ s__instance(X2,s__Object)
| ~ s__instance(X1,s__Object) ),
inference(spm,[status(thm)],[c_0_5069,c_0_5070]) ).
cnf(c_0_5077,plain,
s__crosses(esk55_0,esk56_0),
inference(spm,[status(thm)],[c_0_5071,c_0_5062]) ).
cnf(c_0_5078,plain,
s__instance(esk56_0,s__Object),
inference(spm,[status(thm)],[c_0_5072,c_0_5062]) ).
cnf(c_0_5079,plain,
( s__crosses(esk54_0,esk55_0)
| ~ s__instance(X1,X2) ),
inference(spm,[status(thm)],[c_0_5059,c_0_5073]) ).
cnf(c_0_5080,plain,
( s__instance(esk54_0,s__Object)
| ~ s__instance(X1,X2) ),
inference(spm,[status(thm)],[c_0_5060,c_0_5074]) ).
cnf(c_0_5081,plain,
( s__instance(X1,X2)
| X2 != s__UnionFn(X3,X4)
| ~ s__instance(X5,X4)
| ~ s__instance(X6,X2)
| ~ s__instance(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5075,c_0_5049]),c_0_5049]),c_0_5049])]) ).
cnf(c_0_5082,plain,
( ~ s__instance(X1,s__Chain)
| ~ s__crosses(esk54_0,esk56_0) ),
i_0_405 ).
cnf(c_0_5083,plain,
( s__crosses(X1,esk56_0)
| ~ s__crosses(X1,esk55_0)
| ~ s__instance(X1,s__Object) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5076,c_0_5077]),c_0_5078])]) ).
cnf(c_0_5084,plain,
s__crosses(esk54_0,esk55_0),
inference(spm,[status(thm)],[c_0_5079,c_0_5062]) ).
cnf(c_0_5085,plain,
s__instance(esk54_0,s__Object),
inference(spm,[status(thm)],[c_0_5080,c_0_5062]) ).
cnf(c_0_5086,plain,
( s__instance(X1,s__UnionFn(X2,X3))
| ~ s__instance(X4,s__UnionFn(X2,X3))
| ~ s__instance(X5,X3)
| ~ s__instance(X1,X2) ),
inference(er,[status(thm)],[c_0_5081]) ).
cnf(c_0_5087,plain,
~ s__instance(X1,s__Chain),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5082,c_0_5083]),c_0_5084]),c_0_5085])]) ).
cnf(c_0_5088,plain,
( X1 = s__UnionFn(X2,s__UnionFn(X3,X4))
| s__instance(X5,s__UnionFn(X3,X4))
| ~ s__instance(X6,X4)
| ~ s__instance(X5,X3) ),
inference(spm,[status(thm)],[c_0_5086,c_0_5040]) ).
cnf(c_0_5089,plain,
s__UnionFn(X1,X2) = s__Chain,
inference(spm,[status(thm)],[c_0_5087,c_0_5039]) ).
cnf(c_0_5090,plain,
( X1 = s__Chain
| ~ s__instance(X2,X3)
| ~ s__instance(X4,X5) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5088,c_0_5089]),c_0_5089]),c_0_5087]) ).
cnf(c_0_5091,plain,
( X1 = s__Chain
| ~ s__instance(X2,X3) ),
inference(spm,[status(thm)],[c_0_5090,c_0_5062]) ).
cnf(c_0_5092,plain,
s__instance(s__MonthDuration,s__UnitOfDuration),
i_0_2964 ).
cnf(c_0_5093,plain,
X1 = s__Chain,
inference(spm,[status(thm)],[c_0_5091,c_0_5062]) ).
cnf(c_0_5094,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5092,c_0_5093]),c_0_5093]),c_0_5087]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : CSR105+6 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n022.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 11:40:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 1.31/1.50 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.31/1.50 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 1.31/1.50 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 1.31/1.50 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 131.58/20.84 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 131.58/20.84 # Version: 2.1pre011
% 131.58/20.84 # Preprocessing time : 0.199 s
% 131.58/20.84
% 131.58/20.84 # Proof found!
% 131.58/20.84 # SZS status Theorem
% 131.58/20.84 # SZS output start CNFRefutation
% See solution above
% 131.58/20.84 # Proof object total steps : 78
% 131.58/20.84 # Proof object clause steps : 60
% 131.58/20.84 # Proof object formula steps : 18
% 131.58/20.84 # Proof object conjectures : 3
% 131.58/20.84 # Proof object clause conjectures : 2
% 131.58/20.84 # Proof object formula conjectures : 1
% 131.58/20.84 # Proof object initial clauses used : 18
% 131.58/20.84 # Proof object initial formulas used : 18
% 131.58/20.84 # Proof object generating inferences : 37
% 131.58/20.84 # Proof object simplifying inferences : 20
% 131.58/20.84 # Training examples: 0 positive, 0 negative
% 131.58/20.84 # Parsed axioms : 4841
% 131.58/20.84 # Removed by relevancy pruning/SinE : 0
% 131.58/20.84 # Initial clauses : 4841
% 131.58/20.84 # Removed in clause preprocessing : 0
% 131.58/20.84 # Initial clauses in saturation : 4841
% 131.58/20.84 # Processed clauses : 10033
% 131.58/20.84 # ...of these trivial : 16
% 131.58/20.84 # ...subsumed : 871
% 131.58/20.84 # ...remaining for further processing : 9146
% 131.58/20.84 # Other redundant clauses eliminated : 408
% 131.58/20.84 # Clauses deleted for lack of memory : 0
% 131.58/20.84 # Backward-subsumed : 156
% 131.58/20.84 # Backward-rewritten : 7509
% 131.58/20.84 # Generated clauses : 591143
% 131.58/20.84 # ...of the previous two non-trivial : 590383
% 131.58/20.84 # Contextual simplify-reflections : 1347
% 131.58/20.84 # Paramodulations : 590612
% 131.58/20.84 # Factorizations : 101
% 131.58/20.84 # Equation resolutions : 428
% 131.58/20.84 # Propositional unsat checks : 1
% 131.58/20.84 # Propositional unsat check successes : 0
% 131.58/20.84 # Current number of processed clauses : 1464
% 131.58/20.84 # Positive orientable unit clauses : 352
% 131.58/20.84 # Positive unorientable unit clauses: 1
% 131.58/20.84 # Negative unit clauses : 1
% 131.58/20.84 # Non-unit-clauses : 1110
% 131.58/20.84 # Current number of unprocessed clauses: 3318
% 131.58/20.84 # ...number of literals in the above : 14020
% 131.58/20.84 # Current number of archived formulas : 0
% 131.58/20.84 # Current number of archived clauses : 7668
% 131.58/20.84 # Clause-clause subsumption calls (NU) : 12595862
% 131.58/20.84 # Rec. Clause-clause subsumption calls : 651227
% 131.58/20.84 # Non-unit clause-clause subsumptions : 2335
% 131.58/20.84 # Unit Clause-clause subsumption calls : 769968
% 131.58/20.84 # Rewrite failures with RHS unbound : 0
% 131.58/20.84 # BW rewrite match attempts : 4688
% 131.58/20.84 # BW rewrite match successes : 4443
% 131.58/20.84 # Condensation attempts : 0
% 131.58/20.84 # Condensation successes : 0
% 131.58/20.84 # Termbank termtop insertions : 10808313
% 131.58/20.84
% 131.58/20.84 # -------------------------------------------------
% 131.58/20.84 # User time : 14.527 s
% 131.58/20.84 # System time : 0.221 s
% 131.58/20.84 # Total time : 14.748 s
% 131.58/20.84 # ...preprocessing : 0.199 s
% 131.58/20.84 # ...main loop : 14.549 s
% 131.58/20.84 # Maximum resident set size: 269336 pages
% 131.58/20.84
%------------------------------------------------------------------------------