TSTP Solution File: CSR050+6 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : CSR050+6 : TPTP v8.1.0. Bugfixed v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 76.24s 68.63s
% Output : CNFRefutation 76.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 15 unt; 0 nHn; 24 RR)
% Number of literals : 35 ( 0 equ; 15 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 : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3490,plain,
( tptptypes_7_691(X1,X2)
| ~ tptptypes_8_692(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mbwudm_u/input.p',i_0_3490) ).
cnf(i_0_1267,plain,
( tptptypes_8_692(X1,X2)
| ~ tptptypes_9_693(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mbwudm_u/input.p',i_0_1267) ).
cnf(i_0_2525,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mbwudm_u/input.p',i_0_2525) ).
cnf(i_0_509,plain,
genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32),c_machinelearningspindleheadmt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mbwudm_u/input.p',i_0_509) ).
cnf(i_0_3502,negated_conjecture,
mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mbwudm_u/input.p',i_0_3502) ).
cnf(i_0_3501,negated_conjecture,
~ tptptypes_7_691(c_tptpcol_16_26939,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mbwudm_u/input.p',i_0_3501) ).
cnf(i_0_1996,plain,
genlmt(c_machinelearningspindleheadmt,c_analystdatabasemt),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mbwudm_u/input.p',i_0_1996) ).
cnf(i_0_580,plain,
( tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939)
| ~ mtvisible(c_currentworlddatacollectormt_nonhomocentric) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mbwudm_u/input.p',i_0_580) ).
cnf(i_0_22,plain,
genlmt(c_analystdatabasemt,c_currentworlddatacollectormt_nonhomocentric),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mbwudm_u/input.p',i_0_22) ).
cnf(c_0_3512,plain,
( tptptypes_7_691(X1,X2)
| ~ tptptypes_8_692(X2,X1) ),
i_0_3490 ).
cnf(c_0_3513,plain,
( tptptypes_8_692(X1,X2)
| ~ tptptypes_9_693(X1,X2) ),
i_0_1267 ).
cnf(c_0_3514,plain,
( mtvisible(X1)
| ~ mtvisible(X2)
| ~ genlmt(X2,X1) ),
i_0_2525 ).
cnf(c_0_3515,plain,
genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32),c_machinelearningspindleheadmt),
i_0_509 ).
cnf(c_0_3516,negated_conjecture,
mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32)),
i_0_3502 ).
cnf(c_0_3517,negated_conjecture,
~ tptptypes_7_691(c_tptpcol_16_26939,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma)),
i_0_3501 ).
cnf(c_0_3518,plain,
( tptptypes_7_691(X1,X2)
| ~ tptptypes_9_693(X2,X1) ),
inference(spm,[status(thm)],[c_0_3512,c_0_3513]) ).
cnf(c_0_3519,plain,
genlmt(c_machinelearningspindleheadmt,c_analystdatabasemt),
i_0_1996 ).
cnf(c_0_3520,plain,
mtvisible(c_machinelearningspindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3514,c_0_3515]),c_0_3516])]) ).
cnf(c_0_3521,negated_conjecture,
~ tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939),
inference(spm,[status(thm)],[c_0_3517,c_0_3518]) ).
cnf(c_0_3522,plain,
( tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939)
| ~ mtvisible(c_currentworlddatacollectormt_nonhomocentric) ),
i_0_580 ).
cnf(c_0_3523,plain,
genlmt(c_analystdatabasemt,c_currentworlddatacollectormt_nonhomocentric),
i_0_22 ).
cnf(c_0_3524,plain,
mtvisible(c_analystdatabasemt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3514,c_0_3519]),c_0_3520])]) ).
cnf(c_0_3525,plain,
~ mtvisible(c_currentworlddatacollectormt_nonhomocentric),
inference(spm,[status(thm)],[c_0_3521,c_0_3522]) ).
cnf(c_0_3526,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3514,c_0_3523]),c_0_3524])]),c_0_3525]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR050+6 : TPTP v8.1.0. Bugfixed v5.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.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 : Thu Jun 9 18:07:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 64.79/64.99 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 64.79/64.99 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 64.79/64.99 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 64.79/64.99 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 76.24/68.63 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 76.24/68.63 # Version: 2.1pre011
% 76.24/68.63 # Preprocessing time : 0.063 s
% 76.24/68.63
% 76.24/68.63 # Proof found!
% 76.24/68.63 # SZS status Theorem
% 76.24/68.63 # SZS output start CNFRefutation
% See solution above
% 76.24/68.63 # Proof object total steps : 24
% 76.24/68.63 # Proof object clause steps : 15
% 76.24/68.63 # Proof object formula steps : 9
% 76.24/68.63 # Proof object conjectures : 5
% 76.24/68.63 # Proof object clause conjectures : 3
% 76.24/68.63 # Proof object formula conjectures : 2
% 76.24/68.63 # Proof object initial clauses used : 9
% 76.24/68.63 # Proof object initial formulas used : 9
% 76.24/68.63 # Proof object generating inferences : 6
% 76.24/68.63 # Proof object simplifying inferences : 7
% 76.24/68.63 # Training examples: 0 positive, 0 negative
% 76.24/68.63 # Parsed axioms : 3500
% 76.24/68.63 # Removed by relevancy pruning/SinE : 0
% 76.24/68.63 # Initial clauses : 3500
% 76.24/68.63 # Removed in clause preprocessing : 0
% 76.24/68.63 # Initial clauses in saturation : 3500
% 76.24/68.63 # Processed clauses : 4213
% 76.24/68.63 # ...of these trivial : 324
% 76.24/68.63 # ...subsumed : 117
% 76.24/68.63 # ...remaining for further processing : 3771
% 76.24/68.63 # Other redundant clauses eliminated : 9
% 76.24/68.63 # Clauses deleted for lack of memory : 0
% 76.24/68.63 # Backward-subsumed : 4
% 76.24/68.63 # Backward-rewritten : 171
% 76.24/68.63 # Generated clauses : 7469
% 76.24/68.63 # ...of the previous two non-trivial : 6296
% 76.24/68.63 # Contextual simplify-reflections : 1
% 76.24/68.63 # Paramodulations : 7460
% 76.24/68.63 # Factorizations : 0
% 76.24/68.63 # Equation resolutions : 9
% 76.24/68.63 # Propositional unsat checks : 0
% 76.24/68.63 # Propositional unsat check successes : 0
% 76.24/68.63 # Current number of processed clauses : 3587
% 76.24/68.63 # Positive orientable unit clauses : 2469
% 76.24/68.63 # Positive unorientable unit clauses: 0
% 76.24/68.63 # Negative unit clauses : 257
% 76.24/68.63 # Non-unit-clauses : 861
% 76.24/68.63 # Current number of unprocessed clauses: 5069
% 76.24/68.63 # ...number of literals in the above : 9264
% 76.24/68.63 # Current number of archived formulas : 0
% 76.24/68.63 # Current number of archived clauses : 175
% 76.24/68.63 # Clause-clause subsumption calls (NU) : 137697
% 76.24/68.63 # Rec. Clause-clause subsumption calls : 106370
% 76.24/68.63 # Non-unit clause-clause subsumptions : 111
% 76.24/68.63 # Unit Clause-clause subsumption calls : 205881
% 76.24/68.63 # Rewrite failures with RHS unbound : 0
% 76.24/68.63 # BW rewrite match attempts : 8606
% 76.24/68.63 # BW rewrite match successes : 104
% 76.24/68.63 # Condensation attempts : 0
% 76.24/68.63 # Condensation successes : 0
% 76.24/68.63 # Termbank termtop insertions : 116856
% 76.24/68.63
% 76.24/68.63 # -------------------------------------------------
% 76.24/68.63 # User time : 0.296 s
% 76.24/68.63 # System time : 0.022 s
% 76.24/68.63 # Total time : 0.318 s
% 76.24/68.63 # ...preprocessing : 0.063 s
% 76.24/68.63 # ...main loop : 0.255 s
% 76.24/68.63 # Maximum resident set size: 27016 pages
% 76.24/68.63
%------------------------------------------------------------------------------