%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN638-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 : n024.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:59 EDT 2022 % Result : Unsatisfiable 0.13s 0.32s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.08 % Problem : SYN638-1 : TPTP v8.1.0. Released v2.5.0. % 0.06/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.09/0.28 % Computer : n024.cluster.edu % 0.09/0.28 % Model : x86_64 x86_64 % 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.28 % Memory : 8042.1875MB % 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.28 % CPULimit : 300 % 0.09/0.28 % WCLimit : 600 % 0.09/0.28 % DateTime : Tue Jul 12 01:24:43 EDT 2022 % 0.09/0.28 % CPUTime : % 0.13/0.31 # No SInE strategy applied % 0.13/0.31 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.31 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.31 # % 0.13/0.31 # Presaturation interreduction done % 0.13/0.31 # Number of axioms: 41 Number of unprocessed: 41 % 0.13/0.31 # Tableaux proof search. % 0.13/0.31 # APR header successfully linked. % 0.13/0.31 # Hello from C++ % 0.13/0.32 # The folding up rule is enabled... % 0.13/0.32 # Local unification is enabled... % 0.13/0.32 # Any saturation attempts will use folding labels... % 0.13/0.32 # 41 beginning clauses after preprocessing and clausification % 0.13/0.32 # Creating start rules for all 41 conjectures. % 0.13/0.32 # There are 41 start rule candidates: % 0.13/0.32 # Found 14 unit axioms. % 0.13/0.32 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.32 # 41 start rule tableaux created. % 0.13/0.32 # 27 extension rule candidate clauses % 0.13/0.32 # 14 unit axiom clauses % 0.13/0.32 % 0.13/0.32 # Requested 8, 32 cores available to the main process. % 0.13/0.32 # Closed tableau found in foldup close cycle with 0 folds and 2 closures done. % 0.13/0.32 # There were 0 total branch saturation attempts. % 0.13/0.32 # There were 0 of these attempts blocked. % 0.13/0.32 # There were 0 deferred branch saturation attempts. % 0.13/0.32 # There were 0 free duplicated saturations. % 0.13/0.32 # There were 0 total successful branch saturations. % 0.13/0.32 # There were 0 successful branch saturations in interreduction. % 0.13/0.32 # There were 0 successful branch saturations on the branch. % 0.13/0.32 # There were 0 successful branch saturations after the branch. % 0.13/0.32 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.32 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.32 # Begin clausification derivation % 0.13/0.32 % 0.13/0.32 # End clausification derivation % 0.13/0.32 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.32 cnf(i_0_48, negated_conjecture, (p20(f12(c25),c28))). % 0.13/0.32 cnf(i_0_50, negated_conjecture, (p21(f13(f14(f15(c30))),f10(c25)))). % 0.13/0.32 cnf(i_0_59, negated_conjecture, (p22(f5(c25,c26,c29),f5(c25,c26,c27)))). % 0.13/0.32 cnf(i_0_42, negated_conjecture, (p18(X1,X1))). % 0.13/0.32 cnf(i_0_43, negated_conjecture, (p7(X1,X1))). % 0.13/0.32 cnf(i_0_44, negated_conjecture, (p6(X1,X1))). % 0.13/0.32 cnf(i_0_45, negated_conjecture, (p4(X1,X1))). % 0.13/0.32 cnf(i_0_46, negated_conjecture, (p3(X1,X1))). % 0.13/0.32 cnf(i_0_47, negated_conjecture, (p2(X1,X1))). % 0.13/0.32 cnf(i_0_81, negated_conjecture, (p22(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27))),f16(f17(c27,f5(c25,c26,c27)))))). % 0.13/0.32 cnf(i_0_80, negated_conjecture, (p4(f5(f8(f11(c25),f9(f10(c25),c28)),X1,c27),f5(f8(f11(c25),f9(f10(c25),c28)),X1,c29)))). % 0.13/0.32 cnf(i_0_49, negated_conjecture, (~p6(f10(c25),f13(c30)))). % 0.13/0.32 cnf(i_0_74, negated_conjecture, (~p4(f5(c25,c26,c27),f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27)))). % 0.13/0.32 cnf(i_0_82, negated_conjecture, (~p22(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29))),f16(f17(c27,f5(c25,c26,c27)))))). % 0.13/0.32 cnf(i_0_52, negated_conjecture, (p18(f19(X1),f19(X2))|~p2(X1,X2))). % 0.13/0.32 cnf(i_0_76, negated_conjecture, (p23(X1,c29)|~p23(X1,c27)|~p24(X1,f19(f8(f11(c25),f9(f10(c25),c28)))))). % 0.13/0.32 cnf(i_0_75, negated_conjecture, (p23(X1,c27)|~p23(X1,c29)|~p24(X1,f19(f8(f11(c25),f9(f10(c25),c28)))))). % 0.13/0.32 cnf(i_0_56, negated_conjecture, (p6(f12(X1),f12(X2))|~p2(X1,X2))). % 0.13/0.32 cnf(i_0_54, negated_conjecture, (p6(f10(X1),f10(X2))|~p2(X1,X2))). % 0.13/0.32 cnf(i_0_60, negated_conjecture, (p18(X1,X2)|~p18(X3,X2)|~p18(X3,X1))). % 0.13/0.32 cnf(i_0_61, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.13/0.32 cnf(i_0_62, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.13/0.32 cnf(i_0_63, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.13/0.32 cnf(i_0_57, negated_conjecture, (p6(f13(X1),f13(X2))|~p6(X1,X2))). % 0.13/0.32 cnf(i_0_78, negated_conjecture, (p23(c29,X1)|~p23(c27,X1)|~p24(X1,f19(f8(f11(c25),f9(f10(c25),c28)))))). % 0.13/0.32 cnf(i_0_77, negated_conjecture, (p23(c27,X1)|~p23(c29,X1)|~p24(X1,f19(f8(f11(c25),f9(f10(c25),c28)))))). % 0.13/0.32 cnf(i_0_51, negated_conjecture, (p6(f15(X1),f15(X2))|~p6(X1,X2))). % 0.13/0.32 cnf(i_0_58, negated_conjecture, (p6(f14(X1),f14(X2))|~p6(X1,X2))). % 0.13/0.32 cnf(i_0_55, negated_conjecture, (p6(f11(X1),f11(X2))|~p2(X1,X2))). % 0.13/0.32 cnf(i_0_53, negated_conjecture, (p4(f16(X1),f16(X2))|~p4(X1,X2))). % 0.13/0.32 cnf(i_0_64, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.13/0.32 cnf(i_0_65, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.13/0.32 cnf(i_0_67, negated_conjecture, (p20(X1,X2)|~p20(X3,X4)|~p6(X4,X2)|~p6(X3,X1))). % 0.13/0.32 cnf(i_0_68, negated_conjecture, (p21(X1,X2)|~p21(X3,X4)|~p6(X4,X2)|~p6(X3,X1))). % 0.13/0.32 cnf(i_0_72, negated_conjecture, (p7(f9(X1,X2),f9(X3,X4))|~p6(X2,X4)|~p6(X1,X3))). % 0.13/0.32 cnf(i_0_73, negated_conjecture, (p4(f17(X1,X2),f17(X3,X4))|~p4(X2,X4)|~p4(X1,X3))). % 0.13/0.32 cnf(i_0_71, negated_conjecture, (p2(f8(X1,X2),f8(X3,X4))|~p6(X1,X3)|~p7(X2,X4))). % 0.13/0.32 cnf(i_0_69, negated_conjecture, (p22(X1,X2)|~p22(X3,X4)|~p4(X4,X2)|~p4(X3,X1))). % 0.13/0.32 cnf(i_0_66, negated_conjecture, (p24(X1,X2)|~p24(X3,X4)|~p4(X3,X1)|~p18(X4,X2))). % 0.13/0.32 cnf(i_0_70, negated_conjecture, (p23(X1,X2)|~p23(X3,X4)|~p4(X4,X2)|~p4(X3,X1))). % 0.13/0.32 cnf(i_0_79, negated_conjecture, (p4(f5(X1,X2,X3),f5(X4,X5,X6))|~p2(X1,X4)|~p3(X2,X5)|~p4(X3,X6))). % 0.13/0.32 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.32 # Begin printing tableau % 0.13/0.32 # Found 8 steps % 0.13/0.32 cnf(i_0_69, negated_conjecture, (p22(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29))),f16(f17(c27,f5(c25,c26,c27))))|~p22(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27))),f16(f17(c27,f5(c25,c26,c27))))|~p4(f16(f17(c27,f5(c25,c26,c27))),f16(f17(c27,f5(c25,c26,c27))))|~p4(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27))),f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29))))), inference(start_rule)). % 0.13/0.32 cnf(i_0_95, plain, (p22(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29))),f16(f17(c27,f5(c25,c26,c27))))), inference(closure_rule, [i_0_82])). % 0.13/0.32 cnf(i_0_96, plain, (~p22(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27))),f16(f17(c27,f5(c25,c26,c27))))), inference(closure_rule, [i_0_81])). % 0.13/0.32 cnf(i_0_97, plain, (~p4(f16(f17(c27,f5(c25,c26,c27))),f16(f17(c27,f5(c25,c26,c27))))), inference(closure_rule, [i_0_45])). % 0.13/0.32 cnf(i_0_98, plain, (~p4(f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27))),f16(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29))))), inference(extension_rule, [i_0_53])). % 0.13/0.32 cnf(i_0_216, plain, (~p4(f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27)),f17(c27,f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29)))), inference(extension_rule, [i_0_73])). % 0.13/0.32 cnf(i_0_237, plain, (~p4(f5(f8(f11(c25),f9(f10(c25),c28)),c26,c27),f5(f8(f11(c25),f9(f10(c25),c28)),c26,c29))), inference(closure_rule, [i_0_80])). % 0.13/0.32 cnf(i_0_238, plain, (~p4(c27,c27)), inference(closure_rule, [i_0_45])). % 0.13/0.32 # End printing tableau % 0.13/0.32 # SZS output end % 0.13/0.32 # Branches closed with saturation will be marked with an "s" % 0.13/0.32 # Child (20224) has found a proof. % 0.13/0.32 % 0.13/0.32 # Proof search is over... % 0.13/0.32 # Freeing feature tree %------------------------------------------------------------------------------