%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN630-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 : n014.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:56 EDT 2022 % Result : Unsatisfiable 0.14s 0.37s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN630-1 : TPTP v8.1.0. Released v2.5.0. % 0.06/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.34 % Computer : n014.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Tue Jul 12 05:07:49 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 36 Number of unprocessed: 36 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.37 # The folding up rule is enabled... % 0.14/0.37 # Local unification is enabled... % 0.14/0.37 # Any saturation attempts will use folding labels... % 0.14/0.37 # 36 beginning clauses after preprocessing and clausification % 0.14/0.37 # Creating start rules for all 36 conjectures. % 0.14/0.37 # There are 36 start rule candidates: % 0.14/0.37 # Found 9 unit axioms. % 0.14/0.37 # Closed tableau found in foldup close cycle with 0 folds and 5 closures done. % 0.14/0.37 # Found closed tableau while making start rule % 0.14/0.37 # There were 0 total branch saturation attempts. % 0.14/0.37 # There were 0 of these attempts blocked. % 0.14/0.37 # There were 0 deferred branch saturation attempts. % 0.14/0.37 # There were 0 free duplicated saturations. % 0.14/0.37 # There were 0 total successful branch saturations. % 0.14/0.37 # There were 0 successful branch saturations in interreduction. % 0.14/0.37 # There were 0 successful branch saturations on the branch. % 0.14/0.37 # There were 0 successful branch saturations after the branch. % 0.14/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.14/0.37 # Begin clausification derivation % 0.14/0.37 % 0.14/0.37 # End clausification derivation % 0.14/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.37 cnf(i_0_37, negated_conjecture, (p2(X1,X1))). % 0.14/0.37 cnf(i_0_41, negated_conjecture, (p21(c28,f9(f10(f11(c29)))))). % 0.14/0.37 cnf(i_0_42, negated_conjecture, (p21(c27,f12(f9(f10(f11(c29))),c24)))). % 0.14/0.37 cnf(i_0_53, negated_conjecture, (p22(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),c27))). % 0.14/0.37 cnf(i_0_38, negated_conjecture, (p6(X1,X1))). % 0.14/0.37 cnf(i_0_39, negated_conjecture, (p4(X1,X1))). % 0.14/0.37 cnf(i_0_40, negated_conjecture, (p3(X1,X1))). % 0.14/0.37 cnf(i_0_66, negated_conjecture, (p3(c26,f13(f15(f17(f16(f9(f11(c29)))),c28),f13(f15(f16(f9(f10(f11(c29)))),c30),f14(f16(c27),f15(f16(f9(f10(f11(c29)))),c25))))))). % 0.14/0.37 cnf(i_0_48, negated_conjecture, (~p4(f5(f7(c23,f8(c24,c25)),c26),c27))). % 0.14/0.37 cnf(i_0_49, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.14/0.37 cnf(i_0_50, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.14/0.37 cnf(i_0_51, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.14/0.37 cnf(i_0_47, negated_conjecture, (p4(f11(X1),f11(X2))|~p4(X1,X2))). % 0.14/0.37 cnf(i_0_46, negated_conjecture, (p4(f10(X1),f10(X2))|~p4(X1,X2))). % 0.14/0.37 cnf(i_0_43, negated_conjecture, (p4(f9(X1),f9(X2))|~p4(X1,X2))). % 0.14/0.37 cnf(i_0_44, negated_conjecture, (p3(f16(X1),f16(X2))|~p4(X1,X2))). % 0.14/0.37 cnf(i_0_45, negated_conjecture, (p3(f17(X1),f17(X2))|~p3(X1,X2))). % 0.14/0.37 cnf(i_0_52, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.14/0.37 cnf(i_0_54, negated_conjecture, (p21(X1,X2)|~p21(X3,X4)|~p4(X4,X2)|~p4(X3,X1))). % 0.14/0.37 cnf(i_0_55, negated_conjecture, (p22(X1,X2)|~p22(X3,X4)|~p4(X4,X2)|~p4(X3,X1))). % 0.14/0.37 cnf(i_0_57, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p4(X1,X3)|~p6(X2,X4))). % 0.14/0.37 cnf(i_0_56, negated_conjecture, (p6(f8(X1,X2),f8(X3,X4))|~p4(X2,X4)|~p4(X1,X3))). % 0.14/0.37 cnf(i_0_61, negated_conjecture, (p4(f12(X1,X2),f12(X3,X4))|~p4(X2,X4)|~p4(X1,X3))). % 0.14/0.37 cnf(i_0_65, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p3(X2,X4)|~p2(X1,X3))). % 0.14/0.37 cnf(i_0_62, negated_conjecture, (p4(f18(X1,X2),f18(X3,X4))|~p4(X2,X4)|~p4(X1,X3))). % 0.14/0.37 cnf(i_0_63, negated_conjecture, (p4(f19(X1,X2),f19(X3,X4))|~p3(X2,X4)|~p2(X1,X3))). % 0.14/0.37 cnf(i_0_64, negated_conjecture, (p4(f20(X1,X2),f20(X3,X4))|~p3(X2,X4)|~p2(X1,X3))). % 0.14/0.37 cnf(i_0_58, negated_conjecture, (p3(f13(X1,X2),f13(X3,X4))|~p3(X2,X4)|~p3(X1,X3))). % 0.14/0.37 cnf(i_0_59, negated_conjecture, (p3(f14(X1,X2),f14(X3,X4))|~p3(X2,X4)|~p3(X1,X3))). % 0.14/0.37 cnf(i_0_60, negated_conjecture, (p3(f15(X1,X2),f15(X3,X4))|~p3(X1,X3)|~p4(X2,X4))). % 0.14/0.37 cnf(i_0_67, negated_conjecture, (p4(f5(f7(X1,f8(X2,X3)),X4),X5)|~p21(X5,f12(f9(f10(f11(c29))),X2))|~p21(X6,f9(f10(f11(c29))))|~p3(X4,f13(f15(f17(f16(f9(f11(c29)))),X6),f13(f15(f16(f9(f10(f11(c29)))),X7),f14(f16(X5),f15(f16(f9(f10(f11(c29)))),X3)))))|~p4(X7,f9(c29)))). % 0.14/0.37 cnf(i_0_68, negated_conjecture, (p4(f19(f7(X1,f8(X2,X3)),X4),X5)|~p21(X6,f12(f9(f10(f11(c29))),X2))|~p21(X7,f9(f10(f11(c29))))|~p3(X4,f13(f15(f17(f16(f9(f11(c29)))),X7),f13(f15(f16(f9(f10(f11(c29)))),X5),f14(f16(X6),f15(f16(f9(f10(f11(c29)))),X3)))))|~p4(X5,f9(c29)))). % 0.14/0.37 cnf(i_0_69, negated_conjecture, (p3(X1,f16(f9(c29)))|p4(f20(f7(X2,f8(X3,X4)),X1),X5)|~p21(X6,f12(f9(f10(f11(c29))),X3))|~p21(X5,f9(f10(f11(c29))))|~p3(X1,f13(f15(f17(f16(f9(f11(c29)))),X5),f13(f15(f16(f9(f10(f11(c29)))),X7),f14(f16(X6),f15(f16(f9(f10(f11(c29)))),X4)))))|~p4(X7,f9(c29)))). % 0.14/0.37 cnf(i_0_70, negated_conjecture, (p4(f5(f7(X1,f8(X2,X3)),X4),X5)|~p22(f12(f9(f10(f11(c29))),f18(X2,f9(f11(c29)))),X5)|~p21(X5,f12(f9(f10(f11(c29))),X2))|~p21(X6,f9(f10(f11(c29))))|~p3(X4,f13(f15(f17(f16(f9(f11(c29)))),X6),f13(f15(f16(f9(f10(f11(c29)))),X7),f14(f16(X5),f15(f16(f9(f10(f11(c29)))),X3))))))). % 0.14/0.37 cnf(i_0_71, negated_conjecture, (p4(f19(f7(X1,f8(X2,X3)),X4),X5)|~p22(f12(f9(f10(f11(c29))),f18(X2,f9(f11(c29)))),X6)|~p21(X6,f12(f9(f10(f11(c29))),X2))|~p21(X7,f9(f10(f11(c29))))|~p3(X4,f13(f15(f17(f16(f9(f11(c29)))),X7),f13(f15(f16(f9(f10(f11(c29)))),X5),f14(f16(X6),f15(f16(f9(f10(f11(c29)))),X3))))))). % 0.14/0.37 cnf(i_0_72, negated_conjecture, (p3(X1,f16(f9(c29)))|p4(f20(f7(X2,f8(X3,X4)),X1),X5)|~p22(f12(f9(f10(f11(c29))),f18(X3,f9(f11(c29)))),X6)|~p21(X6,f12(f9(f10(f11(c29))),X3))|~p21(X5,f9(f10(f11(c29))))|~p3(X1,f13(f15(f17(f16(f9(f11(c29)))),X5),f13(f15(f16(f9(f10(f11(c29)))),X7),f14(f16(X6),f15(f16(f9(f10(f11(c29)))),X4))))))). % 0.14/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.37 # Begin printing tableau % 0.14/0.37 # Found 6 steps % 0.14/0.37 cnf(i_0_70, negated_conjecture, (p4(f5(f7(c23,f8(c24,c25)),c26),c27)|~p22(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),c27)|~p21(c27,f12(f9(f10(f11(c29))),c24))|~p21(c28,f9(f10(f11(c29))))|~p3(c26,f13(f15(f17(f16(f9(f11(c29)))),c28),f13(f15(f16(f9(f10(f11(c29)))),c30),f14(f16(c27),f15(f16(f9(f10(f11(c29)))),c25)))))), inference(start_rule)). % 0.14/0.37 cnf(i_0_84, plain, (p4(f5(f7(c23,f8(c24,c25)),c26),c27)), inference(closure_rule, [i_0_48])). % 0.14/0.37 cnf(i_0_85, plain, (~p22(f12(f9(f10(f11(c29))),f18(c24,f9(f11(c29)))),c27)), inference(closure_rule, [i_0_53])). % 0.14/0.37 cnf(i_0_86, plain, (~p21(c27,f12(f9(f10(f11(c29))),c24))), inference(closure_rule, [i_0_42])). % 0.14/0.37 cnf(i_0_87, plain, (~p21(c28,f9(f10(f11(c29))))), inference(closure_rule, [i_0_41])). % 0.14/0.37 cnf(i_0_88, plain, (~p3(c26,f13(f15(f17(f16(f9(f11(c29)))),c28),f13(f15(f16(f9(f10(f11(c29)))),c30),f14(f16(c27),f15(f16(f9(f10(f11(c29)))),c25)))))), inference(closure_rule, [i_0_66])). % 0.14/0.37 # End printing tableau % 0.14/0.37 # SZS output end % 0.14/0.37 # Branches closed with saturation will be marked with an "s" % 0.14/0.37 # NOT attempting initial tableau saturation % 0.14/0.37 # 3 start rule tableaux created. % 0.14/0.37 # 27 extension rule candidate clauses % 0.14/0.37 # 9 unit axiom clauses % 0.14/0.37 % 0.14/0.37 # Proof search is over... % 0.14/0.37 # Freeing feature tree %------------------------------------------------------------------------------