%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : CSR026+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 : n020.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:04:36 EDT 2022 % Result : Theorem 0.13s 0.37s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : CSR026+1 : TPTP v8.1.0. Released v3.4.0. % 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n020.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Thu Jun 9 22:21:21 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 58 Number of unprocessed: 50 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 50 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 2 conjectures. % 0.13/0.37 # There are 2 start rule candidates: % 0.13/0.37 # Found 15 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 2 start rule tableaux created. % 0.13/0.37 # 35 extension rule candidate clauses % 0.13/0.37 # 15 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 2 % 0.13/0.37 # There were 1 total branch saturation attempts. % 0.13/0.37 # There were 0 of these attempts blocked. % 0.13/0.37 # There were 0 deferred branch saturation attempts. % 0.13/0.37 # There were 0 free duplicated saturations. % 0.13/0.37 # There were 1 total successful branch saturations. % 0.13/0.37 # There were 0 successful branch saturations in interreduction. % 0.13/0.37 # There were 0 successful branch saturations on the branch. % 0.13/0.37 # There were 1 successful branch saturations after the branch. % 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.37 # Begin clausification derivation % 0.13/0.37 % 0.13/0.37 # End clausification derivation % 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.37 cnf(i_0_58, negated_conjecture, (mtvisible(c_tptp_spindlecollectormt))). % 0.13/0.37 cnf(i_0_40, plain, (mtvisible(c_basekb))). % 0.13/0.37 cnf(i_0_56, plain, (mtvisible(c_universalvocabularymt))). % 0.13/0.37 cnf(i_0_2, plain, (transitivebinarypredicate(c_genlmt))). % 0.13/0.37 cnf(i_0_32, plain, (tptpquantity(f_tptpquantityfn_2(X1)))). % 0.13/0.37 cnf(i_0_6, plain, (genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt))). % 0.13/0.37 cnf(i_0_8, plain, (genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt))). % 0.13/0.37 cnf(i_0_1, plain, (genlmt(c_calendarsmt,c_calendarsvocabularymt))). % 0.13/0.37 cnf(i_0_4, plain, (genlmt(c_calendarsvocabularymt,c_basekb))). % 0.13/0.37 cnf(i_0_3, plain, (genlmt(c_cyclistsmt,c_calendarsmt))). % 0.13/0.37 cnf(i_0_5, plain, (genlmt(c_tptp_spindleheadmt,c_cyclistsmt))). % 0.13/0.37 cnf(i_0_7, plain, (genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt))). % 0.13/0.37 cnf(i_0_30, plain, (natfunction(f_tptpquantityfn_2(X1),c_tptpquantityfn_2))). % 0.13/0.37 cnf(i_0_31, plain, (natargument(f_tptpquantityfn_2(X1),n_1,X1))). % 0.13/0.37 cnf(i_0_57, negated_conjecture, (~tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)))). % 0.13/0.37 cnf(i_0_11, plain, (runningshorts(c_tptprunningshorts)|~mtvisible(c_cyclistsmt))). % 0.13/0.37 cnf(i_0_41, plain, (transitivebinarypredicate(X1)|~isa(X1,c_transitivebinarypredicate))). % 0.13/0.37 cnf(i_0_33, plain, (runningshorts(X1)|~isa(X1,c_runningshorts))). % 0.13/0.37 cnf(i_0_34, plain, (isa(X1,c_runningshorts)|~runningshorts(X1))). % 0.13/0.37 cnf(i_0_42, plain, (isa(X1,c_transitivebinarypredicate)|~transitivebinarypredicate(X1))). % 0.13/0.37 cnf(i_0_9, plain, (tptpofobject(X1,f_tptpquantityfn_2(n_756))|~runningshorts(X1)|~mtvisible(c_tptp_member2701_mt))). % 0.13/0.37 cnf(i_0_39, plain, (binarypredicate(X1)|~relationallinstance(X1,X2,X3))). % 0.13/0.37 cnf(i_0_38, plain, (collection(X1)|~relationallinstance(X2,X1,X3))). % 0.13/0.37 cnf(i_0_37, plain, (thing(X1)|~relationallinstance(X2,X3,X1))). % 0.13/0.37 cnf(i_0_14, plain, (predicate(X1)|~genlpreds(X2,X1))). % 0.13/0.37 cnf(i_0_35, plain, (tptpquantity(X1)|~tptpofobject(X2,X1))). % 0.13/0.37 cnf(i_0_36, plain, (partiallytangible(X1)|~tptpofobject(X1,X2))). % 0.13/0.37 cnf(i_0_10, plain, (relationallinstance(c_tptpofobject,c_runningshorts,f_tptpquantityfn_2(n_756))|~mtvisible(c_tptp_member2701_mt))). % 0.13/0.37 cnf(i_0_54, plain, (genlmt(X1,X1)|~microtheory(X1))). % 0.13/0.37 cnf(i_0_16, plain, (predicate(X1)|~genlpreds(X1,X2))). % 0.13/0.37 cnf(i_0_21, plain, (binarypredicate(X1)|~genlinverse(X2,X1))). % 0.13/0.37 cnf(i_0_48, plain, (mtvisible(X1)|~mtvisible(X2)|~genlmt(X2,X1))). % 0.13/0.37 cnf(i_0_22, plain, (binarypredicate(X1)|~genlinverse(X1,X2))). % 0.13/0.37 cnf(i_0_43, plain, (collection(X1)|~isa(X2,X1))). % 0.13/0.37 cnf(i_0_19, plain, (genlpreds(X1,X1)|~predicate(X1))). % 0.13/0.37 cnf(i_0_25, plain, (collection(X1)|~disjointwith(X2,X1))). % 0.13/0.37 cnf(i_0_26, plain, (collection(X1)|~disjointwith(X1,X2))). % 0.13/0.37 cnf(i_0_45, plain, (thing(X1)|~isa(X1,X2))). % 0.13/0.37 cnf(i_0_49, plain, (microtheory(X1)|~genlmt(X2,X1))). % 0.13/0.37 cnf(i_0_51, plain, (microtheory(X1)|~genlmt(X1,X2))). % 0.13/0.37 cnf(i_0_27, plain, (disjointwith(X1,X2)|~disjointwith(X2,X1))). % 0.13/0.37 cnf(i_0_53, plain, (genlmt(X1,X2)|~genlmt(X3,X2)|~genlmt(X1,X3))). % 0.13/0.37 cnf(i_0_47, plain, (isa(X1,X2)|~genls(X3,X2)|~isa(X1,X3))). % 0.13/0.37 cnf(i_0_12, plain, (~disjointwith(X1,X2)|~isa(X3,X2)|~isa(X3,X1))). % 0.13/0.37 cnf(i_0_29, plain, (disjointwith(X1,X2)|~genls(X1,X3)|~disjointwith(X3,X2))). % 0.13/0.37 cnf(i_0_28, plain, (disjointwith(X1,X2)|~genls(X2,X3)|~disjointwith(X1,X3))). % 0.13/0.37 cnf(i_0_23, plain, (genlinverse(X1,X2)|~genlpreds(X1,X3)|~genlinverse(X3,X2))). % 0.13/0.37 cnf(i_0_24, plain, (genlinverse(X1,X2)|~genlpreds(X3,X2)|~genlinverse(X1,X3))). % 0.13/0.37 cnf(i_0_13, plain, (genlpreds(X1,X2)|~genlinverse(X3,X2)|~genlinverse(X1,X3))). % 0.13/0.37 cnf(i_0_18, plain, (genlpreds(X1,X2)|~genlpreds(X3,X2)|~genlpreds(X1,X3))). % 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.37 # Begin printing tableau % 0.13/0.37 # Found 6 steps % 0.13/0.37 cnf(i_0_58, negated_conjecture, (mtvisible(c_tptp_spindlecollectormt)), inference(start_rule)). % 0.13/0.37 cnf(i_0_60, plain, (mtvisible(c_tptp_spindlecollectormt)), inference(extension_rule, [i_0_48])). % 0.13/0.37 cnf(i_0_177, plain, (~genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt)), inference(closure_rule, [i_0_6])). % 0.13/0.37 cnf(i_0_175, plain, (mtvisible(c_tptp_member2701_mt)), inference(extension_rule, [i_0_9])). % 0.13/0.37 cnf(i_0_233, plain, (tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756))), inference(closure_rule, [i_0_57])). % 0.13/0.37 cnf(i_0_234, plain, (~runningshorts(c_tptprunningshorts)), inference(etableau_closure_rule, [i_0_234, ...])). % 0.13/0.37 # End printing tableau % 0.13/0.37 # SZS output end % 0.13/0.37 # Branches closed with saturation will be marked with an "s" % 0.13/0.37 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 2 tableaux to operate on % 0.13/0.37 # Found closed tableau during pool population. % 0.13/0.37 # Proof search is over... % 0.13/0.37 # Freeing feature tree %------------------------------------------------------------------------------