%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN645-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:02 EDT 2022 % Result : Unsatisfiable 5.98s 1.17s % Output : CNFRefutation 5.98s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : SYN645-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 : Mon Jul 11 22:10:15 EDT 2022 % 0.14/0.36 % CPUTime : % 0.21/0.39 # No SInE strategy applied % 0.21/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN % 0.21/0.39 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.21/0.39 # % 0.21/0.39 # Presaturation interreduction done % 0.21/0.39 # Number of axioms: 42 Number of unprocessed: 42 % 0.21/0.39 # Tableaux proof search. % 0.21/0.39 # APR header successfully linked. % 0.21/0.39 # Hello from C++ % 0.21/0.39 # The folding up rule is enabled... % 0.21/0.39 # Local unification is enabled... % 0.21/0.39 # Any saturation attempts will use folding labels... % 0.21/0.39 # 42 beginning clauses after preprocessing and clausification % 0.21/0.39 # Creating start rules for all 42 conjectures. % 0.21/0.39 # There are 42 start rule candidates: % 0.21/0.39 # Found 11 unit axioms. % 0.21/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.21/0.39 # 42 start rule tableaux created. % 0.21/0.39 # 31 extension rule candidate clauses % 0.21/0.39 # 11 unit axiom clauses % 0.21/0.39 % 0.21/0.39 # Requested 8, 32 cores available to the main process. % 5.98/1.17 # There were 2 total branch saturation attempts. % 5.98/1.17 # There were 0 of these attempts blocked. % 5.98/1.17 # There were 0 deferred branch saturation attempts. % 5.98/1.17 # There were 0 free duplicated saturations. % 5.98/1.17 # There were 2 total successful branch saturations. % 5.98/1.17 # There were 0 successful branch saturations in interreduction. % 5.98/1.17 # There were 0 successful branch saturations on the branch. % 5.98/1.17 # There were 2 successful branch saturations after the branch. % 5.98/1.17 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.98/1.17 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.98/1.17 # Begin clausification derivation % 5.98/1.17 % 5.98/1.17 # End clausification derivation % 5.98/1.17 # Begin listing active clauses obtained from FOF to CNF conversion % 5.98/1.17 cnf(i_0_43, negated_conjecture, (p12(X1,X1))). % 5.98/1.17 cnf(i_0_49, negated_conjecture, (p22(f3(f4(f5(c26))),c27))). % 5.98/1.17 cnf(i_0_51, negated_conjecture, (p23(c28,f8(f10(c29,f11(c27,c30)))))). % 5.98/1.17 cnf(i_0_44, negated_conjecture, (p9(X1,X1))). % 5.98/1.17 cnf(i_0_45, negated_conjecture, (p7(X1,X1))). % 5.98/1.17 cnf(i_0_46, negated_conjecture, (p6(X1,X1))). % 5.98/1.17 cnf(i_0_47, negated_conjecture, (p2(X1,X1))). % 5.98/1.17 cnf(i_0_48, negated_conjecture, (p15(X1,X1))). % 5.98/1.17 cnf(i_0_75, negated_conjecture, (p12(f13(f14(c31,c28)),f13(f14(c31,f16(f10(c29,f11(c27,c30)),c32,c31)))))). % 5.98/1.17 cnf(i_0_64, negated_conjecture, (~p12(c28,f16(f10(c29,f11(c27,c30)),c32,c31)))). % 5.98/1.17 cnf(i_0_74, negated_conjecture, (~p24(f17(f10(c29,f11(c27,c30)),f16(f10(c29,f11(c27,c30)),c32,c31))))). % 5.98/1.17 cnf(i_0_50, negated_conjecture, (p24(X1)|~p24(X2)|~p2(X2,X1))). % 5.98/1.17 cnf(i_0_53, negated_conjecture, (p12(f13(X1),f13(X2))|~p12(X1,X2))). % 5.98/1.17 cnf(i_0_54, negated_conjecture, (p12(f19(X1),f19(X2))|~p2(X1,X2))). % 5.98/1.17 cnf(i_0_52, negated_conjecture, (p7(f8(X1),f8(X2))|~p6(X1,X2))). % 5.98/1.17 cnf(i_0_57, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 5.98/1.17 cnf(i_0_56, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))). % 5.98/1.17 cnf(i_0_55, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 5.98/1.17 cnf(i_0_58, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))). % 5.98/1.17 cnf(i_0_59, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))). % 5.98/1.17 cnf(i_0_60, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 5.98/1.17 cnf(i_0_61, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 5.98/1.17 cnf(i_0_62, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 5.98/1.17 cnf(i_0_63, negated_conjecture, (p15(X1,X2)|~p15(X3,X2)|~p15(X3,X1))). % 5.98/1.17 cnf(i_0_68, negated_conjecture, (p12(f14(X1,X2),f14(X3,X4))|~p12(X2,X4)|~p12(X1,X3))). % 5.98/1.17 cnf(i_0_72, negated_conjecture, (p12(f20(X1,X2),f20(X3,X4))|~p6(X1,X3)|~p12(X2,X4))). % 5.98/1.17 cnf(i_0_73, negated_conjecture, (p12(f18(X1,X2),f18(X3,X4))|~p12(X2,X4)|~p12(X1,X3))). % 5.98/1.17 cnf(i_0_66, negated_conjecture, (p22(X1,X2)|~p22(X3,X4)|~p2(X3,X1)|~p2(X4,X2))). % 5.98/1.17 cnf(i_0_69, negated_conjecture, (p9(f11(X1,X2),f11(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 5.98/1.17 cnf(i_0_67, negated_conjecture, (p23(X1,X2)|~p23(X3,X4)|~p7(X4,X2)|~p12(X3,X1))). % 5.98/1.17 cnf(i_0_65, negated_conjecture, (p25(X1,X2)|~p25(X3,X4)|~p12(X3,X1)|~p12(X4,X2))). % 5.98/1.17 cnf(i_0_70, negated_conjecture, (p6(f10(X1,X2),f10(X3,X4))|~p2(X1,X3)|~p9(X2,X4))). % 5.98/1.17 cnf(i_0_71, negated_conjecture, (p2(f17(X1,X2),f17(X3,X4))|~p6(X1,X3)|~p12(X2,X4))). % 5.98/1.17 cnf(i_0_76, negated_conjecture, (p12(f16(X1,X2,X3),f16(X4,X5,X6))|~p15(X2,X5)|~p6(X1,X4)|~p12(X3,X6))). % 5.98/1.17 cnf(i_0_77, negated_conjecture, (p23(f16(f10(X1,f11(X2,X3)),c32,X4),f8(f10(X1,f11(X2,X3))))|~p22(f3(f4(f5(c26))),X2))). % 5.98/1.17 cnf(i_0_79, negated_conjecture, (p25(f13(f14(X1,f16(f10(X2,f11(X3,X4)),c32,X1))),f13(f14(X1,X5)))|~p23(X5,f8(f10(X2,f11(X3,X4))))|~p22(f3(f4(f5(c26))),X3))). % 5.98/1.17 cnf(i_0_80, negated_conjecture, (p25(f13(f14(X1,f16(f10(X2,f11(X3,X4)),c32,X1))),f18(f20(f10(X2,f11(X3,X4)),X1),f19(f3(f4(f5(c26))))))|~p22(f3(f4(f5(c26))),X3))). % 5.98/1.17 cnf(i_0_82, negated_conjecture, (p12(X1,f16(f10(X2,f11(X3,X4)),c32,X5))|~p25(f13(f14(X5,X1)),f13(f14(X5,f21(X2,X3,X4,X5,X1))))|~p23(X1,f8(f10(X2,f11(X3,X4))))|~p24(f17(f10(X2,f11(X3,X4)),X1))|~p22(f3(f4(f5(c26))),X3))). % 5.98/1.17 cnf(i_0_81, negated_conjecture, (p23(f21(X1,X2,X3,X4,X5),f8(f10(X1,f11(X2,X3))))|p12(X5,f16(f10(X1,f11(X2,X3)),c32,X4))|~p23(X5,f8(f10(X1,f11(X2,X3))))|~p24(f17(f10(X1,f11(X2,X3)),X5))|~p22(f3(f4(f5(c26))),X2))). % 5.98/1.17 cnf(i_0_78, negated_conjecture, (p12(f21(X1,X2,X3,X4,X5),f21(X6,X7,X8,X9,X10))|~p2(X3,X8)|~p2(X2,X7)|~p2(X1,X6)|~p12(X5,X10)|~p12(X4,X9))). % 5.98/1.17 cnf(i_0_84, negated_conjecture, (p24(f17(f10(X1,f11(X2,X3)),f16(f10(X1,f11(X2,X3)),c32,X4)))|p12(X5,f16(f10(X1,f11(X2,X3)),c32,X4))|~p25(f13(f14(X4,X5)),f13(f14(X4,f21(X1,X2,X3,X4,X5))))|~p23(X5,f8(f10(X1,f11(X2,X3))))|~p22(f3(f4(f5(c26))),X2))). % 5.98/1.17 cnf(i_0_83, negated_conjecture, (p23(f21(X1,X2,X3,X4,X5),f8(f10(X1,f11(X2,X3))))|p24(f17(f10(X1,f11(X2,X3)),f16(f10(X1,f11(X2,X3)),c32,X4)))|p12(X5,f16(f10(X1,f11(X2,X3)),c32,X4))|~p23(X5,f8(f10(X1,f11(X2,X3))))|~p22(f3(f4(f5(c26))),X2))). % 5.98/1.17 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 5.98/1.17 # Begin printing tableau % 5.98/1.17 # Found 14 steps % 5.98/1.17 cnf(i_0_84, negated_conjecture, (p24(f17(f10(c29,f11(c27,c30)),f16(f10(c29,f11(c27,c30)),c32,c31)))|p12(c28,f16(f10(c29,f11(c27,c30)),c32,c31))|~p25(f13(f14(c31,c28)),f13(f14(c31,f21(c29,c27,c30,c31,c28))))|~p23(c28,f8(f10(c29,f11(c27,c30))))|~p22(f3(f4(f5(c26))),c27)), inference(start_rule)). % 5.98/1.17 cnf(i_0_90, plain, (p24(f17(f10(c29,f11(c27,c30)),f16(f10(c29,f11(c27,c30)),c32,c31)))), inference(closure_rule, [i_0_74])). % 5.98/1.17 cnf(i_0_91, plain, (p12(c28,f16(f10(c29,f11(c27,c30)),c32,c31))), inference(closure_rule, [i_0_64])). % 5.98/1.17 cnf(i_0_93, plain, (~p23(c28,f8(f10(c29,f11(c27,c30))))), inference(closure_rule, [i_0_51])). % 5.98/1.17 cnf(i_0_94, plain, (~p22(f3(f4(f5(c26))),c27)), inference(closure_rule, [i_0_49])). % 5.98/1.17 cnf(i_0_92, plain, (~p25(f13(f14(c31,c28)),f13(f14(c31,f21(c29,c27,c30,c31,c28))))), inference(extension_rule, [i_0_65])). % 5.98/1.17 cnf(i_0_241, plain, (~p12(f13(f14(c31,c28)),f13(f14(c31,c28)))), inference(closure_rule, [i_0_43])). % 5.98/1.17 cnf(i_0_240, plain, (~p25(f13(f14(c31,c28)),f13(f14(c31,f16(f10(c29,f11(c27,c30)),c32,c31))))), inference(extension_rule, [i_0_65])). % 5.98/1.17 cnf(i_0_342, plain, (~p12(f13(f14(c31,c28)),f13(f14(c31,f16(f10(c29,f11(c27,c30)),c32,c31))))), inference(closure_rule, [i_0_75])). % 5.98/1.17 cnf(i_0_242, plain, (~p12(f13(f14(c31,f16(f10(c29,f11(c27,c30)),c32,c31))),f13(f14(c31,f21(c29,c27,c30,c31,c28))))), inference(etableau_closure_rule, [i_0_242, ...])). % 5.98/1.17 cnf(i_0_340, plain, (~p25(f13(f14(c31,f16(f10(c29,f11(c27,c30)),c32,c31))),f13(f14(c31,c28)))), inference(extension_rule, [i_0_79])). % 5.98/1.17 cnf(i_0_18915, plain, (~p23(c28,f8(f10(c29,f11(c27,c30))))), inference(closure_rule, [i_0_51])). % 5.98/1.17 cnf(i_0_18916, plain, (~p22(f3(f4(f5(c26))),c27)), inference(closure_rule, [i_0_49])). % 5.98/1.17 cnf(i_0_341, plain, (~p12(f13(f14(c31,f16(f10(c29,f11(c27,c30)),c32,c31))),f13(f14(c31,c28)))), inference(etableau_closure_rule, [i_0_341, ...])). % 5.98/1.17 # End printing tableau % 5.98/1.17 # SZS output end % 5.98/1.17 # Branches closed with saturation will be marked with an "s" % 6.26/1.17 # Child (21648) has found a proof. % 6.26/1.17 % 6.26/1.17 # Proof search is over... % 6.26/1.17 # Freeing feature tree %------------------------------------------------------------------------------