%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN096-1.008 : TPTP v8.1.0. Bugfixed v1.2.1. % 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 : n004.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 : Thu Jul 21 06:08:08 EDT 2022 % Result : Unsatisfiable 0.19s 0.46s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN096-1.008 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n004.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jul 11 23:50:37 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 65 Number of unprocessed: 65 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.36 # The folding up rule is enabled... % 0.19/0.36 # Local unification is enabled... % 0.19/0.36 # Any saturation attempts will use folding labels... % 0.19/0.36 # 65 beginning clauses after preprocessing and clausification % 0.19/0.36 # Creating start rules for all 1 conjectures. % 0.19/0.36 # There are 1 start rule candidates: % 0.19/0.36 # Found 4 unit axioms. % 0.19/0.36 # 1 start rule tableaux created. % 0.19/0.36 # 61 extension rule candidate clauses % 0.19/0.36 # 4 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.36 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.19/0.36 # We now have 8 tableaux to operate on % 0.19/0.46 # There were 19 total branch saturation attempts. % 0.19/0.46 # There were 0 of these attempts blocked. % 0.19/0.46 # There were 0 deferred branch saturation attempts. % 0.19/0.46 # There were 0 free duplicated saturations. % 0.19/0.46 # There were 19 total successful branch saturations. % 0.19/0.46 # There were 0 successful branch saturations in interreduction. % 0.19/0.46 # There were 0 successful branch saturations on the branch. % 0.19/0.46 # There were 19 successful branch saturations after the branch. % 0.19/0.46 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.46 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.46 # Begin clausification derivation % 0.19/0.46 % 0.19/0.46 # End clausification derivation % 0.19/0.46 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.46 cnf(i_0_127, plain, (p_14(a))). % 0.19/0.46 cnf(i_0_129, plain, (q_14(a))). % 0.19/0.46 cnf(i_0_128, plain, (p_15(a))). % 0.19/0.46 cnf(i_0_130, plain, (q_15(a))). % 0.19/0.46 cnf(i_0_66, negated_conjecture, (~q_0(X1)|~p_0(X1))). % 0.19/0.46 cnf(i_0_123, plain, (p_15(X1)|~p_7(X1))). % 0.19/0.46 cnf(i_0_125, plain, (q_15(X1)|~q_7(X1))). % 0.19/0.46 cnf(i_0_124, plain, (p_16(X1)|~p_8(X1))). % 0.19/0.46 cnf(i_0_126, plain, (q_16(X1)|~q_8(X1))). % 0.19/0.46 cnf(i_0_71, plain, (p_2(X1)|~p_4(X1)|~p_3(X1))). % 0.19/0.46 cnf(i_0_72, plain, (p_2(X1)|~q_4(X1)|~q_3(X1))). % 0.19/0.46 cnf(i_0_67, plain, (p_0(X1)|~p_2(X1)|~p_1(X1))). % 0.19/0.46 cnf(i_0_68, plain, (p_0(X1)|~q_2(X1)|~q_1(X1))). % 0.19/0.46 cnf(i_0_95, plain, (q_0(X1)|~q_2(X1)|~p_1(X1))). % 0.19/0.46 cnf(i_0_96, plain, (q_0(X1)|~q_1(X1)|~p_2(X1))). % 0.19/0.46 cnf(i_0_99, plain, (q_2(X1)|~q_4(X1)|~p_3(X1))). % 0.19/0.46 cnf(i_0_69, plain, (p_1(X1)|~p_3(X1)|~p_2(X1))). % 0.19/0.46 cnf(i_0_70, plain, (p_1(X1)|~q_3(X1)|~q_2(X1))). % 0.19/0.46 cnf(i_0_100, plain, (q_2(X1)|~p_4(X1)|~q_3(X1))). % 0.19/0.46 cnf(i_0_73, plain, (p_3(X1)|~p_5(X1)|~p_4(X1))). % 0.19/0.46 cnf(i_0_74, plain, (p_3(X1)|~q_5(X1)|~q_4(X1))). % 0.19/0.46 cnf(i_0_101, plain, (q_3(X1)|~q_5(X1)|~p_4(X1))). % 0.19/0.46 cnf(i_0_97, plain, (q_1(X1)|~q_3(X1)|~p_2(X1))). % 0.19/0.46 cnf(i_0_102, plain, (q_3(X1)|~p_5(X1)|~q_4(X1))). % 0.19/0.46 cnf(i_0_75, plain, (p_4(X1)|~p_6(X1)|~p_5(X1))). % 0.19/0.46 cnf(i_0_76, plain, (p_4(X1)|~q_6(X1)|~q_5(X1))). % 0.19/0.46 cnf(i_0_103, plain, (q_4(X1)|~q_6(X1)|~p_5(X1))). % 0.19/0.46 cnf(i_0_98, plain, (q_1(X1)|~p_3(X1)|~q_2(X1))). % 0.19/0.46 cnf(i_0_104, plain, (q_4(X1)|~p_6(X1)|~q_5(X1))). % 0.19/0.46 cnf(i_0_77, plain, (p_5(X1)|~p_7(X1)|~p_6(X1))). % 0.19/0.46 cnf(i_0_78, plain, (p_5(X1)|~q_7(X1)|~q_6(X1))). % 0.19/0.46 cnf(i_0_105, plain, (q_5(X1)|~q_7(X1)|~p_6(X1))). % 0.19/0.46 cnf(i_0_106, plain, (q_5(X1)|~p_7(X1)|~q_6(X1))). % 0.19/0.46 cnf(i_0_79, plain, (p_6(X1)|~p_8(X1)|~p_7(X1))). % 0.19/0.46 cnf(i_0_81, plain, (p_7(X1)|~p_9(X1)|~p_8(X1))). % 0.19/0.46 cnf(i_0_82, plain, (p_7(X1)|~q_9(X1)|~q_8(X1))). % 0.19/0.46 cnf(i_0_109, plain, (q_7(X1)|~q_9(X1)|~p_8(X1))). % 0.19/0.46 cnf(i_0_110, plain, (q_7(X1)|~p_9(X1)|~q_8(X1))). % 0.19/0.46 cnf(i_0_80, plain, (p_6(X1)|~q_8(X1)|~q_7(X1))). % 0.19/0.46 cnf(i_0_107, plain, (q_6(X1)|~q_8(X1)|~p_7(X1))). % 0.19/0.46 cnf(i_0_83, plain, (p_8(X1)|~p_10(X1)|~p_9(X1))). % 0.19/0.46 cnf(i_0_84, plain, (p_8(X1)|~q_10(X1)|~q_9(X1))). % 0.19/0.46 cnf(i_0_111, plain, (q_8(X1)|~q_10(X1)|~p_9(X1))). % 0.19/0.46 cnf(i_0_112, plain, (q_8(X1)|~p_10(X1)|~q_9(X1))). % 0.19/0.46 cnf(i_0_108, plain, (q_6(X1)|~p_8(X1)|~q_7(X1))). % 0.19/0.46 cnf(i_0_85, plain, (p_9(X1)|~p_11(X1)|~p_10(X1))). % 0.19/0.46 cnf(i_0_86, plain, (p_9(X1)|~q_11(X1)|~q_10(X1))). % 0.19/0.46 cnf(i_0_113, plain, (q_9(X1)|~q_11(X1)|~p_10(X1))). % 0.19/0.46 cnf(i_0_114, plain, (q_9(X1)|~p_11(X1)|~q_10(X1))). % 0.19/0.46 cnf(i_0_87, plain, (p_10(X1)|~p_12(X1)|~p_11(X1))). % 0.19/0.46 cnf(i_0_88, plain, (p_10(X1)|~q_12(X1)|~q_11(X1))). % 0.19/0.46 cnf(i_0_115, plain, (q_10(X1)|~q_12(X1)|~p_11(X1))). % 0.19/0.46 cnf(i_0_116, plain, (q_10(X1)|~p_12(X1)|~q_11(X1))). % 0.19/0.46 cnf(i_0_89, plain, (p_11(X1)|~p_13(X1)|~p_12(X1))). % 0.19/0.46 cnf(i_0_90, plain, (p_11(X1)|~q_13(X1)|~q_12(X1))). % 0.19/0.46 cnf(i_0_117, plain, (q_11(X1)|~q_13(X1)|~p_12(X1))). % 0.19/0.46 cnf(i_0_118, plain, (q_11(X1)|~p_13(X1)|~q_12(X1))). % 0.19/0.46 cnf(i_0_91, plain, (p_12(X1)|~p_14(X1)|~p_13(X1))). % 0.19/0.46 cnf(i_0_92, plain, (p_12(X1)|~q_14(X1)|~q_13(X1))). % 0.19/0.46 cnf(i_0_119, plain, (q_12(X1)|~q_14(X1)|~p_13(X1))). % 0.19/0.46 cnf(i_0_120, plain, (q_12(X1)|~p_14(X1)|~q_13(X1))). % 0.19/0.46 cnf(i_0_93, plain, (p_13(X1)|~p_15(X1)|~p_14(X1))). % 0.19/0.46 cnf(i_0_94, plain, (p_13(X1)|~q_15(X1)|~q_14(X1))). % 0.19/0.46 cnf(i_0_121, plain, (q_13(X1)|~q_15(X1)|~p_14(X1))). % 0.19/0.46 cnf(i_0_122, plain, (q_13(X1)|~p_15(X1)|~q_14(X1))). % 0.19/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.46 # Begin printing tableau % 0.19/0.46 # Found 39 steps % 0.19/0.46 cnf(i_0_66, negated_conjecture, (~q_0(a)|~p_0(a)), inference(start_rule)). % 0.19/0.46 cnf(i_0_132, plain, (~p_0(a)), inference(extension_rule, [i_0_68])). % 0.19/0.46 cnf(i_0_330, plain, (~q_1(a)), inference(extension_rule, [i_0_97])). % 0.19/0.46 cnf(i_0_716, plain, (~p_2(a)), inference(extension_rule, [i_0_71])). % 0.19/0.46 cnf(i_0_715, plain, (~q_3(a)), inference(extension_rule, [i_0_101])). % 0.19/0.46 cnf(i_0_329, plain, (~q_2(a)), inference(extension_rule, [i_0_99])). % 0.19/0.46 cnf(i_0_1275, plain, (~q_4(a)), inference(extension_rule, [i_0_103])). % 0.19/0.46 cnf(i_0_1276, plain, (~p_3(a)), inference(extension_rule, [i_0_73])). % 0.19/0.46 cnf(i_0_131, plain, (~q_0(a)), inference(extension_rule, [i_0_95])). % 0.19/0.46 cnf(i_0_1392, plain, (~q_2(a)), inference(extension_rule, [i_0_100])). % 0.19/0.46 cnf(i_0_1424, plain, (~p_4(a)), inference(extension_rule, [i_0_75])). % 0.19/0.46 cnf(i_0_1425, plain, (~q_3(a)), inference(extension_rule, [i_0_102])). % 0.19/0.46 cnf(i_0_1393, plain, (~p_1(a)), inference(extension_rule, [i_0_69])). % 0.19/0.46 cnf(i_0_1529, plain, (~p_3(a)), inference(extension_rule, [i_0_74])). % 0.19/0.46 cnf(i_0_1530, plain, (~p_2(a)), inference(extension_rule, [i_0_72])). % 0.19/0.46 cnf(i_0_1465, plain, (~p_6(a)), inference(extension_rule, [i_0_79])). % 0.19/0.46 cnf(i_0_7181, plain, (~p_8(a)), inference(extension_rule, [i_0_83])). % 0.19/0.46 cnf(i_0_7234, plain, (~p_10(a)), inference(extension_rule, [i_0_87])). % 0.19/0.46 cnf(i_0_7311, plain, (~p_12(a)), inference(extension_rule, [i_0_91])). % 0.19/0.46 cnf(i_0_7409, plain, (~p_14(a)), inference(closure_rule, [i_0_127])). % 0.19/0.46 cnf(i_0_1466, plain, (~p_5(a)), inference(etableau_closure_rule, [i_0_1466, ...])). % 0.19/0.46 cnf(i_0_1503, plain, (~p_5(a)), inference(etableau_closure_rule, [i_0_1503, ...])). % 0.19/0.46 cnf(i_0_1504, plain, (~q_4(a)), inference(etableau_closure_rule, [i_0_1504, ...])). % 0.19/0.46 cnf(i_0_1558, plain, (~q_5(a)), inference(etableau_closure_rule, [i_0_1558, ...])). % 0.19/0.46 cnf(i_0_1559, plain, (~q_4(a)), inference(etableau_closure_rule, [i_0_1559, ...])). % 0.19/0.46 cnf(i_0_1572, plain, (~q_4(a)), inference(etableau_closure_rule, [i_0_1572, ...])). % 0.19/0.46 cnf(i_0_1573, plain, (~q_3(a)), inference(etableau_closure_rule, [i_0_1573, ...])). % 0.19/0.46 cnf(i_0_1331, plain, (~q_6(a)), inference(etableau_closure_rule, [i_0_1331, ...])). % 0.19/0.46 cnf(i_0_1332, plain, (~p_5(a)), inference(etableau_closure_rule, [i_0_1332, ...])). % 0.19/0.46 cnf(i_0_1369, plain, (~p_5(a)), inference(etableau_closure_rule, [i_0_1369, ...])). % 0.19/0.46 cnf(i_0_1370, plain, (~p_4(a)), inference(etableau_closure_rule, [i_0_1370, ...])). % 0.19/0.46 cnf(i_0_1246, plain, (~q_5(a)), inference(etableau_closure_rule, [i_0_1246, ...])). % 0.19/0.46 cnf(i_0_1247, plain, (~p_4(a)), inference(etableau_closure_rule, [i_0_1247, ...])). % 0.19/0.46 cnf(i_0_1032, plain, (~p_4(a)), inference(etableau_closure_rule, [i_0_1032, ...])). % 0.19/0.46 cnf(i_0_1033, plain, (~p_3(a)), inference(etableau_closure_rule, [i_0_1033, ...])). % 0.19/0.46 cnf(i_0_7182, plain, (~p_7(a)), inference(etableau_closure_rule, [i_0_7182, ...])). % 0.19/0.46 cnf(i_0_7235, plain, (~p_9(a)), inference(etableau_closure_rule, [i_0_7235, ...])). % 0.19/0.46 cnf(i_0_7312, plain, (~p_11(a)), inference(etableau_closure_rule, [i_0_7312, ...])). % 0.19/0.46 cnf(i_0_7410, plain, (~p_13(a)), inference(etableau_closure_rule, [i_0_7410, ...])). % 0.19/0.46 # End printing tableau % 0.19/0.46 # SZS output end % 0.19/0.46 # Branches closed with saturation will be marked with an "s" % 0.19/0.46 # Child (30339) has found a proof. % 0.19/0.46 % 0.19/0.46 # Proof search is over... % 0.19/0.46 # Freeing feature tree %------------------------------------------------------------------------------