TSTP Solution File: CSR050+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR050+3 : TPTP v8.2.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : Mon May 20 19:13:39 EDT 2024
% Result : Theorem 0.46s 0.68s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 14 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 17 ~; 10 |; 2 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 18 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(query150,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/sandbox2/benchmark/theBenchmark.p',query150) ).
fof(ax2_1024,axiom,
! [X3,X4] :
( tptptypes_8_692(X3,X4)
=> tptptypes_7_691(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1024) ).
fof(ax2_1858,axiom,
! [X3,X4] :
( tptptypes_9_693(X3,X4)
=> tptptypes_8_692(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1858) ).
fof(ax2_1259,axiom,
( mtvisible(c_currentworlddatacollectormt_nonhomocentric)
=> tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1259) ).
fof(ax2_7997,axiom,
! [X21,X22] :
( ( mtvisible(X21)
& genlmt(X21,X22) )
=> mtvisible(X22) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_7997) ).
fof(ax2_1040,axiom,
genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32),c_machinelearningspindleheadmt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1040) ).
fof(ax2_3183,axiom,
genlmt(c_ldscgeneralcollectormt,c_currentworlddatacollectormt_nonhomocentric),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_3183) ).
fof(ax2_826,axiom,
genlmt(c_machinelearningspindleheadmt,c_ldscgeneralcollectormt),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_826) ).
fof(c_0_8,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)],[query150]) ).
fof(c_0_9,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_8])]) ).
fof(c_0_10,plain,
! [X23,X24] :
( ~ tptptypes_8_692(X23,X24)
| tptptypes_7_691(X24,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1024])])]) ).
cnf(c_0_11,negated_conjecture,
~ tptptypes_7_691(c_tptpcol_16_26939,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( tptptypes_7_691(X2,X1)
| ~ tptptypes_8_692(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X39,X40] :
( ~ tptptypes_9_693(X39,X40)
| tptptypes_8_692(X39,X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1858])])]) ).
cnf(c_0_14,negated_conjecture,
~ tptptypes_8_692(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( tptptypes_8_692(X1,X2)
| ~ tptptypes_9_693(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,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)],[ax2_1259])]) ).
fof(c_0_17,plain,
! [X37,X38] :
( ~ mtvisible(X37)
| ~ genlmt(X37,X38)
| mtvisible(X38) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])])]) ).
cnf(c_0_18,negated_conjecture,
~ tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,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_16]) ).
cnf(c_0_20,plain,
( mtvisible(X2)
| ~ mtvisible(X1)
| ~ genlmt(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32),c_machinelearningspindleheadmt),
inference(split_conjunct,[status(thm)],[ax2_1040]) ).
cnf(c_0_22,negated_conjecture,
mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
genlmt(c_ldscgeneralcollectormt,c_currentworlddatacollectormt_nonhomocentric),
inference(split_conjunct,[status(thm)],[ax2_3183]) ).
cnf(c_0_24,negated_conjecture,
~ mtvisible(c_currentworlddatacollectormt_nonhomocentric),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
genlmt(c_machinelearningspindleheadmt,c_ldscgeneralcollectormt),
inference(split_conjunct,[status(thm)],[ax2_826]) ).
cnf(c_0_26,plain,
mtvisible(c_machinelearningspindleheadmt),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_27,plain,
~ mtvisible(c_ldscgeneralcollectormt),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_24]) ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_25]),c_0_26])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR050+3 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 01:12:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.46/0.68 # Version: 3.1.0
% 0.46/0.68 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.46/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.68 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.46/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.46/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.46/0.68 # Starting sh5l with 300s (1) cores
% 0.46/0.68 # new_bool_1 with pid 6737 completed with status 0
% 0.46/0.68 # Result found by new_bool_1
% 0.46/0.68 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.46/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.68 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.46/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.46/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.46/0.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.46/0.68 # Search class: FHHNM-FFMM32-MFFFFFNN
% 0.46/0.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.68 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.46/0.68 # SAT001_MinMin_p005000_rr_RG with pid 6739 completed with status 0
% 0.46/0.68 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.46/0.68 # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.46/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.68 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.46/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.46/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.46/0.68 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.46/0.68 # Search class: FHHNM-FFMM32-MFFFFFNN
% 0.46/0.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.68 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.46/0.68 # Preprocessing time : 0.006 s
% 0.46/0.68 # Presaturation interreduction done
% 0.46/0.68
% 0.46/0.68 # Proof found!
% 0.46/0.68 # SZS status Theorem
% 0.46/0.68 # SZS output start CNFRefutation
% See solution above
% 0.46/0.68 # Parsed axioms : 8006
% 0.46/0.68 # Removed by relevancy pruning/SinE : 7954
% 0.46/0.68 # Initial clauses : 53
% 0.46/0.68 # Removed in clause preprocessing : 0
% 0.46/0.68 # Initial clauses in saturation : 53
% 0.46/0.68 # Processed clauses : 102
% 0.46/0.68 # ...of these trivial : 1
% 0.46/0.68 # ...subsumed : 18
% 0.46/0.68 # ...remaining for further processing : 82
% 0.46/0.68 # Other redundant clauses eliminated : 0
% 0.46/0.68 # Clauses deleted for lack of memory : 0
% 0.46/0.68 # Backward-subsumed : 3
% 0.46/0.68 # Backward-rewritten : 0
% 0.46/0.68 # Generated clauses : 30
% 0.46/0.68 # ...of the previous two non-redundant : 26
% 0.46/0.68 # ...aggressively subsumed : 0
% 0.46/0.68 # Contextual simplify-reflections : 0
% 0.46/0.68 # Paramodulations : 30
% 0.46/0.68 # Factorizations : 0
% 0.46/0.68 # NegExts : 0
% 0.46/0.68 # Equation resolutions : 0
% 0.46/0.68 # Disequality decompositions : 0
% 0.46/0.68 # Total rewrite steps : 8
% 0.46/0.68 # ...of those cached : 4
% 0.46/0.68 # Propositional unsat checks : 0
% 0.46/0.68 # Propositional check models : 0
% 0.46/0.68 # Propositional check unsatisfiable : 0
% 0.46/0.68 # Propositional clauses : 0
% 0.46/0.68 # Propositional clauses after purity: 0
% 0.46/0.68 # Propositional unsat core size : 0
% 0.46/0.68 # Propositional preprocessing time : 0.000
% 0.46/0.68 # Propositional encoding time : 0.000
% 0.46/0.68 # Propositional solver time : 0.000
% 0.46/0.68 # Success case prop preproc time : 0.000
% 0.46/0.68 # Success case prop encoding time : 0.000
% 0.46/0.68 # Success case prop solver time : 0.000
% 0.46/0.68 # Current number of processed clauses : 40
% 0.46/0.68 # Positive orientable unit clauses : 18
% 0.46/0.68 # Positive unorientable unit clauses: 0
% 0.46/0.68 # Negative unit clauses : 5
% 0.46/0.68 # Non-unit-clauses : 17
% 0.46/0.68 # Current number of unprocessed clauses: 16
% 0.46/0.68 # ...number of literals in the above : 26
% 0.46/0.68 # Current number of archived formulas : 0
% 0.46/0.68 # Current number of archived clauses : 42
% 0.46/0.68 # Clause-clause subsumption calls (NU) : 153
% 0.46/0.68 # Rec. Clause-clause subsumption calls : 137
% 0.46/0.68 # Non-unit clause-clause subsumptions : 17
% 0.46/0.68 # Unit Clause-clause subsumption calls : 25
% 0.46/0.68 # Rewrite failures with RHS unbound : 0
% 0.46/0.68 # BW rewrite match attempts : 0
% 0.46/0.68 # BW rewrite match successes : 0
% 0.46/0.68 # Condensation attempts : 0
% 0.46/0.68 # Condensation successes : 0
% 0.46/0.68 # Termbank termtop insertions : 53489
% 0.46/0.68 # Search garbage collected termcells : 31124
% 0.46/0.68
% 0.46/0.68 # -------------------------------------------------
% 0.46/0.68 # User time : 0.045 s
% 0.46/0.68 # System time : 0.022 s
% 0.46/0.68 # Total time : 0.067 s
% 0.46/0.68 # Maximum resident set size: 18100 pages
% 0.46/0.68
% 0.46/0.68 # -------------------------------------------------
% 0.46/0.68 # User time : 0.158 s
% 0.46/0.68 # System time : 0.033 s
% 0.46/0.68 # Total time : 0.191 s
% 0.46/0.68 # Maximum resident set size: 7956 pages
% 0.46/0.68 % E---3.1 exiting
% 0.46/0.68 % E exiting
%------------------------------------------------------------------------------