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