%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN687-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:19 EDT 2022 % Result : Unsatisfiable 0.18s 0.37s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SYN687-1 : TPTP v8.1.0. Released v2.5.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n025.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jul 11 16:16:47 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.36 # No SInE strategy applied % 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.18/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.18/0.36 # % 0.18/0.36 # Presaturation interreduction done % 0.18/0.36 # Number of axioms: 60 Number of unprocessed: 60 % 0.18/0.36 # Tableaux proof search. % 0.18/0.36 # APR header successfully linked. % 0.18/0.36 # Hello from C++ % 0.18/0.37 # The folding up rule is enabled... % 0.18/0.37 # Local unification is enabled... % 0.18/0.37 # Any saturation attempts will use folding labels... % 0.18/0.37 # 60 beginning clauses after preprocessing and clausification % 0.18/0.37 # Creating start rules for all 60 conjectures. % 0.18/0.37 # There are 60 start rule candidates: % 0.18/0.37 # Found 20 unit axioms. % 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.18/0.37 # 60 start rule tableaux created. % 0.18/0.37 # 40 extension rule candidate clauses % 0.18/0.37 # 20 unit axiom clauses % 0.18/0.37 % 0.18/0.37 # Requested 8, 32 cores available to the main process. % 0.18/0.37 # There were 1 total branch saturation attempts. % 0.18/0.37 # There were 0 of these attempts blocked. % 0.18/0.37 # There were 0 deferred branch saturation attempts. % 0.18/0.37 # There were 0 free duplicated saturations. % 0.18/0.37 # There were 1 total successful branch saturations. % 0.18/0.37 # There were 1 successful branch saturations in interreduction. % 0.18/0.37 # There were 0 successful branch saturations on the branch. % 0.18/0.37 # There were 0 successful branch saturations after the branch. % 0.18/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.37 # Begin clausification derivation % 0.18/0.37 % 0.18/0.37 # End clausification derivation % 0.18/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.37 cnf(i_0_79, negated_conjecture, (p34(c36,c37))). % 0.18/0.37 cnf(i_0_61, negated_conjecture, (p10(X1,X1))). % 0.18/0.37 cnf(i_0_62, negated_conjecture, (p8(X1,X1))). % 0.18/0.37 cnf(i_0_63, negated_conjecture, (p6(X1,X1))). % 0.18/0.37 cnf(i_0_64, negated_conjecture, (p4(X1,X1))). % 0.18/0.37 cnf(i_0_65, negated_conjecture, (p33(X1,X1))). % 0.18/0.37 cnf(i_0_66, negated_conjecture, (p31(X1,X1))). % 0.18/0.37 cnf(i_0_67, negated_conjecture, (p3(X1,X1))). % 0.18/0.37 cnf(i_0_68, negated_conjecture, (p29(X1,X1))). % 0.18/0.37 cnf(i_0_69, negated_conjecture, (p27(X1,X1))). % 0.18/0.37 cnf(i_0_70, negated_conjecture, (p25(X1,X1))). % 0.18/0.37 cnf(i_0_71, negated_conjecture, (p23(X1,X1))). % 0.18/0.37 cnf(i_0_72, negated_conjecture, (p21(X1,X1))). % 0.18/0.37 cnf(i_0_73, negated_conjecture, (p2(X1,X1))). % 0.18/0.37 cnf(i_0_74, negated_conjecture, (p19(X1,X1))). % 0.18/0.37 cnf(i_0_75, negated_conjecture, (p17(X1,X1))). % 0.18/0.37 cnf(i_0_76, negated_conjecture, (p15(X1,X1))). % 0.18/0.37 cnf(i_0_77, negated_conjecture, (p13(X1,X1))). % 0.18/0.37 cnf(i_0_78, negated_conjecture, (p11(X1,X1))). % 0.18/0.37 cnf(i_0_100, negated_conjecture, (~p4(f5(X1,f7(c38,X1)),f5(f9(c39,X1),f7(c38,X1))))). % 0.18/0.37 cnf(i_0_80, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.18/0.37 cnf(i_0_81, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.18/0.37 cnf(i_0_82, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.18/0.37 cnf(i_0_83, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.18/0.37 cnf(i_0_84, negated_conjecture, (p33(X1,X2)|~p33(X3,X2)|~p33(X3,X1))). % 0.18/0.37 cnf(i_0_85, negated_conjecture, (p31(X1,X2)|~p31(X3,X2)|~p31(X3,X1))). % 0.18/0.37 cnf(i_0_86, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.18/0.37 cnf(i_0_87, negated_conjecture, (p29(X1,X2)|~p29(X3,X2)|~p29(X3,X1))). % 0.18/0.37 cnf(i_0_88, negated_conjecture, (p27(X1,X2)|~p27(X3,X2)|~p27(X3,X1))). % 0.18/0.37 cnf(i_0_89, negated_conjecture, (p25(X1,X2)|~p25(X3,X2)|~p25(X3,X1))). % 0.18/0.37 cnf(i_0_90, negated_conjecture, (p23(X1,X2)|~p23(X3,X2)|~p23(X3,X1))). % 0.18/0.37 cnf(i_0_91, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X3,X1))). % 0.18/0.37 cnf(i_0_92, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.18/0.37 cnf(i_0_93, negated_conjecture, (p19(X1,X2)|~p19(X3,X2)|~p19(X3,X1))). % 0.18/0.37 cnf(i_0_94, negated_conjecture, (p17(X1,X2)|~p17(X3,X2)|~p17(X3,X1))). % 0.18/0.37 cnf(i_0_95, negated_conjecture, (p15(X1,X2)|~p15(X3,X2)|~p15(X3,X1))). % 0.18/0.37 cnf(i_0_96, negated_conjecture, (p13(X1,X2)|~p13(X3,X2)|~p13(X3,X1))). % 0.18/0.37 cnf(i_0_97, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))). % 0.18/0.37 cnf(i_0_99, negated_conjecture, (p34(X1,X2)|~p34(X3,X4)|~p33(X3,X1)|~p10(X4,X2))). % 0.18/0.37 cnf(i_0_102, negated_conjecture, (p6(f20(X1,X2),f20(X3,X4))|~p19(X1,X3)|~p2(X2,X4))). % 0.18/0.37 cnf(i_0_98, negated_conjecture, (p35(X1,X2)|~p35(X3,X4)|~p11(X3,X1)|~p3(X4,X2))). % 0.18/0.37 cnf(i_0_104, negated_conjecture, (p3(f7(X1,X2),f7(X3,X4))|~p2(X2,X4)|~p6(X1,X3))). % 0.18/0.37 cnf(i_0_105, negated_conjecture, (p3(f30(X1,X2),f30(X3,X4))|~p29(X1,X3)|~p8(X2,X4))). % 0.18/0.37 cnf(i_0_106, negated_conjecture, (p3(f14(X1,X2),f14(X3,X4))|~p13(X1,X3)|~p3(X2,X4))). % 0.18/0.37 cnf(i_0_107, negated_conjecture, (p29(f32(X1,X2),f32(X3,X4))|~p31(X1,X3)|~p10(X2,X4))). % 0.18/0.37 cnf(i_0_108, negated_conjecture, (p25(f28(X1,X2),f28(X3,X4))|~p27(X1,X3)|~p10(X2,X4))). % 0.18/0.37 cnf(i_0_109, negated_conjecture, (p21(f24(X1,X2),f24(X3,X4))|~p23(X1,X3)|~p10(X2,X4))). % 0.18/0.37 cnf(i_0_110, negated_conjecture, (p2(f9(X1,X2),f9(X3,X4))|~p2(X2,X4)|~p8(X1,X3))). % 0.18/0.37 cnf(i_0_111, negated_conjecture, (p2(f26(X1,X2),f26(X3,X4))|~p25(X1,X3)|~p8(X2,X4))). % 0.18/0.37 cnf(i_0_103, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p2(X1,X3)|~p3(X2,X4))). % 0.18/0.37 cnf(i_0_112, negated_conjecture, (p19(f22(X1,X2),f22(X3,X4))|~p21(X1,X3)|~p8(X2,X4))). % 0.18/0.37 cnf(i_0_113, negated_conjecture, (p15(f18(X1,X2),f18(X3,X4))|~p17(X1,X3)|~p2(X2,X4))). % 0.18/0.37 cnf(i_0_114, negated_conjecture, (p13(f16(X1,X2),f16(X3,X4))|~p15(X1,X3)|~p2(X2,X4))). % 0.18/0.37 cnf(i_0_101, negated_conjecture, (p11(f12(X1,X2),f12(X3,X4))|~p3(X2,X4)|~p10(X1,X3))). % 0.18/0.37 cnf(i_0_116, negated_conjecture, (p4(f5(f9(c39,X1),X2),f5(f9(c39,X3),X2))|~p4(f5(X1,f14(f16(f18(c40,X1),X3),X2)),f5(X3,f14(f16(f18(c40,X1),X3),X2))))). % 0.18/0.37 cnf(i_0_115, negated_conjecture, (p35(f12(c37,f14(f16(f18(c40,X1),X2),X3)),X3)|p4(f5(f9(c39,X1),X3),f5(f9(c39,X2),X3)))). % 0.18/0.37 cnf(i_0_118, negated_conjecture, (p4(f5(f26(f28(c46,X1),X2),X3),f5(f9(X2,f26(f28(c46,X1),X2)),X3))|~p34(c36,X1)|~p4(f5(f9(X2,f26(f28(c46,X1),X2)),f30(f32(c45,X1),X2)),f5(f9(X2,f26(f28(c47,X1),X2)),f30(f32(c45,X1),X2))))). % 0.18/0.37 cnf(i_0_117, negated_conjecture, (p4(f5(f26(f28(c46,X1),X2),X3),f5(f9(X2,f26(f28(c46,X1),X2)),X3))|p4(f5(f26(f28(c46,X1),X2),X4),f5(f26(f28(c47,X1),X2),X4))|~p35(f12(X1,X4),f30(f32(c45,X1),X2))|~p34(c36,X1))). % 0.18/0.37 cnf(i_0_120, negated_conjecture, (p2(X1,X2)|~p34(c36,X3)|~p4(f5(f9(X4,f26(f28(c42,X3),X4)),f30(f32(c41,X3),X4)),f5(f9(X4,f26(f28(c43,X3),X4)),f30(f32(c41,X3),X4)))|~p4(f5(X2,f7(f20(f22(f24(c44,X3),X4),X1),X2)),f5(f9(X4,X2),f7(f20(f22(f24(c44,X3),X4),X1),X2)))|~p4(f5(X1,f7(f20(f22(f24(c44,X3),X4),X1),X2)),f5(f9(X4,X1),f7(f20(f22(f24(c44,X3),X4),X1),X2))))). % 0.18/0.37 cnf(i_0_119, negated_conjecture, (p2(X1,X2)|p4(f5(f26(f28(c42,X3),X4),X5),f5(f26(f28(c43,X3),X4),X5))|~p35(f12(X3,X5),f30(f32(c41,X3),X4))|~p34(c36,X3)|~p4(f5(X2,f7(f20(f22(f24(c44,X3),X4),X1),X2)),f5(f9(X4,X2),f7(f20(f22(f24(c44,X3),X4),X1),X2)))|~p4(f5(X1,f7(f20(f22(f24(c44,X3),X4),X1),X2)),f5(f9(X4,X1),f7(f20(f22(f24(c44,X3),X4),X1),X2))))). % 0.18/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.37 # Begin printing tableau % 0.18/0.37 # Found 13 steps % 0.18/0.37 cnf(i_0_117, negated_conjecture, (p4(f5(f26(f28(c46,c37),c39),f7(c38,f26(f28(c46,c37),c39))),f5(f9(c39,f26(f28(c46,c37),c39)),f7(c38,f26(f28(c46,c37),c39))))|p4(f5(f26(f28(c46,c37),c39),f14(f16(f18(c40,f26(f28(c46,c37),c39)),f26(f28(c47,c37),c39)),f30(f32(c45,c37),c39))),f5(f26(f28(c47,c37),c39),f14(f16(f18(c40,f26(f28(c46,c37),c39)),f26(f28(c47,c37),c39)),f30(f32(c45,c37),c39))))|~p35(f12(c37,f14(f16(f18(c40,f26(f28(c46,c37),c39)),f26(f28(c47,c37),c39)),f30(f32(c45,c37),c39))),f30(f32(c45,c37),c39))|~p34(c36,c37)), inference(start_rule)). % 0.18/0.37 cnf(i_0_132, plain, (p4(f5(f26(f28(c46,c37),c39),f7(c38,f26(f28(c46,c37),c39))),f5(f9(c39,f26(f28(c46,c37),c39)),f7(c38,f26(f28(c46,c37),c39))))), inference(closure_rule, [i_0_100])). % 0.18/0.37 cnf(i_0_135, plain, (~p34(c36,c37)), inference(closure_rule, [i_0_79])). % 0.18/0.37 cnf(i_0_133, plain, (p4(f5(f26(f28(c46,c37),c39),f14(f16(f18(c40,f26(f28(c46,c37),c39)),f26(f28(c47,c37),c39)),f30(f32(c45,c37),c39))),f5(f26(f28(c47,c37),c39),f14(f16(f18(c40,f26(f28(c46,c37),c39)),f26(f28(c47,c37),c39)),f30(f32(c45,c37),c39))))), inference(extension_rule, [i_0_116])). % 0.18/0.37 cnf(i_0_287, plain, (p4(f5(f9(c39,f26(f28(c46,c37),c39)),f30(f32(c45,c37),c39)),f5(f9(c39,f26(f28(c47,c37),c39)),f30(f32(c45,c37),c39)))), inference(extension_rule, [i_0_118])). % 0.18/0.37 cnf(i_0_304, plain, (p4(f5(f26(f28(c46,c37),c39),f7(c38,f26(f28(c46,c37),c39))),f5(f9(c39,f26(f28(c46,c37),c39)),f7(c38,f26(f28(c46,c37),c39))))), inference(closure_rule, [i_0_100])). % 0.18/0.37 cnf(i_0_305, plain, (~p34(c36,c37)), inference(closure_rule, [i_0_79])). % 0.18/0.37 cnf(i_0_134, plain, (~p35(f12(c37,f14(f16(f18(c40,f26(f28(c46,c37),c39)),f26(f28(c47,c37),c39)),f30(f32(c45,c37),c39))),f30(f32(c45,c37),c39))), inference(extension_rule, [i_0_115])). % 0.18/0.37 cnf(i_0_323, plain, (p4(f5(f9(c39,f26(f28(c46,c37),c39)),f30(f32(c45,c37),c39)),f5(f9(c39,f26(f28(c47,c37),c39)),f30(f32(c45,c37),c39)))), inference(extension_rule, [i_0_83])). % 0.18/0.37 cnf(i_0_431, plain, (p4(f5(f9(c39,f26(f28(c46,c37),c39)),f30(f32(c45,c37),c39)),f5(f9(c39,f26(f28(c47,c37),c39)),f30(f32(c45,c37),c39)))), inference(extension_rule, [i_0_118])). % 0.18/0.37 cnf(i_0_552, plain, (p4(f5(f26(f28(c46,c37),c39),f7(c38,f26(f28(c46,c37),c39))),f5(f9(c39,f26(f28(c46,c37),c39)),f7(c38,f26(f28(c46,c37),c39))))), inference(closure_rule, [i_0_100])). % 0.18/0.37 cnf(i_0_553, plain, (~p34(c36,c37)), inference(closure_rule, [i_0_79])). % 0.18/0.37 cnf(i_0_433, plain, (~p4(f5(f9(c39,f26(f28(c46,c37),c39)),f30(f32(c45,c37),c39)),f5(f9(c39,f26(f28(c46,c37),c39)),f30(f32(c45,c37),c39)))), inference(etableau_closure_rule, [i_0_433, ...])). % 0.18/0.37 # End printing tableau % 0.18/0.37 # SZS output end % 0.18/0.37 # Branches closed with saturation will be marked with an "s" % 0.18/0.37 # Child (11476) has found a proof. % 0.18/0.37 % 0.18/0.37 # Proof search is over... % 0.18/0.37 # Freeing feature tree %------------------------------------------------------------------------------