TSTP Solution File: CSR050+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR050+2 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Sat May 4 07:31:43 EDT 2024
% Result : Theorem 0.40s 0.64s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 37 ( 20 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 15 ~; 12 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 11 con; 0-3 aty)
% Number of variables : 18 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query100,conjecture,
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32))
=> tptptypes_7_691(c_tptpcol_16_26939,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma)) ),
file('/export/starexec/sandbox/tmp/tmp.669RbpQ95J/E---3.1_21535.p',query100) ).
fof(ax1_1123,axiom,
! [X20,X21] :
( ( mtvisible(X20)
& genlmt(X20,X21) )
=> mtvisible(X21) ),
file('/export/starexec/sandbox/tmp/tmp.669RbpQ95J/E---3.1_21535.p',ax1_1123) ).
fof(ax1_338,axiom,
genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32),c_machinelearningspindleheadmt),
file('/export/starexec/sandbox/tmp/tmp.669RbpQ95J/E---3.1_21535.p',ax1_338) ).
fof(ax1_58,axiom,
genlmt(c_machinelearningspindleheadmt,c_miptdatabase19681997_termsmt),
file('/export/starexec/sandbox/tmp/tmp.669RbpQ95J/E---3.1_21535.p',ax1_58) ).
fof(ax1_87,axiom,
genlmt(c_ldscgeneralcollectormt,c_ldscdemonstrationspindleheadmt),
file('/export/starexec/sandbox/tmp/tmp.669RbpQ95J/E---3.1_21535.p',ax1_87) ).
fof(ax1_52,axiom,
genlmt(c_miptdatabase19681997_termsmt,c_ldscgeneralcollectormt),
file('/export/starexec/sandbox/tmp/tmp.669RbpQ95J/E---3.1_21535.p',ax1_52) ).
fof(ax1_59,axiom,
genlmt(c_ldscdemonstrationspindleheadmt,c_currentworlddatacollectormt_nonhomocentric),
file('/export/starexec/sandbox/tmp/tmp.669RbpQ95J/E---3.1_21535.p',ax1_59) ).
fof(ax1_482,axiom,
( mtvisible(c_currentworlddatacollectormt_nonhomocentric)
=> tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939) ),
file('/export/starexec/sandbox/tmp/tmp.669RbpQ95J/E---3.1_21535.p',ax1_482) ).
fof(ax1_57,axiom,
! [X5,X6] :
( tptptypes_9_693(X5,X6)
=> tptptypes_8_692(X5,X6) ),
file('/export/starexec/sandbox/tmp/tmp.669RbpQ95J/E---3.1_21535.p',ax1_57) ).
fof(ax1_144,axiom,
! [X5,X6] :
( tptptypes_8_692(X5,X6)
=> tptptypes_7_691(X6,X5) ),
file('/export/starexec/sandbox/tmp/tmp.669RbpQ95J/E---3.1_21535.p',ax1_144) ).
fof(c_0_10,negated_conjecture,
~ ( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32))
=> tptptypes_7_691(c_tptpcol_16_26939,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma)) ),
inference(assume_negation,[status(cth)],[query100]) ).
fof(c_0_11,plain,
! [X47,X48] :
( ~ mtvisible(X47)
| ~ genlmt(X47,X48)
| mtvisible(X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])])]) ).
fof(c_0_12,negated_conjecture,
( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32))
& ~ tptptypes_7_691(c_tptpcol_16_26939,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma)) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
cnf(c_0_13,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32),c_machinelearningspindleheadmt),
inference(split_conjunct,[status(thm)],[ax1_338]) ).
cnf(c_0_15,negated_conjecture,
mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
genlmt(c_machinelearningspindleheadmt,c_miptdatabase19681997_termsmt),
inference(split_conjunct,[status(thm)],[ax1_58]) ).
cnf(c_0_17,plain,
mtvisible(c_machinelearningspindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_18,plain,
genlmt(c_ldscgeneralcollectormt,c_ldscdemonstrationspindleheadmt),
inference(split_conjunct,[status(thm)],[ax1_87]) ).
cnf(c_0_19,plain,
genlmt(c_miptdatabase19681997_termsmt,c_ldscgeneralcollectormt),
inference(split_conjunct,[status(thm)],[ax1_52]) ).
cnf(c_0_20,plain,
mtvisible(c_miptdatabase19681997_termsmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_17])]) ).
cnf(c_0_21,plain,
genlmt(c_ldscdemonstrationspindleheadmt,c_currentworlddatacollectormt_nonhomocentric),
inference(split_conjunct,[status(thm)],[ax1_59]) ).
cnf(c_0_22,plain,
( mtvisible(c_ldscdemonstrationspindleheadmt)
| ~ mtvisible(c_ldscgeneralcollectormt) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_23,plain,
mtvisible(c_ldscgeneralcollectormt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_19]),c_0_20])]) ).
fof(c_0_24,plain,
( ~ mtvisible(c_currentworlddatacollectormt_nonhomocentric)
| tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_482])]) ).
cnf(c_0_25,plain,
( mtvisible(c_currentworlddatacollectormt_nonhomocentric)
| ~ mtvisible(c_ldscdemonstrationspindleheadmt) ),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_26,plain,
mtvisible(c_ldscdemonstrationspindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
fof(c_0_27,plain,
! [X58,X59] :
( ~ tptptypes_9_693(X58,X59)
| tptptypes_8_692(X58,X59) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_57])])]) ).
cnf(c_0_28,plain,
( tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939)
| ~ mtvisible(c_currentworlddatacollectormt_nonhomocentric) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
mtvisible(c_currentworlddatacollectormt_nonhomocentric),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
fof(c_0_30,plain,
! [X22,X23] :
( ~ tptptypes_8_692(X22,X23)
| tptptypes_7_691(X23,X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_144])])]) ).
cnf(c_0_31,plain,
( tptptypes_8_692(X1,X2)
| ~ tptptypes_9_693(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_33,plain,
( tptptypes_7_691(X2,X1)
| ~ tptptypes_8_692(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
tptptypes_8_692(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
~ tptptypes_7_691(c_tptpcol_16_26939,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.14 % Problem : CSR050+2 : TPTP v8.1.2. Released v3.4.0.
% 0.06/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n021.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 14:46:23 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.38/0.54 Running first-order theorem proving
% 0.38/0.54 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.669RbpQ95J/E---3.1_21535.p
% 0.40/0.64 # Version: 3.1.0
% 0.40/0.64 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.40/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.64 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.40/0.64 # Starting new_bool_3 with 600s (2) cores
% 0.40/0.64 # Starting new_bool_1 with 600s (2) cores
% 0.40/0.64 # Starting sh5l with 300s (1) cores
% 0.40/0.64 # sh5l with pid 21616 completed with status 0
% 0.40/0.64 # Result found by sh5l
% 0.40/0.64 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.40/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.64 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.40/0.64 # Starting new_bool_3 with 600s (2) cores
% 0.40/0.64 # Starting new_bool_1 with 600s (2) cores
% 0.40/0.64 # Starting sh5l with 300s (1) cores
% 0.40/0.64 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.40/0.64 # Search class: FHHNM-FSLM31-MFFFFFNN
% 0.40/0.64 # partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.40/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.40/0.64 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 21622 completed with status 0
% 0.40/0.64 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.40/0.64 # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.40/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.64 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.40/0.64 # Starting new_bool_3 with 600s (2) cores
% 0.40/0.64 # Starting new_bool_1 with 600s (2) cores
% 0.40/0.64 # Starting sh5l with 300s (1) cores
% 0.40/0.64 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.40/0.64 # Search class: FHHNM-FSLM31-MFFFFFNN
% 0.40/0.64 # partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.40/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.40/0.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.40/0.64 # Preprocessing time : 0.006 s
% 0.40/0.64 # Presaturation interreduction done
% 0.40/0.64
% 0.40/0.64 # Proof found!
% 0.40/0.64 # SZS status Theorem
% 0.40/0.64 # SZS output start CNFRefutation
% See solution above
% 0.40/0.64 # Parsed axioms : 1132
% 0.40/0.64 # Removed by relevancy pruning/SinE : 732
% 0.40/0.64 # Initial clauses : 401
% 0.40/0.64 # Removed in clause preprocessing : 0
% 0.40/0.64 # Initial clauses in saturation : 401
% 0.40/0.64 # Processed clauses : 951
% 0.40/0.64 # ...of these trivial : 16
% 0.40/0.64 # ...subsumed : 25
% 0.40/0.64 # ...remaining for further processing : 910
% 0.40/0.64 # Other redundant clauses eliminated : 0
% 0.40/0.64 # Clauses deleted for lack of memory : 0
% 0.40/0.64 # Backward-subsumed : 1
% 0.40/0.64 # Backward-rewritten : 6
% 0.40/0.64 # Generated clauses : 586
% 0.40/0.64 # ...of the previous two non-redundant : 503
% 0.40/0.64 # ...aggressively subsumed : 0
% 0.40/0.64 # Contextual simplify-reflections : 0
% 0.40/0.64 # Paramodulations : 586
% 0.40/0.64 # Factorizations : 0
% 0.40/0.64 # NegExts : 0
% 0.40/0.64 # Equation resolutions : 0
% 0.40/0.64 # Disequality decompositions : 0
% 0.40/0.64 # Total rewrite steps : 100
% 0.40/0.64 # ...of those cached : 47
% 0.40/0.64 # Propositional unsat checks : 0
% 0.40/0.64 # Propositional check models : 0
% 0.40/0.64 # Propositional check unsatisfiable : 0
% 0.40/0.64 # Propositional clauses : 0
% 0.40/0.64 # Propositional clauses after purity: 0
% 0.40/0.64 # Propositional unsat core size : 0
% 0.40/0.64 # Propositional preprocessing time : 0.000
% 0.40/0.64 # Propositional encoding time : 0.000
% 0.40/0.64 # Propositional solver time : 0.000
% 0.40/0.64 # Success case prop preproc time : 0.000
% 0.40/0.64 # Success case prop encoding time : 0.000
% 0.40/0.64 # Success case prop solver time : 0.000
% 0.40/0.64 # Current number of processed clauses : 527
% 0.40/0.64 # Positive orientable unit clauses : 221
% 0.40/0.64 # Positive unorientable unit clauses: 0
% 0.40/0.64 # Negative unit clauses : 55
% 0.40/0.64 # Non-unit-clauses : 251
% 0.40/0.64 # Current number of unprocessed clauses: 329
% 0.40/0.64 # ...number of literals in the above : 460
% 0.40/0.64 # Current number of archived formulas : 0
% 0.40/0.64 # Current number of archived clauses : 383
% 0.40/0.64 # Clause-clause subsumption calls (NU) : 22897
% 0.40/0.64 # Rec. Clause-clause subsumption calls : 21521
% 0.40/0.64 # Non-unit clause-clause subsumptions : 24
% 0.40/0.64 # Unit Clause-clause subsumption calls : 7050
% 0.40/0.64 # Rewrite failures with RHS unbound : 0
% 0.40/0.64 # BW rewrite match attempts : 5
% 0.40/0.64 # BW rewrite match successes : 5
% 0.40/0.64 # Condensation attempts : 0
% 0.40/0.64 # Condensation successes : 0
% 0.40/0.64 # Termbank termtop insertions : 29611
% 0.40/0.64 # Search garbage collected termcells : 5537
% 0.40/0.64
% 0.40/0.64 # -------------------------------------------------
% 0.40/0.64 # User time : 0.055 s
% 0.40/0.64 # System time : 0.014 s
% 0.40/0.64 # Total time : 0.069 s
% 0.40/0.64 # Maximum resident set size: 4824 pages
% 0.40/0.64
% 0.40/0.64 # -------------------------------------------------
% 0.40/0.64 # User time : 0.069 s
% 0.40/0.64 # System time : 0.019 s
% 0.40/0.64 # Total time : 0.088 s
% 0.40/0.64 # Maximum resident set size: 2660 pages
% 0.40/0.64 % E---3.1 exiting
% 0.40/0.65 % E exiting
%------------------------------------------------------------------------------