%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN635-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 : n019.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:58 EDT 2022 % Result : Unsatisfiable 0.13s 0.39s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN635-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.13/0.34 % Computer : n019.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue Jul 12 05:44:23 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 40 Number of unprocessed: 40 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 40 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 40 conjectures. % 0.13/0.37 # There are 40 start rule candidates: % 0.13/0.37 # Found 9 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 40 start rule tableaux created. % 0.13/0.37 # 31 extension rule candidate clauses % 0.13/0.37 # 9 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There were 3 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 0 free duplicated saturations. % 0.13/0.39 # There were 3 total successful branch saturations. % 0.13/0.39 # There were 1 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 2 successful branch saturations after the branch. % 0.13/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_41, negated_conjecture, (p10(X1,X1))). % 0.13/0.39 cnf(i_0_42, negated_conjecture, (p9(X1,X1))). % 0.13/0.39 cnf(i_0_43, negated_conjecture, (p5(X1,X1))). % 0.13/0.39 cnf(i_0_44, negated_conjecture, (p3(X1,X1))). % 0.13/0.39 cnf(i_0_45, negated_conjecture, (p2(X1,X1))). % 0.13/0.39 cnf(i_0_46, negated_conjecture, (p14(X1,X1))). % 0.13/0.39 cnf(i_0_48, negated_conjecture, (p3(f4(f6(X1,f7(X2,X3))),X2))). % 0.13/0.39 cnf(i_0_47, negated_conjecture, (~p3(c23,f8(c24)))). % 0.13/0.39 cnf(i_0_65, negated_conjecture, (~p10(f11(f6(c25,f7(c23,c26)),c27,c28),f11(f6(c25,f7(c23,c26)),c27,c29)))). % 0.13/0.39 cnf(i_0_54, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.13/0.39 cnf(i_0_55, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))). % 0.13/0.39 cnf(i_0_56, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.13/0.39 cnf(i_0_50, negated_conjecture, (p10(f12(X1),f12(X2))|~p10(X1,X2))). % 0.13/0.39 cnf(i_0_67, negated_conjecture, (p21(f12(f13(c28,c29)),f12(f13(c28,X1)))|~p22(X1,f15(f6(c25,f7(c23,c26)))))). % 0.13/0.39 cnf(i_0_66, negated_conjecture, (p21(f12(f13(c28,c29)),f12(f13(c28,X1)))|~p22(X1,f16(f6(c25,f7(c23,c26)))))). % 0.13/0.39 cnf(i_0_49, negated_conjecture, (p3(f8(X1),f8(X2))|~p3(X1,X2))). % 0.13/0.39 cnf(i_0_53, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))). % 0.13/0.39 cnf(i_0_51, negated_conjecture, (p14(f15(X1),f15(X2))|~p2(X1,X2))). % 0.13/0.39 cnf(i_0_52, negated_conjecture, (p14(f16(X1),f16(X2))|~p2(X1,X2))). % 0.13/0.39 cnf(i_0_57, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.13/0.39 cnf(i_0_58, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.13/0.39 cnf(i_0_59, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))). % 0.13/0.39 cnf(i_0_60, negated_conjecture, (p22(X1,X2)|~p22(X3,X4)|~p14(X4,X2)|~p10(X3,X1))). % 0.13/0.39 cnf(i_0_62, negated_conjecture, (p10(f13(X1,X2),f13(X3,X4))|~p10(X2,X4)|~p10(X1,X3))). % 0.13/0.39 cnf(i_0_63, negated_conjecture, (p5(f7(X1,X2),f7(X3,X4))|~p3(X2,X4)|~p3(X1,X3))). % 0.13/0.39 cnf(i_0_64, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p3(X1,X3)|~p5(X2,X4))). % 0.13/0.39 cnf(i_0_61, negated_conjecture, (p21(X1,X2)|~p21(X3,X4)|~p10(X3,X1)|~p10(X4,X2))). % 0.13/0.39 cnf(i_0_68, negated_conjecture, (p10(f11(X1,X2,X3),f11(X4,X5,X6))|~p2(X1,X4)|~p9(X2,X5)|~p10(X3,X6))). % 0.13/0.39 cnf(i_0_74, negated_conjecture, (p22(f20(X1,X2,X3),f15(X1))|p3(f4(X1),f8(c24))|p10(f11(X1,c32,X2),f11(X1,c32,X3)))). % 0.13/0.39 cnf(i_0_69, negated_conjecture, (p10(f20(X1,X2,X3),f20(X4,X5,X6))|~p2(X1,X4)|~p10(X3,X6)|~p10(X2,X5))). % 0.13/0.39 cnf(i_0_70, negated_conjecture, (p10(f19(X1,X2,X3),f19(X4,X5,X6))|~p2(X1,X4)|~p10(X3,X6)|~p10(X2,X5))). % 0.13/0.39 cnf(i_0_71, negated_conjecture, (p10(f18(X1,X2,X3),f18(X4,X5,X6))|~p2(X1,X4)|~p10(X3,X6)|~p10(X2,X5))). % 0.13/0.39 cnf(i_0_72, negated_conjecture, (p10(f17(X1,X2,X3),f17(X4,X5,X6))|~p2(X1,X4)|~p10(X3,X6)|~p10(X2,X5))). % 0.13/0.39 cnf(i_0_75, negated_conjecture, (p22(f19(X1,X2,X3),f16(X1))|p3(f4(X1),f8(c24))|p10(f11(X1,c27,X2),f11(X1,c27,X3)))). % 0.13/0.39 cnf(i_0_76, negated_conjecture, (p22(f18(X1,X2,X3),f16(X1))|p3(f4(X1),f8(c24))|p10(f11(X1,c31,X2),f11(X1,c31,X3)))). % 0.13/0.39 cnf(i_0_73, negated_conjecture, (p22(f17(X1,X2,X3),f16(X1))|p3(f4(X1),f8(c24))|p10(f11(X1,c30,X2),f11(X1,c30,X3)))). % 0.13/0.39 cnf(i_0_80, negated_conjecture, (p3(f4(X1),f8(c24))|p10(f11(X1,c27,X2),f11(X1,c27,X3))|~p21(f12(f13(X2,X3)),f12(f13(X2,f19(X1,X2,X3)))))). % 0.13/0.39 cnf(i_0_78, negated_conjecture, (p3(f4(X1),f8(c24))|p10(f11(X1,c30,X2),f11(X1,c30,X3))|~p21(f12(f13(X2,X3)),f12(f13(X2,f17(X1,X2,X3)))))). % 0.13/0.39 cnf(i_0_77, negated_conjecture, (p3(f4(X1),f8(c24))|p10(f11(X1,c32,X2),f11(X1,c32,X3))|~p21(f12(f13(X2,X3)),f12(f13(X2,f20(X1,X2,X3)))))). % 0.13/0.39 cnf(i_0_79, negated_conjecture, (p3(f4(X1),f8(c24))|p10(f11(X1,c31,X2),f11(X1,c31,X3))|~p21(f12(f13(X2,X3)),f12(f13(X2,f18(X1,X2,X3)))))). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 10 steps % 0.13/0.39 cnf(i_0_75, negated_conjecture, (p22(f19(f6(c25,f7(c23,c26)),c28,c29),f16(f6(c25,f7(c23,c26))))|p3(f4(f6(c25,f7(c23,c26))),f8(c24))|p10(f11(f6(c25,f7(c23,c26)),c27,c28),f11(f6(c25,f7(c23,c26)),c27,c29))), inference(start_rule)). % 0.13/0.39 cnf(i_0_101, plain, (p10(f11(f6(c25,f7(c23,c26)),c27,c28),f11(f6(c25,f7(c23,c26)),c27,c29))), inference(closure_rule, [i_0_65])). % 0.13/0.39 cnf(i_0_99, plain, (p22(f19(f6(c25,f7(c23,c26)),c28,c29),f16(f6(c25,f7(c23,c26))))), inference(extension_rule, [i_0_60])). % 0.13/0.39 cnf(i_0_242, plain, (~p14(f16(f6(c25,f7(c23,c26))),f16(f6(c25,f7(c23,c26))))), inference(closure_rule, [i_0_46])). % 0.13/0.39 cnf(i_0_240, plain, (p22(f19(f6(c25,f7(c23,c26)),c28,c29),f16(f6(c25,f7(c23,c26))))), inference(extension_rule, [i_0_66])). % 0.13/0.39 cnf(i_0_100, plain, (p3(f4(f6(c25,f7(c23,c26))),f8(c24))), inference(etableau_closure_rule, [i_0_100, ...])). % 0.13/0.39 cnf(i_0_318, plain, (p21(f12(f13(c28,c29)),f12(f13(c28,f19(f6(c25,f7(c23,c26)),c28,c29))))), inference(extension_rule, [i_0_80])). % 0.13/0.39 cnf(i_0_1781, plain, (p10(f11(f6(c25,f7(c23,c26)),c27,c28),f11(f6(c25,f7(c23,c26)),c27,c29))), inference(closure_rule, [i_0_65])). % 0.13/0.39 cnf(i_0_243, plain, (~p10(f19(f6(c25,f7(c23,c26)),c28,c29),f19(f6(c25,f7(c23,c26)),c28,c29))), inference(etableau_closure_rule, [i_0_243, ...])). % 0.13/0.39 cnf(i_0_1780, plain, (p3(f4(f6(c25,f7(c23,c26))),f8(c24))), inference(etableau_closure_rule, [i_0_1780, ...])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Child (14091) has found a proof. % 0.13/0.39 % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------