%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN579-1 : TPTP v8.1.0. Released v2.5.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 : n007.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:12:35 EDT 2022 % Result : Unsatisfiable 0.21s 0.40s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SYN579-1 : TPTP v8.1.0. Released v2.5.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.35 % Computer : n007.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Tue Jul 12 05:19:33 EDT 2022 % 0.14/0.35 % CPUTime : % 0.14/0.38 # No SInE strategy applied % 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.38 # % 0.14/0.38 # Presaturation interreduction done % 0.14/0.38 # Number of axioms: 23 Number of unprocessed: 23 % 0.14/0.38 # Tableaux proof search. % 0.14/0.38 # APR header successfully linked. % 0.14/0.38 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 23 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 23 conjectures. % 0.14/0.38 # There are 23 start rule candidates: % 0.14/0.38 # Found 9 unit axioms. % 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.38 # 23 start rule tableaux created. % 0.14/0.38 # 14 extension rule candidate clauses % 0.14/0.38 # 9 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.21/0.40 # There were 2 total branch saturation attempts. % 0.21/0.40 # There were 0 of these attempts blocked. % 0.21/0.40 # There were 0 deferred branch saturation attempts. % 0.21/0.40 # There were 0 free duplicated saturations. % 0.21/0.40 # There were 2 total successful branch saturations. % 0.21/0.40 # There were 0 successful branch saturations in interreduction. % 0.21/0.40 # There were 0 successful branch saturations on the branch. % 0.21/0.40 # There were 2 successful branch saturations after the branch. % 0.21/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.40 # Begin clausification derivation % 0.21/0.40 % 0.21/0.40 # End clausification derivation % 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.40 cnf(i_0_28, negated_conjecture, (p9(c12,c13))). % 0.21/0.40 cnf(i_0_29, negated_conjecture, (p11(c14,c15))). % 0.21/0.40 cnf(i_0_30, negated_conjecture, (p2(c16,f5(c14)))). % 0.21/0.40 cnf(i_0_24, negated_conjecture, (p10(X1,X1))). % 0.21/0.40 cnf(i_0_25, negated_conjecture, (p7(X1,X1))). % 0.21/0.40 cnf(i_0_26, negated_conjecture, (p3(X1,X1))). % 0.21/0.40 cnf(i_0_27, negated_conjecture, (p2(X1,X1))). % 0.21/0.40 cnf(i_0_31, negated_conjecture, (p3(f4(f5(X1)),f4(X1)))). % 0.21/0.40 cnf(i_0_32, negated_conjecture, (p3(f6(f5(X1)),f6(X1)))). % 0.21/0.40 cnf(i_0_33, negated_conjecture, (p9(X1,c13)|~p9(X1,f6(c16)))). % 0.21/0.40 cnf(i_0_34, negated_conjecture, (p9(X1,f6(c16))|~p9(X1,c13))). % 0.21/0.40 cnf(i_0_38, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.21/0.40 cnf(i_0_39, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.21/0.40 cnf(i_0_37, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))). % 0.21/0.40 cnf(i_0_36, negated_conjecture, (p3(f6(X1),f6(X2))|~p2(X1,X2))). % 0.21/0.40 cnf(i_0_35, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 0.21/0.40 cnf(i_0_40, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.21/0.40 cnf(i_0_41, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.21/0.40 cnf(i_0_43, negated_conjecture, (p9(X1,X2)|~p9(X3,X4)|~p3(X4,X2)|~p7(X3,X1))). % 0.21/0.40 cnf(i_0_42, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p2(X3,X1)|~p10(X4,X2))). % 0.21/0.40 cnf(i_0_46, negated_conjecture, (~p11(X1,c15)|~p9(f8(X2,X1),f6(X1))|~p9(f8(X2,X1),X2)|~p9(c12,X2))). % 0.21/0.40 cnf(i_0_44, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p3(X1,X3))). % 0.21/0.40 cnf(i_0_45, negated_conjecture, (p9(f8(X1,X2),f6(X2))|p9(f8(X1,X2),X1)|~p11(X2,c15)|~p9(c12,X1))). % 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.40 # Begin printing tableau % 0.21/0.40 # Found 12 steps % 0.21/0.40 cnf(i_0_40, negated_conjecture, (p3(f6(c14),f6(c14))|~p3(f6(f5(c14)),f6(c14))|~p3(f6(f5(c14)),f6(c14))), inference(start_rule)). % 0.21/0.40 cnf(i_0_70, plain, (~p3(f6(f5(c14)),f6(c14))), inference(closure_rule, [i_0_32])). % 0.21/0.40 cnf(i_0_71, plain, (~p3(f6(f5(c14)),f6(c14))), inference(closure_rule, [i_0_32])). % 0.21/0.40 cnf(i_0_69, plain, (p3(f6(c14),f6(c14))), inference(extension_rule, [i_0_44])). % 0.21/0.40 cnf(i_0_102, plain, (~p2(c14,c14)), inference(closure_rule, [i_0_27])). % 0.21/0.40 cnf(i_0_101, plain, (p7(f8(f6(c14),c14),f8(f6(c14),c14))), inference(extension_rule, [i_0_43])). % 0.21/0.40 cnf(i_0_118, plain, (~p3(f6(f5(c14)),f6(c14))), inference(closure_rule, [i_0_32])). % 0.21/0.40 cnf(i_0_116, plain, (p9(f8(f6(c14),c14),f6(c14))), inference(extension_rule, [i_0_46])). % 0.21/0.40 cnf(i_0_124, plain, (~p11(c14,c15)), inference(closure_rule, [i_0_29])). % 0.21/0.40 cnf(i_0_126, plain, (~p9(f8(f6(c14),c14),f6(c14))), inference(closure_rule, [i_0_116])). % 0.21/0.40 cnf(i_0_117, plain, (~p9(f8(f6(c14),c14),f6(f5(c14)))), inference(etableau_closure_rule, [i_0_117, ...])). % 0.21/0.40 cnf(i_0_127, plain, (~p9(c12,f6(c14))), inference(etableau_closure_rule, [i_0_127, ...])). % 0.21/0.40 # End printing tableau % 0.21/0.40 # SZS output end % 0.21/0.40 # Branches closed with saturation will be marked with an "s" % 0.21/0.41 # Child (25131) has found a proof. % 0.21/0.41 % 0.21/0.41 # Proof search is over... % 0.21/0.41 # Freeing feature tree %------------------------------------------------------------------------------