%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN700-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 : n025.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:13:24 EDT 2022 % Result : Unsatisfiable 0.20s 0.49s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN700-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.34 % Computer : n025.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 06:19:03 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: 74 Number of unprocessed: 74 % 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.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 # 74 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 74 conjectures. % 0.14/0.38 # There are 74 start rule candidates: % 0.14/0.38 # Found 31 unit axioms. % 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.38 # 74 start rule tableaux created. % 0.14/0.38 # 43 extension rule candidate clauses % 0.14/0.38 # 31 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.49 # There were 1 total branch saturation attempts. % 0.20/0.49 # There were 0 of these attempts blocked. % 0.20/0.49 # There were 0 deferred branch saturation attempts. % 0.20/0.49 # There were 0 free duplicated saturations. % 0.20/0.49 # There were 1 total successful branch saturations. % 0.20/0.49 # There were 0 successful branch saturations in interreduction. % 0.20/0.49 # There were 0 successful branch saturations on the branch. % 0.20/0.49 # There were 1 successful branch saturations after the branch. % 0.20/0.49 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.49 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.49 # Begin clausification derivation % 0.20/0.49 % 0.20/0.49 # End clausification derivation % 0.20/0.49 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.49 cnf(i_0_75, negated_conjecture, (p25(c34))). % 0.20/0.49 cnf(i_0_76, negated_conjecture, (p29(c36))). % 0.20/0.49 cnf(i_0_77, negated_conjecture, (p30(f18(c41)))). % 0.20/0.49 cnf(i_0_80, negated_conjecture, (p30(f18(c40)))). % 0.20/0.49 cnf(i_0_78, negated_conjecture, (p28(f16(c38)))). % 0.20/0.49 cnf(i_0_79, negated_conjecture, (p28(f16(c39)))). % 0.20/0.49 cnf(i_0_90, negated_conjecture, (p2(c44,c46))). % 0.20/0.49 cnf(i_0_81, negated_conjecture, (p10(X1,X1))). % 0.20/0.49 cnf(i_0_82, negated_conjecture, (p7(X1,X1))). % 0.20/0.49 cnf(i_0_83, negated_conjecture, (p6(X1,X1))). % 0.20/0.49 cnf(i_0_84, negated_conjecture, (p3(X1,X1))). % 0.20/0.49 cnf(i_0_91, negated_conjecture, (p31(c47,c42))). % 0.20/0.49 cnf(i_0_93, negated_conjecture, (p2(c47,f9(c37)))). % 0.20/0.49 cnf(i_0_94, negated_conjecture, (p31(c44,f5(c42)))). % 0.20/0.49 cnf(i_0_92, negated_conjecture, (p31(c46,f5(c42)))). % 0.20/0.49 cnf(i_0_95, negated_conjecture, (p7(f8(c35),c36))). % 0.20/0.49 cnf(i_0_85, negated_conjecture, (p21(X1,X1))). % 0.20/0.49 cnf(i_0_86, negated_conjecture, (p2(X1,X1))). % 0.20/0.49 cnf(i_0_87, negated_conjecture, (p17(X1,X1))). % 0.20/0.49 cnf(i_0_88, negated_conjecture, (p14(X1,X1))). % 0.20/0.49 cnf(i_0_89, negated_conjecture, (p12(X1,X1))). % 0.20/0.49 cnf(i_0_96, negated_conjecture, (p32(f22(c34,c45),c48))). % 0.20/0.49 cnf(i_0_97, negated_conjecture, (p32(f22(c34,c45),c43))). % 0.20/0.49 cnf(i_0_98, negated_conjecture, (p31(f23(c44,f9(f20(c37))),c46))). % 0.20/0.49 cnf(i_0_121, negated_conjecture, (p33(f11(f4(f5(c42)),c45),f11(f4(c42),c45)))). % 0.20/0.49 cnf(i_0_99, negated_conjecture, (p26(c34,f4(f5(X1)),f4(X1)))). % 0.20/0.49 cnf(i_0_128, negated_conjecture, (p2(f11(f4(c47),c48),f19(f11(f4(c42),c48),f9(f20(c37)))))). % 0.20/0.49 cnf(i_0_129, negated_conjecture, (p33(f11(f4(c42),c45),f11(f4(f23(c42,f9(f20(c37)))),c45)))). % 0.20/0.49 cnf(i_0_130, negated_conjecture, (p2(f11(f4(f23(c44,f9(f20(c37)))),c43),f11(f4(c44),c43)))). % 0.20/0.49 cnf(i_0_139, negated_conjecture, (p2(f19(f11(f4(f5(c42)),c43),f9(f20(c37))),f11(f4(c42),c43)))). % 0.20/0.49 cnf(i_0_131, negated_conjecture, (~p2(f11(f4(c46),c43),f11(f4(f23(c44,f9(f20(c37)))),c43)))). % 0.20/0.49 cnf(i_0_100, negated_conjecture, (p25(X1)|~p21(X2,X1)|~p25(X2))). % 0.20/0.49 cnf(i_0_102, negated_conjecture, (p29(X1)|~p7(X2,X1)|~p29(X2))). % 0.20/0.49 cnf(i_0_101, negated_conjecture, (p30(X1)|~p17(X2,X1)|~p30(X2))). % 0.20/0.49 cnf(i_0_103, negated_conjecture, (p28(X1)|~p14(X2,X1)|~p28(X2))). % 0.20/0.49 cnf(i_0_112, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.20/0.49 cnf(i_0_113, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.20/0.49 cnf(i_0_104, negated_conjecture, (p7(f8(X1),f8(X2))|~p6(X1,X2))). % 0.20/0.49 cnf(i_0_111, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))). % 0.20/0.49 cnf(i_0_109, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 0.20/0.49 cnf(i_0_114, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.20/0.49 cnf(i_0_115, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.20/0.49 cnf(i_0_116, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X3,X1))). % 0.20/0.49 cnf(i_0_117, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.20/0.49 cnf(i_0_110, negated_conjecture, (p2(f9(X1),f9(X2))|~p2(X1,X2))). % 0.20/0.49 cnf(i_0_123, negated_conjecture, (p31(f24(X1),f5(c42))|~p31(X1,f5(c42))|~p31(X1,c44))). % 0.20/0.49 cnf(i_0_132, negated_conjecture, (p10(X1,c43)|~p31(f11(f4(f5(c42)),X1),f11(f4(c42),X1)))). % 0.20/0.49 cnf(i_0_140, negated_conjecture, (p32(f22(c34,X1),c43)|~p33(f11(f4(f5(c42)),X1),f11(f4(c42),X1)))). % 0.20/0.49 cnf(i_0_141, negated_conjecture, (p2(f11(f4(X1),c48),f11(f4(c47),c48))|~p31(X1,c42)|~p31(c47,X1))). % 0.20/0.49 cnf(i_0_107, negated_conjecture, (p2(f20(X1),f20(X2))|~p2(X1,X2))). % 0.20/0.49 cnf(i_0_108, negated_conjecture, (p2(f24(X1),f24(X2))|~p2(X1,X2))). % 0.20/0.49 cnf(i_0_118, negated_conjecture, (p17(X1,X2)|~p17(X3,X2)|~p17(X3,X1))). % 0.20/0.49 cnf(i_0_119, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))). % 0.20/0.49 cnf(i_0_120, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))). % 0.20/0.49 cnf(i_0_106, negated_conjecture, (p17(f18(X1),f18(X2))|~p17(X1,X2))). % 0.20/0.49 cnf(i_0_105, negated_conjecture, (p14(f16(X1),f16(X2))|~p14(X1,X2))). % 0.20/0.49 cnf(i_0_142, negated_conjecture, (p2(f11(f4(X1),c43),f11(f4(c44),c43))|~p31(X1,f5(c42))|~p31(c44,X1))). % 0.20/0.49 cnf(i_0_144, negated_conjecture, (~p31(X1,f5(c42))|~p31(X1,c44)|~p2(f11(f4(f24(X1)),c43),f11(f4(X1),c43)))). % 0.20/0.49 cnf(i_0_122, negated_conjecture, (p31(X1,f24(X1))|~p31(X1,f5(c42))|~p31(X1,c44))). % 0.20/0.49 cnf(i_0_146, negated_conjecture, (p10(X1,X2)|~p27(f15(c36,f13(X1,X3)),f13(X2,X4))|~p2(f11(f4(X3),X1),f9(c37)))). % 0.20/0.49 cnf(i_0_126, negated_conjecture, (p31(X1,X2)|~p31(X3,X4)|~p2(X3,X1)|~p2(X4,X2))). % 0.20/0.49 cnf(i_0_134, negated_conjecture, (p2(f23(X1,X2),f23(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.20/0.49 cnf(i_0_127, negated_conjecture, (p32(X1,X2)|~p32(X3,X4)|~p17(X3,X1)|~p10(X4,X2))). % 0.20/0.49 cnf(i_0_124, negated_conjecture, (p33(X1,X2)|~p33(X3,X4)|~p2(X3,X1)|~p2(X4,X2))). % 0.20/0.49 cnf(i_0_125, negated_conjecture, (p27(X1,X2)|~p27(X3,X4)|~p12(X4,X2)|~p14(X3,X1))). % 0.20/0.49 cnf(i_0_135, negated_conjecture, (p2(f19(X1,X2),f19(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.20/0.49 cnf(i_0_137, negated_conjecture, (p17(f22(X1,X2),f22(X3,X4))|~p21(X1,X3)|~p10(X2,X4))). % 0.20/0.49 cnf(i_0_143, negated_conjecture, (p32(f22(c34,X1),X2)|p10(X1,X2)|~p27(f15(c36,f13(X1,X3)),f13(X2,X4)))). % 0.20/0.49 cnf(i_0_138, negated_conjecture, (p14(f15(X1,X2),f15(X3,X4))|~p12(X2,X4)|~p7(X1,X3))). % 0.20/0.49 cnf(i_0_133, negated_conjecture, (p12(f13(X1,X2),f13(X3,X4))|~p2(X2,X4)|~p10(X1,X3))). % 0.20/0.49 cnf(i_0_136, negated_conjecture, (p2(f11(X1,X2),f11(X3,X4))|~p3(X1,X3)|~p10(X2,X4))). % 0.20/0.49 cnf(i_0_145, negated_conjecture, (p26(X1,X2,X3)|~p26(X4,X5,X6)|~p21(X4,X1)|~p3(X5,X2)|~p3(X6,X3))). % 0.20/0.49 cnf(i_0_148, negated_conjecture, (p32(f22(c34,X1),X2)|p31(f11(f4(X3),X2),f11(f4(X4),X2))|~p27(f15(c36,f13(X1,X3)),f13(X2,X4)))). % 0.20/0.49 cnf(i_0_147, negated_conjecture, (p2(X1,X2)|~p27(f15(c36,f13(X3,X2)),f13(X4,X5))|~p27(f15(c36,f13(X6,X1)),f13(X4,X5)))). % 0.20/0.49 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.49 # Begin printing tableau % 0.20/0.49 # Found 8 steps % 0.20/0.49 cnf(i_0_135, negated_conjecture, (p2(f19(f19(f11(f4(f5(c42)),c43),f9(f20(c37))),f19(f11(f4(f5(c42)),c43),f9(f20(c37)))),f19(f11(f4(c42),c43),f11(f4(c42),c43)))|~p2(f19(f11(f4(f5(c42)),c43),f9(f20(c37))),f11(f4(c42),c43))|~p2(f19(f11(f4(f5(c42)),c43),f9(f20(c37))),f11(f4(c42),c43))), inference(start_rule)). % 0.20/0.49 cnf(i_0_176, plain, (~p2(f19(f11(f4(f5(c42)),c43),f9(f20(c37))),f11(f4(c42),c43))), inference(closure_rule, [i_0_139])). % 0.20/0.49 cnf(i_0_177, plain, (~p2(f19(f11(f4(f5(c42)),c43),f9(f20(c37))),f11(f4(c42),c43))), inference(closure_rule, [i_0_139])). % 0.20/0.49 cnf(i_0_175, plain, (p2(f19(f19(f11(f4(f5(c42)),c43),f9(f20(c37))),f19(f11(f4(f5(c42)),c43),f9(f20(c37)))),f19(f11(f4(c42),c43),f11(f4(c42),c43)))), inference(extension_rule, [i_0_133])). % 0.20/0.49 cnf(i_0_2742, plain, (~p10(X5,X5)), inference(closure_rule, [i_0_81])). % 0.20/0.49 cnf(i_0_2740, plain, (p12(f13(X5,f19(f19(f11(f4(f5(c42)),c43),f9(f20(c37))),f19(f11(f4(f5(c42)),c43),f9(f20(c37))))),f13(X5,f19(f11(f4(c42),c43),f11(f4(c42),c43))))), inference(extension_rule, [i_0_138])). % 0.20/0.49 cnf(i_0_3641, plain, (~p7(f8(c35),c36)), inference(closure_rule, [i_0_95])). % 0.20/0.49 cnf(i_0_3639, plain, (p14(f15(f8(c35),f13(X5,f19(f19(f11(f4(f5(c42)),c43),f9(f20(c37))),f19(f11(f4(f5(c42)),c43),f9(f20(c37)))))),f15(c36,f13(X5,f19(f11(f4(c42),c43),f11(f4(c42),c43)))))), inference(etableau_closure_rule, [i_0_3639, ...])). % 0.20/0.49 # End printing tableau % 0.20/0.49 # SZS output end % 0.20/0.49 # Branches closed with saturation will be marked with an "s" % 0.20/0.49 # Child (20399) has found a proof. % 0.20/0.49 % 0.20/0.49 # Proof search is over... % 0.20/0.49 # Freeing feature tree %------------------------------------------------------------------------------