%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN622-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 : n029.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:53 EDT 2022 % Result : Unsatisfiable 0.19s 0.40s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SYN622-1 : TPTP v8.1.0. Released v2.5.0. % 0.03/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.11/0.32 % Computer : n029.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 600 % 0.11/0.32 % DateTime : Mon Jul 11 13:11:32 EDT 2022 % 0.11/0.33 % CPUTime : % 0.19/0.35 # No SInE strategy applied % 0.19/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.19/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.19/0.35 # % 0.19/0.35 # Presaturation interreduction done % 0.19/0.35 # Number of axioms: 34 Number of unprocessed: 34 % 0.19/0.35 # Tableaux proof search. % 0.19/0.35 # APR header successfully linked. % 0.19/0.35 # 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 # 34 beginning clauses after preprocessing and clausification % 0.19/0.36 # Creating start rules for all 34 conjectures. % 0.19/0.36 # There are 34 start rule candidates: % 0.19/0.36 # Found 12 unit axioms. % 0.19/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.36 # 34 start rule tableaux created. % 0.19/0.36 # 22 extension rule candidate clauses % 0.19/0.36 # 12 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.40 # There were 1 total branch saturation attempts. % 0.19/0.40 # There were 0 of these attempts blocked. % 0.19/0.40 # There were 0 deferred branch saturation attempts. % 0.19/0.40 # There were 0 free duplicated saturations. % 0.19/0.40 # There were 1 total successful branch saturations. % 0.19/0.40 # There were 0 successful branch saturations in interreduction. % 0.19/0.40 # There were 0 successful branch saturations on the branch. % 0.19/0.40 # There were 1 successful branch saturations after the branch. % 0.19/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.40 # Begin clausification derivation % 0.19/0.40 % 0.19/0.40 # End clausification derivation % 0.19/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.40 cnf(i_0_40, negated_conjecture, (p3(f4(c23),c24))). % 0.19/0.40 cnf(i_0_41, negated_conjecture, (p19(f5(f6(f7(c25))),c24))). % 0.19/0.40 cnf(i_0_59, negated_conjecture, (p20(f10(f12(f13(c26),c27)),f10(f12(f13(c26),X1))))). % 0.19/0.40 cnf(i_0_35, negated_conjecture, (p11(X1,X1))). % 0.19/0.40 cnf(i_0_36, negated_conjecture, (p9(X1,X1))). % 0.19/0.40 cnf(i_0_37, negated_conjecture, (p8(X1,X1))). % 0.19/0.40 cnf(i_0_38, negated_conjecture, (p3(X1,X1))). % 0.19/0.40 cnf(i_0_39, negated_conjecture, (p2(X1,X1))). % 0.19/0.40 cnf(i_0_58, negated_conjecture, (p8(f12(f13(c23),X1),f12(f13(c26),f16(c27,X1))))). % 0.19/0.40 cnf(i_0_42, negated_conjecture, (p8(f16(X1,f17(X2,X1)),X2))). % 0.19/0.40 cnf(i_0_52, negated_conjecture, (~p8(f12(f13(c26),c27),f14(f15(f5(c25)))))). % 0.19/0.40 cnf(i_0_60, negated_conjecture, (~p8(f12(f13(c23),f17(c28,c27)),f12(f13(c26),c28)))). % 0.19/0.40 cnf(i_0_43, negated_conjecture, (p21(X1)|~p21(X2)|~p11(X2,X1))). % 0.19/0.40 cnf(i_0_44, negated_conjecture, (p11(f13(X1),f13(X2))|~p2(X1,X2))). % 0.19/0.40 cnf(i_0_45, negated_conjecture, (p9(f15(X1),f15(X2))|~p3(X1,X2))). % 0.19/0.40 cnf(i_0_46, negated_conjecture, (p9(f10(X1),f10(X2))|~p8(X1,X2))). % 0.19/0.40 cnf(i_0_47, negated_conjecture, (p8(f14(X1),f14(X2))|~p9(X1,X2))). % 0.19/0.40 cnf(i_0_51, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))). % 0.19/0.40 cnf(i_0_48, negated_conjecture, (p3(f7(X1),f7(X2))|~p3(X1,X2))). % 0.19/0.40 cnf(i_0_53, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))). % 0.19/0.40 cnf(i_0_54, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))). % 0.19/0.40 cnf(i_0_55, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.19/0.40 cnf(i_0_56, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.19/0.40 cnf(i_0_49, negated_conjecture, (p3(f6(X1),f6(X2))|~p3(X1,X2))). % 0.19/0.40 cnf(i_0_50, negated_conjecture, (p3(f5(X1),f5(X2))|~p3(X1,X2))). % 0.19/0.40 cnf(i_0_57, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.19/0.40 cnf(i_0_68, negated_conjecture, (p21(f13(X1))|p8(f12(f13(X1),f18(X2,X1)),f14(f15(f5(c25))))|~p22(X2,c24)|~p3(f4(X1),X2))). % 0.19/0.40 cnf(i_0_61, negated_conjecture, (p19(X1,X2)|~p19(X3,X4)|~p3(X4,X2)|~p3(X3,X1))). % 0.19/0.40 cnf(i_0_67, negated_conjecture, (p8(f17(X1,X2),f17(X3,X4))|~p8(X2,X4)|~p8(X1,X3))). % 0.19/0.40 cnf(i_0_63, negated_conjecture, (p20(X1,X2)|~p20(X3,X4)|~p9(X4,X2)|~p9(X3,X1))). % 0.19/0.40 cnf(i_0_62, negated_conjecture, (p22(X1,X2)|~p22(X3,X4)|~p3(X4,X2)|~p3(X3,X1))). % 0.19/0.40 cnf(i_0_66, negated_conjecture, (p8(f16(X1,X2),f16(X3,X4))|~p8(X2,X4)|~p8(X1,X3))). % 0.19/0.40 cnf(i_0_65, negated_conjecture, (p8(f12(X1,X2),f12(X3,X4))|~p8(X2,X4)|~p11(X1,X3))). % 0.19/0.40 cnf(i_0_64, negated_conjecture, (p8(f18(X1,X2),f18(X3,X4))|~p2(X2,X4)|~p3(X1,X3))). % 0.19/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.40 # Begin printing tableau % 0.19/0.40 # Found 8 steps % 0.19/0.40 cnf(i_0_53, negated_conjecture, (p11(X12,X12)|~p11(X12,X12)|~p11(X12,X12)), inference(start_rule)). % 0.19/0.40 cnf(i_0_114, plain, (~p11(X12,X12)), inference(closure_rule, [i_0_35])). % 0.19/0.40 cnf(i_0_115, plain, (~p11(X12,X12)), inference(closure_rule, [i_0_35])). % 0.19/0.40 cnf(i_0_113, plain, (p11(X12,X12)), inference(extension_rule, [i_0_65])). % 0.19/0.40 cnf(i_0_1065, plain, (~p8(f16(X13,f17(X11,X13)),X11)), inference(closure_rule, [i_0_42])). % 0.19/0.40 cnf(i_0_1064, plain, (p8(f12(X12,f16(X13,f17(X11,X13))),f12(X12,X11))), inference(extension_rule, [i_0_66])). % 0.19/0.40 cnf(i_0_1072, plain, (~p8(f16(X1,f17(X9,X1)),X9)), inference(closure_rule, [i_0_42])). % 0.19/0.40 cnf(i_0_1070, plain, (p8(f16(f16(X1,f17(X9,X1)),f12(X12,f16(X13,f17(X11,X13)))),f16(X9,f12(X12,X11)))), inference(etableau_closure_rule, [i_0_1070, ...])). % 0.19/0.40 # End printing tableau % 0.19/0.40 # SZS output end % 0.19/0.40 # Branches closed with saturation will be marked with an "s" % 0.19/0.40 # Child (28698) has found a proof. % 0.19/0.40 % 0.19/0.40 # Proof search is over... % 0.19/0.40 # Freeing feature tree %------------------------------------------------------------------------------