%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN001-1.005 : TPTP v8.1.0. Released v1.0.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 : n016.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:07:00 EDT 2022 % Result : Unsatisfiable 0.18s 0.36s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN001-1.005 : TPTP v8.1.0. Released v1.0.0. % 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.32 % Computer : n016.cluster.edu % 0.13/0.32 % Model : x86_64 x86_64 % 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.32 % Memory : 8042.1875MB % 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Tue Jul 12 06:50:14 EDT 2022 % 0.13/0.33 % CPUTime : % 0.18/0.35 # No SInE strategy applied % 0.18/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.18/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.35 # % 0.18/0.35 # Presaturation interreduction done % 0.18/0.35 # Number of axioms: 32 Number of unprocessed: 20 % 0.18/0.35 # Tableaux proof search. % 0.18/0.35 # APR header successfully linked. % 0.18/0.35 # Hello from C++ % 0.18/0.36 # The folding up rule is enabled... % 0.18/0.36 # Local unification is enabled... % 0.18/0.36 # Any saturation attempts will use folding labels... % 0.18/0.36 # 20 beginning clauses after preprocessing and clausification % 0.18/0.36 # Creating start rules for all 20 conjectures. % 0.18/0.36 # There are 20 start rule candidates: % 0.18/0.36 # Found 0 unit axioms. % 0.18/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.36 # 20 start rule tableaux created. % 0.18/0.36 # 20 extension rule candidate clauses % 0.18/0.36 # 0 unit axiom clauses % 0.18/0.36 % 0.18/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There were 5 total branch saturation attempts. % 0.18/0.36 # There were 0 of these attempts blocked. % 0.18/0.36 # There were 0 deferred branch saturation attempts. % 0.18/0.36 # There were 0 free duplicated saturations. % 0.18/0.36 # There were 5 total successful branch saturations. % 0.18/0.36 # There were 2 successful branch saturations in interreduction. % 0.18/0.36 # There were 0 successful branch saturations on the branch. % 0.18/0.36 # There were 3 successful branch saturations after the branch. % 0.18/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.36 # Begin clausification derivation % 0.18/0.36 % 0.18/0.36 # End clausification derivation % 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.36 cnf(i_0_52, negated_conjecture, (~p_5|~p_4|~p_1)). % 0.18/0.36 cnf(i_0_54, negated_conjecture, (~p_5|~p_3|~p_1)). % 0.18/0.36 cnf(i_0_55, negated_conjecture, (~p_4|~p_3|~p_1)). % 0.18/0.36 cnf(i_0_58, negated_conjecture, (~p_5|~p_2|~p_1)). % 0.18/0.36 cnf(i_0_59, negated_conjecture, (~p_4|~p_2|~p_1)). % 0.18/0.36 cnf(i_0_61, negated_conjecture, (~p_3|~p_2|~p_1)). % 0.18/0.36 cnf(i_0_40, negated_conjecture, (~p_5|~p_4|~p_3)). % 0.18/0.36 cnf(i_0_44, negated_conjecture, (~p_5|~p_4|~p_2)). % 0.18/0.36 cnf(i_0_46, negated_conjecture, (~p_5|~p_3|~p_2)). % 0.18/0.36 cnf(i_0_47, negated_conjecture, (~p_4|~p_3|~p_2)). % 0.18/0.36 cnf(i_0_36, negated_conjecture, (p_3|p_2|p_1)). % 0.18/0.36 cnf(i_0_50, negated_conjecture, (p_4|p_3|p_2)). % 0.18/0.36 cnf(i_0_51, negated_conjecture, (p_5|p_3|p_2)). % 0.18/0.36 cnf(i_0_53, negated_conjecture, (p_5|p_4|p_2)). % 0.18/0.36 cnf(i_0_57, negated_conjecture, (p_5|p_4|p_3)). % 0.18/0.36 cnf(i_0_38, negated_conjecture, (p_4|p_2|p_1)). % 0.18/0.36 cnf(i_0_39, negated_conjecture, (p_5|p_2|p_1)). % 0.18/0.36 cnf(i_0_42, negated_conjecture, (p_4|p_3|p_1)). % 0.18/0.36 cnf(i_0_43, negated_conjecture, (p_5|p_3|p_1)). % 0.18/0.36 cnf(i_0_45, negated_conjecture, (p_5|p_4|p_1)). % 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.36 # Begin printing tableau % 0.18/0.36 # Found 8 steps % 0.18/0.36 cnf(i_0_53, negated_conjecture, (p_5|p_4|p_2), inference(start_rule)). % 0.18/0.36 cnf(i_0_83, plain, (p_5), inference(extension_rule, [i_0_54])). % 0.18/0.36 cnf(i_0_180, plain, (~p_3), inference(extension_rule, [i_0_50])). % 0.18/0.36 cnf(i_0_84, plain, (p_4), inference(etableau_closure_rule, [i_0_84, ...])). % 0.18/0.36 cnf(i_0_85, plain, (p_2), inference(etableau_closure_rule, [i_0_85, ...])). % 0.18/0.36 cnf(i_0_181, plain, (~p_1), inference(etableau_closure_rule, [i_0_181, ...])). % 0.18/0.36 cnf(i_0_206, plain, (p_4), inference(etableau_closure_rule, [i_0_206, ...])). % 0.18/0.36 cnf(i_0_208, plain, (p_2), inference(etableau_closure_rule, [i_0_208, ...])). % 0.18/0.36 # End printing tableau % 0.18/0.36 # SZS output end % 0.18/0.36 # Branches closed with saturation will be marked with an "s" % 0.18/0.36 # Child (1980) has found a proof. % 0.18/0.36 % 0.18/0.36 # Proof search is over... % 0.18/0.36 # Freeing feature tree %------------------------------------------------------------------------------