%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN657-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 : n010.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:07 EDT 2022 % Result : Unsatisfiable 0.20s 0.41s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : SYN657-1 : TPTP v8.1.0. Released v2.5.0. % 0.04/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n010.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Tue Jul 12 00:36:15 EDT 2022 % 0.14/0.36 % CPUTime : % 0.20/0.39 # No SInE strategy applied % 0.20/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.39 # % 0.20/0.39 # Presaturation interreduction done % 0.20/0.39 # Number of axioms: 50 Number of unprocessed: 50 % 0.20/0.39 # Tableaux proof search. % 0.20/0.39 # APR header successfully linked. % 0.20/0.39 # Hello from C++ % 0.20/0.40 # The folding up rule is enabled... % 0.20/0.40 # Local unification is enabled... % 0.20/0.40 # Any saturation attempts will use folding labels... % 0.20/0.40 # 50 beginning clauses after preprocessing and clausification % 0.20/0.40 # Creating start rules for all 50 conjectures. % 0.20/0.40 # There are 50 start rule candidates: % 0.20/0.40 # Found 20 unit axioms. % 0.20/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.40 # 50 start rule tableaux created. % 0.20/0.40 # 30 extension rule candidate clauses % 0.20/0.40 # 20 unit axiom clauses % 0.20/0.40 % 0.20/0.40 # Requested 8, 32 cores available to the main process. % 0.20/0.41 # There were 2 total branch saturation attempts. % 0.20/0.41 # There were 0 of these attempts blocked. % 0.20/0.41 # There were 0 deferred branch saturation attempts. % 0.20/0.41 # There were 0 free duplicated saturations. % 0.20/0.41 # There were 2 total successful branch saturations. % 0.20/0.41 # There were 0 successful branch saturations in interreduction. % 0.20/0.41 # There were 0 successful branch saturations on the branch. % 0.20/0.41 # There were 2 successful branch saturations after the branch. % 0.20/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.41 # Begin clausification derivation % 0.20/0.41 % 0.20/0.41 # End clausification derivation % 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.41 cnf(i_0_57, negated_conjecture, (p24(c32,c31))). % 0.20/0.41 cnf(i_0_60, negated_conjecture, (p24(c32,c34))). % 0.20/0.41 cnf(i_0_58, negated_conjecture, (p26(c32,c31))). % 0.20/0.41 cnf(i_0_59, negated_conjecture, (p26(c31,c35))). % 0.20/0.41 cnf(i_0_51, negated_conjecture, (p17(X1,X1))). % 0.20/0.41 cnf(i_0_52, negated_conjecture, (p7(X1,X1))). % 0.20/0.41 cnf(i_0_53, negated_conjecture, (p6(X1,X1))). % 0.20/0.41 cnf(i_0_54, negated_conjecture, (p4(X1,X1))). % 0.20/0.41 cnf(i_0_55, negated_conjecture, (p3(X1,X1))). % 0.20/0.41 cnf(i_0_56, negated_conjecture, (p2(X1,X1))). % 0.20/0.41 cnf(i_0_62, negated_conjecture, (p23(f10(f11(f12(c33))),c28))). % 0.20/0.41 cnf(i_0_64, negated_conjecture, (p25(c32,f18(f8(c27,f9(c28,c29)))))). % 0.20/0.41 cnf(i_0_63, negated_conjecture, (p25(c35,f18(f8(c27,f9(c28,c29)))))). % 0.20/0.41 cnf(i_0_79, negated_conjecture, (p4(f5(f8(c27,f9(c28,c29)),c30,c31),c32))). % 0.20/0.41 cnf(i_0_80, negated_conjecture, (p4(c35,f13(c32,f16(f8(c27,f9(c28,c29)),c31))))). % 0.20/0.41 cnf(i_0_92, negated_conjecture, (p4(f16(f8(c27,f9(c28,c29)),c34),f16(f8(c27,f9(c28,c29)),c31)))). % 0.20/0.41 cnf(i_0_93, negated_conjecture, (p24(c34,f13(c32,f14(f16(f8(c27,f9(c28,c29)),c31),f15(f10(f11(f12(c33))))))))). % 0.20/0.41 cnf(i_0_65, negated_conjecture, (p6(f21(f8(X1,f9(X2,X3))),X2))). % 0.20/0.41 cnf(i_0_61, negated_conjecture, (~p6(c28,f10(c33)))). % 0.20/0.41 cnf(i_0_94, negated_conjecture, (~p4(f5(f8(c27,f9(c28,c29)),c36,c31),f5(f8(c27,f9(c28,c29)),c36,c34)))). % 0.20/0.41 cnf(i_0_66, negated_conjecture, (p17(f18(X1),f18(X2))|~p2(X1,X2))). % 0.20/0.41 cnf(i_0_70, negated_conjecture, (p6(f10(X1),f10(X2))|~p6(X1,X2))). % 0.20/0.41 cnf(i_0_73, negated_conjecture, (p17(X1,X2)|~p17(X3,X2)|~p17(X3,X1))). % 0.20/0.41 cnf(i_0_74, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.20/0.41 cnf(i_0_75, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.20/0.41 cnf(i_0_76, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.20/0.41 cnf(i_0_68, negated_conjecture, (p6(f12(X1),f12(X2))|~p6(X1,X2))). % 0.20/0.41 cnf(i_0_91, negated_conjecture, (~p25(X1,f18(f8(c27,f9(c28,c29))))|~p24(X1,c35)|~p24(c32,X1))). % 0.20/0.41 cnf(i_0_69, negated_conjecture, (p6(f11(X1),f11(X2))|~p6(X1,X2))). % 0.20/0.41 cnf(i_0_67, negated_conjecture, (p6(f21(X1),f21(X2))|~p2(X1,X2))). % 0.20/0.41 cnf(i_0_77, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.20/0.41 cnf(i_0_78, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.20/0.41 cnf(i_0_71, negated_conjecture, (p4(f19(X1),f19(X2))|~p4(X1,X2))). % 0.20/0.41 cnf(i_0_72, negated_conjecture, (p4(f15(X1),f15(X2))|~p6(X1,X2))). % 0.20/0.41 cnf(i_0_95, negated_conjecture, (p24(f19(f20(c31,c34)),f19(f20(c31,X1)))|~p25(X1,f18(f8(c27,f9(c28,c29)))))). % 0.20/0.41 cnf(i_0_100, negated_conjecture, (p26(f19(f20(c31,c35)),f19(f20(c31,X1)))|p26(f19(f20(c31,c32)),f19(f20(c31,X1)))|~p25(X1,f18(f8(c27,f9(c28,c29)))))). % 0.20/0.41 cnf(i_0_86, negated_conjecture, (p7(f9(X1,X2),f9(X3,X4))|~p6(X2,X4)|~p6(X1,X3))). % 0.20/0.41 cnf(i_0_88, negated_conjecture, (p4(f16(X1,X2),f16(X3,X4))|~p2(X1,X3)|~p4(X2,X4))). % 0.20/0.41 cnf(i_0_84, negated_conjecture, (p24(X1,X2)|~p24(X3,X4)|~p4(X4,X2)|~p4(X3,X1))). % 0.20/0.41 cnf(i_0_90, negated_conjecture, (p4(f13(X1,X2),f13(X3,X4))|~p4(X2,X4)|~p4(X1,X3))). % 0.20/0.41 cnf(i_0_82, negated_conjecture, (p26(X1,X2)|~p26(X3,X4)|~p4(X4,X2)|~p4(X3,X1))). % 0.20/0.41 cnf(i_0_81, negated_conjecture, (p23(X1,X2)|~p23(X3,X4)|~p6(X4,X2)|~p6(X3,X1))). % 0.20/0.41 cnf(i_0_83, negated_conjecture, (p25(X1,X2)|~p25(X3,X4)|~p4(X3,X1)|~p17(X4,X2))). % 0.20/0.41 cnf(i_0_87, negated_conjecture, (p4(f20(X1,X2),f20(X3,X4))|~p4(X2,X4)|~p4(X1,X3))). % 0.20/0.41 cnf(i_0_89, negated_conjecture, (p4(f14(X1,X2),f14(X3,X4))|~p4(X2,X4)|~p4(X1,X3))). % 0.20/0.41 cnf(i_0_85, negated_conjecture, (p2(f8(X1,X2),f8(X3,X4))|~p6(X1,X3)|~p7(X2,X4))). % 0.20/0.41 cnf(i_0_98, negated_conjecture, (p25(f22(X1,X2,X3),f18(X1))|p4(f5(X1,c36,X2),f5(X1,c36,X3))|p6(f21(X1),f10(c33)))). % 0.20/0.41 cnf(i_0_96, negated_conjecture, (p4(f5(X1,X2,X3),f5(X4,X5,X6))|~p2(X1,X4)|~p3(X2,X5)|~p4(X3,X6))). % 0.20/0.41 cnf(i_0_97, negated_conjecture, (p4(f22(X1,X2,X3),f22(X4,X5,X6))|~p2(X1,X4)|~p4(X3,X6)|~p4(X2,X5))). % 0.20/0.41 cnf(i_0_99, negated_conjecture, (p4(f5(X1,c36,X2),f5(X1,c36,X3))|p6(f21(X1),f10(c33))|~p24(f19(f20(X2,X3)),f19(f20(X2,f22(X1,X2,X3)))))). % 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.41 # Begin printing tableau % 0.20/0.41 # Found 9 steps % 0.20/0.41 cnf(i_0_99, negated_conjecture, (p4(f5(f8(c27,f9(c28,c29)),c36,c31),f5(f8(c27,f9(c28,c29)),c36,c34))|p6(f21(f8(c27,f9(c28,c29))),f10(c33))|~p24(f19(f20(c31,c34)),f19(f20(c31,f22(f8(c27,f9(c28,c29)),c31,c34))))), inference(start_rule)). % 0.20/0.41 cnf(i_0_101, plain, (p4(f5(f8(c27,f9(c28,c29)),c36,c31),f5(f8(c27,f9(c28,c29)),c36,c34))), inference(closure_rule, [i_0_94])). % 0.20/0.41 cnf(i_0_102, plain, (p6(f21(f8(c27,f9(c28,c29))),f10(c33))), inference(extension_rule, [i_0_85])). % 0.20/0.41 cnf(i_0_225, plain, (~p7(X13,X13)), inference(closure_rule, [i_0_52])). % 0.20/0.41 cnf(i_0_223, plain, (p2(f8(f21(f8(c27,f9(c28,c29))),X13),f8(f10(c33),X13))), inference(extension_rule, [i_0_97])). % 0.20/0.41 cnf(i_0_231, plain, (~p4(f16(f8(c27,f9(c28,c29)),c34),f16(f8(c27,f9(c28,c29)),c31))), inference(closure_rule, [i_0_92])). % 0.20/0.41 cnf(i_0_232, plain, (~p4(f16(f8(c27,f9(c28,c29)),c34),f16(f8(c27,f9(c28,c29)),c31))), inference(closure_rule, [i_0_92])). % 0.20/0.41 cnf(i_0_103, plain, (~p24(f19(f20(c31,c34)),f19(f20(c31,f22(f8(c27,f9(c28,c29)),c31,c34))))), inference(etableau_closure_rule, [i_0_103, ...])). % 0.20/0.41 cnf(i_0_229, plain, (p4(f22(f8(f21(f8(c27,f9(c28,c29))),X13),f16(f8(c27,f9(c28,c29)),c34),f16(f8(c27,f9(c28,c29)),c34)),f22(f8(f10(c33),X13),f16(f8(c27,f9(c28,c29)),c31),f16(f8(c27,f9(c28,c29)),c31)))), inference(etableau_closure_rule, [i_0_229, ...])). % 0.20/0.41 # End printing tableau % 0.20/0.41 # SZS output end % 0.20/0.41 # Branches closed with saturation will be marked with an "s" % 0.20/0.41 # Child (8492) has found a proof. % 0.20/0.41 % 0.20/0.41 # Proof search is over... % 0.20/0.41 # Freeing feature tree %------------------------------------------------------------------------------