%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CSR062+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 : n027.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:13:00 EDT 2022 % Result : Theorem 0.12s 0.38s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : CSR062+1 : TPTP v8.1.0. Released v3.4.0. % 0.10/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n027.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Thu Jun 9 18:04:43 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 63 Number of unprocessed: 55 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 55 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 2 conjectures. % 0.12/0.37 # There are 2 start rule candidates: % 0.12/0.37 # Found 14 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 2 start rule tableaux created. % 0.12/0.37 # 41 extension rule candidate clauses % 0.12/0.37 # 14 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 1 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 1 successful branch saturations after the branch. % 0.12/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_63, negated_conjecture, (mtvisible(c_tptp_member3205_mt))). % 0.12/0.38 cnf(i_0_45, plain, (mtvisible(c_basekb))). % 0.12/0.38 cnf(i_0_61, plain, (mtvisible(c_universalvocabularymt))). % 0.12/0.38 cnf(i_0_2, plain, (transitivebinarypredicate(c_genlmt))). % 0.12/0.38 cnf(i_0_1, plain, (genlmt(c_calendarsmt,c_calendarsvocabularymt))). % 0.12/0.38 cnf(i_0_13, plain, (genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt))). % 0.12/0.38 cnf(i_0_5, plain, (genlmt(c_calendarsvocabularymt,c_basekb))). % 0.12/0.38 cnf(i_0_3, plain, (genlmt(c_basekb,c_universalvocabularymt))). % 0.12/0.38 cnf(i_0_4, plain, (genlmt(c_cyclistsmt,c_calendarsmt))). % 0.12/0.38 cnf(i_0_12, plain, (genlmt(c_tptp_spindleheadmt,c_cyclistsmt))). % 0.12/0.38 cnf(i_0_6, plain, (genlpreds(c_tptptypes_6_388,c_tptptypes_5_387))). % 0.12/0.38 cnf(i_0_10, plain, (genlpreds(c_tptptypes_8_390,c_tptptypes_7_389))). % 0.12/0.38 cnf(i_0_8, plain, (genlinverse(c_tptptypes_7_389,c_tptptypes_6_388))). % 0.12/0.38 cnf(i_0_62, negated_conjecture, (~tptptypes_5_387(X1,c_pushingwithfingers))). % 0.12/0.38 cnf(i_0_36, plain, (firstordercollection(X1)|~tptptypes_6_388(X2,X1))). % 0.12/0.38 cnf(i_0_34, plain, (firstordercollection(X1)|~tptptypes_5_387(X2,X1))). % 0.12/0.38 cnf(i_0_28, plain, (firstordercollection(X1)|~tptptypes_7_389(X2,X1))). % 0.12/0.38 cnf(i_0_26, plain, (firstordercollection(X1)|~tptptypes_8_390(X2,X1))). % 0.12/0.38 cnf(i_0_14, plain, (tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)|~mtvisible(c_cyclistsmt))). % 0.12/0.38 cnf(i_0_25, plain, (isa(X1,c_pushingwithfingers)|~pushingwithfingers(X1))). % 0.12/0.38 cnf(i_0_35, plain, (firstordercollection(X1)|~tptptypes_5_387(X1,X2))). % 0.12/0.38 cnf(i_0_24, plain, (pushingwithfingers(X1)|~isa(X1,c_pushingwithfingers))). % 0.12/0.38 cnf(i_0_37, plain, (firstordercollection(X1)|~tptptypes_6_388(X1,X2))). % 0.12/0.38 cnf(i_0_29, plain, (firstordercollection(X1)|~tptptypes_7_389(X1,X2))). % 0.12/0.38 cnf(i_0_27, plain, (firstordercollection(X1)|~tptptypes_8_390(X1,X2))). % 0.12/0.38 cnf(i_0_46, plain, (transitivebinarypredicate(X1)|~isa(X1,c_transitivebinarypredicate))). % 0.12/0.38 cnf(i_0_23, plain, (isa(X1,c_tptpcol_15_4027)|~tptpcol_15_4027(X1))). % 0.12/0.38 cnf(i_0_47, plain, (isa(X1,c_transitivebinarypredicate)|~transitivebinarypredicate(X1))). % 0.12/0.38 cnf(i_0_22, plain, (tptpcol_15_4027(X1)|~isa(X1,c_tptpcol_15_4027))). % 0.12/0.38 cnf(i_0_9, plain, (tptptypes_6_388(X1,X2)|~tptptypes_7_389(X2,X1))). % 0.12/0.38 cnf(i_0_11, plain, (tptptypes_7_389(X1,X2)|~tptptypes_8_390(X1,X2))). % 0.12/0.38 cnf(i_0_48, plain, (collection(X1)|~isa(X2,X1))). % 0.12/0.38 cnf(i_0_7, plain, (tptptypes_5_387(X1,X2)|~tptptypes_6_388(X1,X2))). % 0.12/0.38 cnf(i_0_53, plain, (mtvisible(X1)|~mtvisible(X2)|~genlmt(X2,X1))). % 0.12/0.38 cnf(i_0_17, plain, (collection(X1)|~disjointwith(X2,X1))). % 0.12/0.38 cnf(i_0_18, plain, (collection(X1)|~disjointwith(X1,X2))). % 0.12/0.38 cnf(i_0_30, plain, (binarypredicate(X1)|~genlinverse(X2,X1))). % 0.12/0.38 cnf(i_0_59, plain, (genlmt(X1,X1)|~microtheory(X1))). % 0.12/0.38 cnf(i_0_31, plain, (binarypredicate(X1)|~genlinverse(X1,X2))). % 0.12/0.38 cnf(i_0_38, plain, (predicate(X1)|~genlpreds(X2,X1))). % 0.12/0.38 cnf(i_0_40, plain, (predicate(X1)|~genlpreds(X1,X2))). % 0.12/0.38 cnf(i_0_43, plain, (genlpreds(X1,X1)|~predicate(X1))). % 0.12/0.38 cnf(i_0_50, plain, (thing(X1)|~isa(X1,X2))). % 0.12/0.38 cnf(i_0_54, plain, (microtheory(X1)|~genlmt(X2,X1))). % 0.12/0.38 cnf(i_0_56, plain, (microtheory(X1)|~genlmt(X1,X2))). % 0.12/0.38 cnf(i_0_19, plain, (disjointwith(X1,X2)|~disjointwith(X2,X1))). % 0.12/0.38 cnf(i_0_15, plain, (~disjointwith(X1,X2)|~isa(X3,X2)|~isa(X3,X1))). % 0.12/0.38 cnf(i_0_58, plain, (genlmt(X1,X2)|~genlmt(X3,X2)|~genlmt(X1,X3))). % 0.12/0.38 cnf(i_0_42, plain, (genlpreds(X1,X2)|~genlpreds(X3,X2)|~genlpreds(X1,X3))). % 0.12/0.38 cnf(i_0_16, plain, (genlpreds(X1,X2)|~genlinverse(X3,X2)|~genlinverse(X1,X3))). % 0.12/0.38 cnf(i_0_32, plain, (genlinverse(X1,X2)|~genlinverse(X3,X2)|~genlpreds(X1,X3))). % 0.12/0.38 cnf(i_0_33, plain, (genlinverse(X1,X2)|~genlinverse(X1,X3)|~genlpreds(X3,X2))). % 0.12/0.38 cnf(i_0_52, plain, (isa(X1,X2)|~genls(X3,X2)|~isa(X1,X3))). % 0.12/0.38 cnf(i_0_21, plain, (disjointwith(X1,X2)|~genls(X1,X3)|~disjointwith(X3,X2))). % 0.12/0.38 cnf(i_0_20, plain, (disjointwith(X1,X2)|~genls(X2,X3)|~disjointwith(X1,X3))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 6 steps % 0.12/0.38 cnf(i_0_63, negated_conjecture, (mtvisible(c_tptp_member3205_mt)), inference(start_rule)). % 0.12/0.38 cnf(i_0_65, plain, (mtvisible(c_tptp_member3205_mt)), inference(extension_rule, [i_0_53])). % 0.12/0.38 cnf(i_0_198, plain, (~genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt)), inference(closure_rule, [i_0_13])). % 0.12/0.38 cnf(i_0_196, plain, (mtvisible(c_tptp_spindleheadmt)), inference(extension_rule, [i_0_53])). % 0.12/0.38 cnf(i_0_290, plain, (~genlmt(c_tptp_spindleheadmt,c_cyclistsmt)), inference(closure_rule, [i_0_12])). % 0.12/0.38 cnf(i_0_288, plain, (mtvisible(c_cyclistsmt)), inference(etableau_closure_rule, [i_0_288, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.12/0.38 # We now have 2 tableaux to operate on % 0.12/0.38 # Found closed tableau during pool population. % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------