%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CSR050+1 : TPTP v8.1.0. Released v3.4.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 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 : 600s % DateTime : Fri Jul 15 03:09:47 EDT 2022 % Result : Theorem 0.06s 0.28s % Output : CNFRefutation 0.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.07 % Problem : CSR050+1 : TPTP v8.1.0. Released v3.4.0. % 0.03/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.06/0.26 % Computer : n009.cluster.edu % 0.06/0.26 % Model : x86_64 x86_64 % 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.06/0.26 % Memory : 8042.1875MB % 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64 % 0.06/0.26 % CPULimit : 300 % 0.06/0.26 % WCLimit : 600 % 0.06/0.26 % DateTime : Sat Jun 11 18:26:38 EDT 2022 % 0.06/0.26 % CPUTime : % 0.06/0.27 # No SInE strategy applied % 0.06/0.27 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.06/0.27 # and selection function SelectComplexExceptUniqMaxHorn. % 0.06/0.27 # % 0.06/0.27 # Presaturation interreduction done % 0.06/0.27 # Number of axioms: 88 Number of unprocessed: 80 % 0.06/0.27 # Tableaux proof search. % 0.06/0.27 # APR header successfully linked. % 0.06/0.27 # Hello from C++ % 0.06/0.28 # The folding up rule is enabled... % 0.06/0.28 # Local unification is enabled... % 0.06/0.28 # Any saturation attempts will use folding labels... % 0.06/0.28 # 80 beginning clauses after preprocessing and clausification % 0.06/0.28 # Creating start rules for all 2 conjectures. % 0.06/0.28 # There are 2 start rule candidates: % 0.06/0.28 # Found 32 unit axioms. % 0.06/0.28 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.06/0.28 # 2 start rule tableaux created. % 0.06/0.28 # 48 extension rule candidate clauses % 0.06/0.28 # 32 unit axiom clauses % 0.06/0.28 % 0.06/0.28 # Requested 8, 32 cores available to the main process. % 0.06/0.28 # There are not enough tableaux to fork, creating more from the initial 2 % 0.06/0.28 # There were 1 total branch saturation attempts. % 0.06/0.28 # There were 0 of these attempts blocked. % 0.06/0.28 # There were 0 deferred branch saturation attempts. % 0.06/0.28 # There were 0 free duplicated saturations. % 0.06/0.28 # There were 1 total successful branch saturations. % 0.06/0.28 # There were 0 successful branch saturations in interreduction. % 0.06/0.28 # There were 0 successful branch saturations on the branch. % 0.06/0.28 # There were 1 successful branch saturations after the branch. % 0.06/0.28 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.28 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.06/0.28 # Begin clausification derivation % 0.06/0.28 % 0.06/0.28 # End clausification derivation % 0.06/0.28 # Begin listing active clauses obtained from FOF to CNF conversion % 0.06/0.28 cnf(i_0_77, plain, (mtvisible(c_basekb))). % 0.06/0.28 cnf(i_0_88, negated_conjecture, (mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32)))). % 0.06/0.28 cnf(i_0_86, plain, (mtvisible(c_universalvocabularymt))). % 0.06/0.28 cnf(i_0_8, plain, (transitivebinarypredicate(c_genlmt))). % 0.06/0.28 cnf(i_0_69, plain, (uniformresourcelocator(f_urlfn(X1)))). % 0.06/0.28 cnf(i_0_72, plain, (computerdataartifact(f_urlreferentfn(X1)))). % 0.06/0.28 cnf(i_0_4, plain, (genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32),c_machinelearningspindleheadmt))). % 0.06/0.28 cnf(i_0_1, plain, (genlmt(c_ldscdemonstrationspindleheadmt,c_currentworlddatacollectormt_nonhomocentric))). % 0.06/0.28 cnf(i_0_2, plain, (genlmt(c_cycorpproductsmt,c_basekb))). % 0.06/0.28 cnf(i_0_10, plain, (genlmt(c_basekb,c_universalvocabularymt))). % 0.06/0.28 cnf(i_0_3, plain, (genlmt(c_cycnounlearnermt,c_cycorpproductsmt))). % 0.06/0.28 cnf(i_0_9, plain, (genlmt(c_machinelearningspindleheadmt,c_cycnounlearnermt))). % 0.06/0.28 cnf(i_0_5, plain, (genlmt(c_machinelearningspindleheadmt,c_miptdatabase19681997_termsmt))). % 0.06/0.28 cnf(i_0_6, plain, (genlmt(c_miptdatabase19681997_termsmt,c_ldscgeneralcollectormt))). % 0.06/0.28 cnf(i_0_7, plain, (genlmt(c_ldscgeneralcollectormt,c_ldscdemonstrationspindleheadmt))). % 0.06/0.28 cnf(i_0_11, plain, (genlinverse(c_tptptypes_8_692,c_tptptypes_7_691))). % 0.06/0.28 cnf(i_0_13, plain, (genlpreds(c_tptptypes_9_693,c_tptptypes_8_692))). % 0.06/0.28 cnf(i_0_67, plain, (natfunction(f_urlfn(X1),c_urlfn))). % 0.06/0.28 cnf(i_0_70, plain, (natfunction(f_urlreferentfn(X1),c_urlreferentfn))). % 0.06/0.28 cnf(i_0_76, plain, (microtheory(f_contentmtofcdafromeventfn(X1,X2)))). % 0.06/0.28 cnf(i_0_73, plain, (natfunction(f_contentmtofcdafromeventfn(X1,X2),c_contentmtofcdafromeventfn))). % 0.06/0.28 cnf(i_0_68, plain, (natargument(f_urlfn(X1),n_1,X1))). % 0.06/0.28 cnf(i_0_71, plain, (natargument(f_urlreferentfn(X1),n_1,X1))). % 0.06/0.28 cnf(i_0_40, plain, (collection(f_subcollectionofwithrelationtofn(X1,X2,X3)))). % 0.06/0.28 cnf(i_0_74, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_1,X1))). % 0.06/0.28 cnf(i_0_75, plain, (natargument(f_contentmtofcdafromeventfn(X1,X2),n_2,X2))). % 0.06/0.28 cnf(i_0_36, plain, (natfunction(f_subcollectionofwithrelationtofn(X1,X2,X3),c_subcollectionofwithrelationtofn))). % 0.06/0.28 cnf(i_0_37, plain, (natargument(f_subcollectionofwithrelationtofn(X1,X2,X3),n_1,X1))). % 0.06/0.28 cnf(i_0_38, plain, (natargument(f_subcollectionofwithrelationtofn(X1,X2,X3),n_2,X2))). % 0.06/0.28 cnf(i_0_39, plain, (natargument(f_subcollectionofwithrelationtofn(X1,X2,X3),n_3,X3))). % 0.06/0.28 cnf(i_0_87, negated_conjecture, (~tptptypes_7_691(c_tptpcol_16_26939,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma)))). % 0.06/0.28 cnf(i_0_30, plain, (~objectfoundinlocation(X1,X1))). % 0.06/0.28 cnf(i_0_54, plain, (firstordercollection(X1)|~tptptypes_8_692(X2,X1))). % 0.06/0.28 cnf(i_0_52, plain, (firstordercollection(X1)|~tptptypes_7_691(X2,X1))). % 0.06/0.28 cnf(i_0_43, plain, (firstordercollection(X1)|~tptptypes_9_693(X2,X1))). % 0.06/0.28 cnf(i_0_55, plain, (firstordercollection(X1)|~tptptypes_8_692(X1,X2))). % 0.06/0.28 cnf(i_0_15, plain, (tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939)|~mtvisible(c_currentworlddatacollectormt_nonhomocentric))). % 0.06/0.28 cnf(i_0_35, plain, (isa(X1,c_ship)|~ship(X1))). % 0.06/0.28 cnf(i_0_24, plain, (isa(X1,c_tptpcol_16_26939)|~tptpcol_16_26939(X1))). % 0.06/0.28 cnf(i_0_53, plain, (firstordercollection(X1)|~tptptypes_7_691(X1,X2))). % 0.06/0.28 cnf(i_0_44, plain, (firstordercollection(X1)|~tptptypes_9_693(X1,X2))). % 0.06/0.28 cnf(i_0_60, plain, (transitivebinarypredicate(X1)|~isa(X1,c_transitivebinarypredicate))). % 0.06/0.28 cnf(i_0_23, plain, (tptpcol_16_26939(X1)|~isa(X1,c_tptpcol_16_26939))). % 0.06/0.28 cnf(i_0_42, plain, (isa(X1,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma))|~subcollectionofwithrelationtofnshipobjectfoundinlocationcityofbostonma(X1))). % 0.06/0.28 cnf(i_0_34, plain, (ship(X1)|~isa(X1,c_ship))). % 0.06/0.28 cnf(i_0_61, plain, (isa(X1,c_transitivebinarypredicate)|~transitivebinarypredicate(X1))). % 0.06/0.28 cnf(i_0_14, plain, (tptptypes_8_692(X1,X2)|~tptptypes_9_693(X1,X2))). % 0.06/0.28 cnf(i_0_62, plain, (collection(X1)|~isa(X2,X1))). % 0.06/0.28 cnf(i_0_41, plain, (subcollectionofwithrelationtofnshipobjectfoundinlocationcityofbostonma(X1)|~isa(X1,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma)))). % 0.06/0.28 cnf(i_0_18, plain, (collection(X1)|~disjointwith(X2,X1))). % 0.06/0.28 cnf(i_0_19, plain, (collection(X1)|~disjointwith(X1,X2))). % 0.06/0.28 cnf(i_0_25, plain, (spatialthing_nonsituational(X1)|~objectfoundinlocation(X2,X1))). % 0.06/0.28 cnf(i_0_27, plain, (spatialthing_nonsituational(X1)|~objectfoundinlocation(X1,X2))). % 0.06/0.28 cnf(i_0_12, plain, (tptptypes_7_691(X1,X2)|~tptptypes_8_692(X2,X1))). % 0.06/0.28 cnf(i_0_78, plain, (mtvisible(X1)|~mtvisible(X2)|~genlmt(X2,X1))). % 0.06/0.28 cnf(i_0_26, plain, (spatialthing_localized(X1)|~objectfoundinlocation(X2,X1))). % 0.06/0.28 cnf(i_0_28, plain, (spatialthing_localized(X1)|~objectfoundinlocation(X1,X2))). % 0.06/0.28 cnf(i_0_84, plain, (genlmt(X1,X1)|~microtheory(X1))). % 0.06/0.28 cnf(i_0_45, plain, (predicate(X1)|~genlpreds(X2,X1))). % 0.06/0.28 cnf(i_0_47, plain, (predicate(X1)|~genlpreds(X1,X2))). % 0.06/0.28 cnf(i_0_56, plain, (binarypredicate(X1)|~genlinverse(X2,X1))). % 0.06/0.28 cnf(i_0_57, plain, (binarypredicate(X1)|~genlinverse(X1,X2))). % 0.06/0.28 cnf(i_0_64, plain, (thing(X1)|~isa(X1,X2))). % 0.06/0.28 cnf(i_0_79, plain, (microtheory(X1)|~genlmt(X2,X1))). % 0.06/0.28 cnf(i_0_81, plain, (microtheory(X1)|~genlmt(X1,X2))). % 0.06/0.28 cnf(i_0_50, plain, (genlpreds(X1,X1)|~predicate(X1))). % 0.06/0.28 cnf(i_0_20, plain, (disjointwith(X1,X2)|~disjointwith(X2,X1))). % 0.06/0.28 cnf(i_0_83, plain, (genlmt(X1,X2)|~genlmt(X3,X2)|~genlmt(X1,X3))). % 0.06/0.28 cnf(i_0_16, plain, (~disjointwith(X1,X2)|~isa(X3,X2)|~isa(X3,X1))). % 0.06/0.28 cnf(i_0_58, plain, (genlinverse(X1,X2)|~genlpreds(X1,X3)|~genlinverse(X3,X2))). % 0.06/0.28 cnf(i_0_59, plain, (genlinverse(X1,X2)|~genlpreds(X3,X2)|~genlinverse(X1,X3))). % 0.06/0.28 cnf(i_0_17, plain, (genlpreds(X1,X2)|~genlinverse(X3,X2)|~genlinverse(X1,X3))). % 0.06/0.28 cnf(i_0_49, plain, (genlpreds(X1,X2)|~genlpreds(X3,X2)|~genlpreds(X1,X3))). % 0.06/0.28 cnf(i_0_66, plain, (isa(X1,X2)|~genls(X3,X2)|~isa(X1,X3))). % 0.06/0.28 cnf(i_0_22, plain, (disjointwith(X1,X2)|~genls(X1,X3)|~disjointwith(X3,X2))). % 0.06/0.28 cnf(i_0_21, plain, (disjointwith(X1,X2)|~genls(X2,X3)|~disjointwith(X1,X3))). % 0.06/0.28 cnf(i_0_29, plain, (objectfoundinlocation(X1,X2)|~objectfoundinlocation(X3,X2)|~objectfoundinlocation(X1,X3))). % 0.06/0.28 cnf(i_0_31, plain, (objectfoundinlocation(X1,X2)|~geopoliticalsubdivision(X2,X3)|~objectfoundinlocation(X1,X3))). % 0.06/0.28 cnf(i_0_32, plain, (objectfoundinlocation(X1,X2)|~geographicallysubsumes(X2,X3)|~objectfoundinlocation(X1,X3))). % 0.06/0.28 cnf(i_0_33, plain, (objectfoundinlocation(X1,X2)|~subregions(X2,X3)|~objectfoundinlocation(X1,X3))). % 0.06/0.28 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.06/0.28 # Begin printing tableau % 0.06/0.28 # Found 6 steps % 0.06/0.28 cnf(i_0_88, negated_conjecture, (mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32))), inference(start_rule)). % 0.06/0.28 cnf(i_0_90, plain, (mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32))), inference(extension_rule, [i_0_78])). % 0.06/0.28 cnf(i_0_247, plain, (~genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32),c_machinelearningspindleheadmt)), inference(closure_rule, [i_0_4])). % 0.06/0.28 cnf(i_0_245, plain, (mtvisible(c_machinelearningspindleheadmt)), inference(extension_rule, [i_0_78])). % 0.06/0.28 cnf(i_0_357, plain, (~genlmt(c_machinelearningspindleheadmt,c_cycnounlearnermt)), inference(closure_rule, [i_0_9])). % 0.06/0.28 cnf(i_0_355, plain, (mtvisible(c_cycnounlearnermt)), inference(etableau_closure_rule, [i_0_355, ...])). % 0.06/0.28 # End printing tableau % 0.06/0.28 # SZS output end % 0.06/0.28 # Branches closed with saturation will be marked with an "s" % 0.06/0.28 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.06/0.28 # We now have 2 tableaux to operate on % 0.06/0.28 # Found closed tableau during pool population. % 0.06/0.28 # Proof search is over... % 0.06/0.28 # Freeing feature tree %------------------------------------------------------------------------------