TSTP Solution File: CSR050+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR050+4 : TPTP v8.1.0. Released v3.4.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:47:02 EDT 2022
% Result : Theorem 10.37s 3.73s
% Output : CNFRefutation 10.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 16 unt; 0 nHn; 24 RR)
% Number of literals : 34 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-3 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2534,negated_conjecture,
~ tptptypes_7_691(c_tptpcol_16_26939,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lmu93k5t/input.p',i_0_2534) ).
cnf(i_0_1117,plain,
( tptptypes_7_691(X1,X2)
| ~ tptptypes_8_692(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lmu93k5t/input.p',i_0_1117) ).
cnf(i_0_664,plain,
( tptptypes_8_692(X1,X2)
| ~ tptptypes_9_693(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lmu93k5t/input.p',i_0_664) ).
cnf(i_0_111,plain,
( tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939)
| ~ mtvisible(c_currentworlddatacollectormt_nonhomocentric) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lmu93k5t/input.p',i_0_111) ).
cnf(i_0_2215,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lmu93k5t/input.p',i_0_2215) ).
cnf(i_0_201,plain,
genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32),c_machinelearningspindleheadmt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lmu93k5t/input.p',i_0_201) ).
cnf(i_0_2535,negated_conjecture,
mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lmu93k5t/input.p',i_0_2535) ).
cnf(i_0_2287,plain,
genlmt(c_ldscgeneralcollectormt,c_currentworlddatacollectormt_nonhomocentric),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lmu93k5t/input.p',i_0_2287) ).
cnf(i_0_81,plain,
genlmt(c_machinelearningspindleheadmt,c_ldscgeneralcollectormt),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lmu93k5t/input.p',i_0_81) ).
cnf(c_0_2545,negated_conjecture,
~ tptptypes_7_691(c_tptpcol_16_26939,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma)),
i_0_2534 ).
cnf(c_0_2546,plain,
( tptptypes_7_691(X1,X2)
| ~ tptptypes_8_692(X2,X1) ),
i_0_1117 ).
cnf(c_0_2547,negated_conjecture,
~ tptptypes_8_692(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939),
inference(spm,[status(thm)],[c_0_2545,c_0_2546]) ).
cnf(c_0_2548,plain,
( tptptypes_8_692(X1,X2)
| ~ tptptypes_9_693(X1,X2) ),
i_0_664 ).
cnf(c_0_2549,plain,
~ tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939),
inference(spm,[status(thm)],[c_0_2547,c_0_2548]) ).
cnf(c_0_2550,plain,
( tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939)
| ~ mtvisible(c_currentworlddatacollectormt_nonhomocentric) ),
i_0_111 ).
cnf(c_0_2551,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2215 ).
cnf(c_0_2552,plain,
genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32),c_machinelearningspindleheadmt),
i_0_201 ).
cnf(c_0_2553,negated_conjecture,
mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32)),
i_0_2535 ).
cnf(c_0_2554,plain,
genlmt(c_ldscgeneralcollectormt,c_currentworlddatacollectormt_nonhomocentric),
i_0_2287 ).
cnf(c_0_2555,plain,
~ mtvisible(c_currentworlddatacollectormt_nonhomocentric),
inference(spm,[status(thm)],[c_0_2549,c_0_2550]) ).
cnf(c_0_2556,plain,
genlmt(c_machinelearningspindleheadmt,c_ldscgeneralcollectormt),
i_0_81 ).
cnf(c_0_2557,plain,
mtvisible(c_machinelearningspindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2551,c_0_2552]),c_0_2553])]) ).
cnf(c_0_2558,plain,
~ mtvisible(c_ldscgeneralcollectormt),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2551,c_0_2554]),c_0_2555]) ).
cnf(c_0_2559,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2551,c_0_2556]),c_0_2557])]),c_0_2558]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : CSR050+4 : TPTP v8.1.0. Released v3.4.0.
% 0.10/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 17:54:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.76/0.94 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.76/0.94 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.76/0.94 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.76/0.94 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.37/3.73 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y:
% 10.37/3.73 # Version: 2.1pre011
% 10.37/3.73 # Preprocessing time : 0.046 s
% 10.37/3.73
% 10.37/3.73 # Proof found!
% 10.37/3.73 # SZS status Theorem
% 10.37/3.73 # SZS output start CNFRefutation
% See solution above
% 10.37/3.73 # Proof object total steps : 24
% 10.37/3.73 # Proof object clause steps : 15
% 10.37/3.73 # Proof object formula steps : 9
% 10.37/3.73 # Proof object conjectures : 5
% 10.37/3.73 # Proof object clause conjectures : 3
% 10.37/3.73 # Proof object formula conjectures : 2
% 10.37/3.73 # Proof object initial clauses used : 9
% 10.37/3.73 # Proof object initial formulas used : 9
% 10.37/3.73 # Proof object generating inferences : 6
% 10.37/3.73 # Proof object simplifying inferences : 6
% 10.37/3.73 # Training examples: 0 positive, 0 negative
% 10.37/3.73 # Parsed axioms : 2534
% 10.37/3.73 # Removed by relevancy pruning/SinE : 0
% 10.37/3.73 # Initial clauses : 2534
% 10.37/3.73 # Removed in clause preprocessing : 0
% 10.37/3.73 # Initial clauses in saturation : 2534
% 10.37/3.73 # Processed clauses : 3061
% 10.37/3.73 # ...of these trivial : 170
% 10.37/3.73 # ...subsumed : 87
% 10.37/3.73 # ...remaining for further processing : 2803
% 10.37/3.73 # Other redundant clauses eliminated : 2
% 10.37/3.73 # Clauses deleted for lack of memory : 0
% 10.37/3.73 # Backward-subsumed : 3
% 10.37/3.73 # Backward-rewritten : 41
% 10.37/3.73 # Generated clauses : 6261
% 10.37/3.73 # ...of the previous two non-trivial : 5164
% 10.37/3.73 # Contextual simplify-reflections : 8
% 10.37/3.73 # Paramodulations : 6259
% 10.37/3.73 # Factorizations : 0
% 10.37/3.73 # Equation resolutions : 2
% 10.37/3.73 # Propositional unsat checks : 0
% 10.37/3.73 # Propositional unsat check successes : 0
% 10.37/3.73 # Current number of processed clauses : 2757
% 10.37/3.73 # Positive orientable unit clauses : 1394
% 10.37/3.73 # Positive unorientable unit clauses: 0
% 10.37/3.73 # Negative unit clauses : 279
% 10.37/3.73 # Non-unit-clauses : 1084
% 10.37/3.73 # Current number of unprocessed clauses: 4517
% 10.37/3.73 # ...number of literals in the above : 7937
% 10.37/3.73 # Current number of archived formulas : 0
% 10.37/3.73 # Current number of archived clauses : 44
% 10.37/3.73 # Clause-clause subsumption calls (NU) : 196774
% 10.37/3.73 # Rec. Clause-clause subsumption calls : 182969
% 10.37/3.73 # Non-unit clause-clause subsumptions : 95
% 10.37/3.73 # Unit Clause-clause subsumption calls : 128401
% 10.37/3.73 # Rewrite failures with RHS unbound : 0
% 10.37/3.73 # BW rewrite match attempts : 3163
% 10.37/3.73 # BW rewrite match successes : 25
% 10.37/3.73 # Condensation attempts : 0
% 10.37/3.73 # Condensation successes : 0
% 10.37/3.73 # Termbank termtop insertions : 98003
% 10.37/3.73
% 10.37/3.73 # -------------------------------------------------
% 10.37/3.73 # User time : 0.239 s
% 10.37/3.73 # System time : 0.014 s
% 10.37/3.73 # Total time : 0.253 s
% 10.37/3.73 # ...preprocessing : 0.046 s
% 10.37/3.73 # ...main loop : 0.207 s
% 10.37/3.73 # Maximum resident set size: 22292 pages
% 10.37/3.73
%------------------------------------------------------------------------------