%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN621-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:12:53 EDT 2022 % Result : Unsatisfiable 0.12s 0.37s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : SYN621-1 : TPTP v8.1.0. Released v2.5.0. % 0.10/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 : Tue Jul 12 03:17:03 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.12/0.36 # and selection function SelectCQIPrecWNTNp. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 34 Number of unprocessed: 34 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 34 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 34 conjectures. % 0.12/0.36 # There are 34 start rule candidates: % 0.12/0.36 # Found 8 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 34 start rule tableaux created. % 0.12/0.36 # 26 extension rule candidate clauses % 0.12/0.36 # 8 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.12/0.37 # There were 1 total branch saturation attempts. % 0.12/0.37 # There were 0 of these attempts blocked. % 0.12/0.37 # There were 0 deferred branch saturation attempts. % 0.12/0.37 # There were 0 free duplicated saturations. % 0.12/0.37 # There were 1 total successful branch saturations. % 0.12/0.37 # There were 0 successful branch saturations in interreduction. % 0.12/0.37 # There were 0 successful branch saturations on the branch. % 0.12/0.37 # There were 1 successful branch saturations after the branch. % 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.37 # Begin clausification derivation % 0.12/0.37 % 0.12/0.37 # End clausification derivation % 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.37 cnf(i_0_35, negated_conjecture, (p10(X1,X1))). % 0.12/0.37 cnf(i_0_36, negated_conjecture, (p8(X1,X1))). % 0.12/0.37 cnf(i_0_37, negated_conjecture, (p7(X1,X1))). % 0.12/0.37 cnf(i_0_38, negated_conjecture, (p4(X1,X1))). % 0.12/0.37 cnf(i_0_39, negated_conjecture, (p2(X1,X1))). % 0.12/0.37 cnf(i_0_40, negated_conjecture, (p13(X1,X1))). % 0.12/0.37 cnf(i_0_41, negated_conjecture, (~p2(c23,f3(c24)))). % 0.12/0.37 cnf(i_0_66, negated_conjecture, (~p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24)))))))). % 0.12/0.37 cnf(i_0_48, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.12/0.37 cnf(i_0_49, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.12/0.37 cnf(i_0_50, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.12/0.37 cnf(i_0_43, negated_conjecture, (p4(f5(X1),f5(X2))|~p4(X1,X2))). % 0.12/0.37 cnf(i_0_44, negated_conjecture, (p4(f16(X1),f16(X2))|~p2(X1,X2))). % 0.12/0.37 cnf(i_0_45, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.12/0.37 cnf(i_0_46, negated_conjecture, (p2(f18(X1),f18(X2))|~p2(X1,X2))). % 0.12/0.37 cnf(i_0_47, negated_conjecture, (p2(f17(X1),f17(X2))|~p2(X1,X2))). % 0.12/0.37 cnf(i_0_42, negated_conjecture, (p13(f14(X1),f14(X2))|~p7(X1,X2))). % 0.12/0.37 cnf(i_0_51, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.12/0.37 cnf(i_0_53, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.12/0.37 cnf(i_0_54, negated_conjecture, (p13(X1,X2)|~p13(X3,X2)|~p13(X3,X1))). % 0.12/0.37 cnf(i_0_52, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X1,X3))). % 0.12/0.37 cnf(i_0_55, negated_conjecture, (p21(X1,X2)|~p21(X3,X4)|~p4(X4,X2)|~p4(X3,X1))). % 0.12/0.37 cnf(i_0_58, negated_conjecture, (p10(f12(X1,X2),f12(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.12/0.37 cnf(i_0_65, negated_conjecture, (p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f5(f6(c27,X1)))|~p22(X1,f14(f11(c25,f12(c23,c26)))))). % 0.12/0.37 cnf(i_0_57, negated_conjecture, (p7(f11(X1,X2),f11(X3,X4))|~p2(X1,X3)|~p10(X2,X4))). % 0.12/0.37 cnf(i_0_59, negated_conjecture, (p4(f15(X1,X2),f15(X3,X4))|~p4(X2,X4)|~p4(X1,X3))). % 0.12/0.37 cnf(i_0_60, negated_conjecture, (p4(f19(X1,X2),f19(X3,X4))|~p4(X2,X4)|~p7(X1,X3))). % 0.12/0.37 cnf(i_0_56, negated_conjecture, (p22(X1,X2)|~p22(X3,X4)|~p13(X4,X2)|~p4(X3,X1))). % 0.12/0.37 cnf(i_0_61, negated_conjecture, (p4(f6(X1,X2),f6(X3,X4))|~p4(X2,X4)|~p4(X1,X3))). % 0.12/0.37 cnf(i_0_63, negated_conjecture, (p4(f9(X1,X2,X3),f9(X4,X5,X6))|~p4(X3,X6)|~p7(X1,X4)|~p8(X2,X5))). % 0.12/0.37 cnf(i_0_64, negated_conjecture, (p4(f20(X1,X2,X3,X4),f20(X5,X6,X7,X8))|~p2(X3,X7)|~p2(X2,X6)|~p2(X1,X5)|~p4(X4,X8))). % 0.12/0.37 cnf(i_0_62, negated_conjecture, (p22(f20(X1,X2,X3,X4),f14(f11(X1,f12(X2,X3))))|p2(X2,f3(c24)))). % 0.12/0.37 cnf(i_0_67, negated_conjecture, (p21(f5(f6(X1,f20(X2,X3,X4,X1))),f5(f6(X1,X5)))|p2(X3,f3(c24))|~p22(X5,f14(f11(X2,f12(X3,X4)))))). % 0.12/0.37 cnf(i_0_68, negated_conjecture, (p21(f5(f6(X1,f20(X2,X3,X4,X1))),f15(f19(f11(X2,f12(X3,X4)),X1),f16(f3(f17(f18(c24))))))|p2(X3,f3(c24)))). % 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.37 # Begin printing tableau % 0.12/0.37 # Found 8 steps % 0.12/0.37 cnf(i_0_68, negated_conjecture, (p21(f5(f6(c27,f20(c25,c23,c26,c27))),f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24))))))|p2(c23,f3(c24))), inference(start_rule)). % 0.12/0.37 cnf(i_0_70, plain, (p2(c23,f3(c24))), inference(closure_rule, [i_0_41])). % 0.12/0.37 cnf(i_0_69, plain, (p21(f5(f6(c27,f20(c25,c23,c26,c27))),f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24))))))), inference(extension_rule, [i_0_55])). % 0.12/0.37 cnf(i_0_188, plain, (p21(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24))))))), inference(closure_rule, [i_0_66])). % 0.12/0.37 cnf(i_0_190, plain, (~p4(f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24))))),f15(f19(f11(c25,f12(c23,c26)),c27),f16(f3(f17(f18(c24))))))), inference(closure_rule, [i_0_38])). % 0.12/0.37 cnf(i_0_191, plain, (~p4(f5(f6(c27,f20(c25,c23,c26,c27))),f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))))), inference(extension_rule, [i_0_51])). % 0.12/0.37 cnf(i_0_239, plain, (~p4(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))))), inference(closure_rule, [i_0_38])). % 0.12/0.37 cnf(i_0_240, plain, (~p4(f5(f6(c27,f9(f11(c25,f12(c23,c26)),c28,c27))),f5(f6(c27,f20(c25,c23,c26,c27))))), inference(etableau_closure_rule, [i_0_240, ...])). % 0.12/0.37 # End printing tableau % 0.12/0.37 # SZS output end % 0.12/0.37 # Branches closed with saturation will be marked with an "s" % 0.12/0.37 # Child (11128) has found a proof. % 0.12/0.37 % 0.12/0.37 # Proof search is over... % 0.12/0.37 # Freeing feature tree %------------------------------------------------------------------------------