%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN652-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 : n017.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:05 EDT 2022 % Result : Unsatisfiable 0.18s 0.46s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : SYN652-1 : TPTP v8.1.0. Released v2.5.0. % 0.07/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 : n017.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 : Mon Jul 11 22:42:04 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_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 47 Number of unprocessed: 47 % 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 # 47 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 47 conjectures. % 0.12/0.36 # There are 47 start rule candidates: % 0.12/0.36 # Found 20 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 47 start rule tableaux created. % 0.12/0.36 # 27 extension rule candidate clauses % 0.12/0.36 # 20 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.46 # There were 1 total branch saturation attempts. % 0.18/0.46 # There were 0 of these attempts blocked. % 0.18/0.46 # There were 0 deferred branch saturation attempts. % 0.18/0.46 # There were 0 free duplicated saturations. % 0.18/0.46 # There were 1 total successful branch saturations. % 0.18/0.46 # There were 0 successful branch saturations in interreduction. % 0.18/0.46 # There were 0 successful branch saturations on the branch. % 0.18/0.46 # There were 1 successful branch saturations after the branch. % 0.18/0.46 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.46 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.46 # Begin clausification derivation % 0.18/0.46 % 0.18/0.46 # End clausification derivation % 0.18/0.46 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.46 cnf(i_0_48, negated_conjecture, (p11(X1,X1))). % 0.18/0.46 cnf(i_0_63, negated_conjecture, (p4(c34,f5(c35,c32)))). % 0.18/0.46 cnf(i_0_64, negated_conjecture, (p27(f8(f10(c28,f13(c29,c30)),c32),c33))). % 0.18/0.46 cnf(i_0_49, negated_conjecture, (p9(X1,X1))). % 0.18/0.46 cnf(i_0_50, negated_conjecture, (p7(X1,X1))). % 0.18/0.46 cnf(i_0_51, negated_conjecture, (p6(X1,X1))). % 0.18/0.46 cnf(i_0_52, negated_conjecture, (p4(X1,X1))). % 0.18/0.46 cnf(i_0_53, negated_conjecture, (p3(X1,X1))). % 0.18/0.46 cnf(i_0_54, negated_conjecture, (p25(X1,X1))). % 0.18/0.46 cnf(i_0_55, negated_conjecture, (p23(X1,X1))). % 0.18/0.46 cnf(i_0_56, negated_conjecture, (p21(X1,X1))). % 0.18/0.46 cnf(i_0_57, negated_conjecture, (p2(X1,X1))). % 0.18/0.46 cnf(i_0_58, negated_conjecture, (p19(X1,X1))). % 0.18/0.46 cnf(i_0_59, negated_conjecture, (p18(X1,X1))). % 0.18/0.46 cnf(i_0_60, negated_conjecture, (p16(X1,X1))). % 0.18/0.46 cnf(i_0_61, negated_conjecture, (p14(X1,X1))). % 0.18/0.46 cnf(i_0_62, negated_conjecture, (p12(X1,X1))). % 0.18/0.46 cnf(i_0_81, negated_conjecture, (p4(f15(f17(c36,X1),f5(c35,X2)),f5(X1,X2)))). % 0.18/0.46 cnf(i_0_94, negated_conjecture, (p4(f15(f17(c36,X1),f20(f26(c37,X2),X3)),f20(f26(c37,X2),f22(f24(c38,f17(c36,X1)),X3))))). % 0.18/0.46 cnf(i_0_65, negated_conjecture, (~p4(f5(c31,c33),f15(f17(c36,c31),c34)))). % 0.18/0.46 cnf(i_0_66, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))). % 0.18/0.46 cnf(i_0_67, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))). % 0.18/0.46 cnf(i_0_68, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.18/0.46 cnf(i_0_69, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.18/0.46 cnf(i_0_93, negated_conjecture, (p4(f5(c31,X1),f5(c31,X2))|~p27(f8(f10(c28,f13(c29,c30)),X1),X2))). % 0.18/0.46 cnf(i_0_70, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.18/0.46 cnf(i_0_71, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.18/0.46 cnf(i_0_72, negated_conjecture, (p25(X1,X2)|~p25(X3,X2)|~p25(X3,X1))). % 0.18/0.46 cnf(i_0_73, negated_conjecture, (p23(X1,X2)|~p23(X3,X2)|~p23(X3,X1))). % 0.18/0.46 cnf(i_0_74, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X3,X1))). % 0.18/0.46 cnf(i_0_75, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.18/0.46 cnf(i_0_76, negated_conjecture, (p19(X1,X2)|~p19(X3,X2)|~p19(X3,X1))). % 0.18/0.46 cnf(i_0_77, negated_conjecture, (p18(X1,X2)|~p18(X3,X2)|~p18(X3,X1))). % 0.18/0.46 cnf(i_0_78, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))). % 0.18/0.46 cnf(i_0_79, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))). % 0.18/0.46 cnf(i_0_80, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))). % 0.18/0.46 cnf(i_0_83, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p3(X2,X4)|~p6(X1,X3))). % 0.18/0.46 cnf(i_0_92, negated_conjecture, (p6(f13(X1,X2),f13(X3,X4))|~p12(X2,X4)|~p11(X1,X3))). % 0.18/0.46 cnf(i_0_91, negated_conjecture, (p6(f10(X1,X2),f10(X3,X4))|~p6(X2,X4)|~p9(X1,X3))). % 0.18/0.46 cnf(i_0_82, negated_conjecture, (p27(X1,X2)|~p27(X3,X4)|~p3(X4,X2)|~p7(X3,X1))). % 0.18/0.46 cnf(i_0_90, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p2(X1,X3)|~p3(X2,X4))). % 0.18/0.46 cnf(i_0_88, negated_conjecture, (p4(f15(X1,X2),f15(X3,X4))|~p14(X1,X3)|~p4(X2,X4))). % 0.18/0.46 cnf(i_0_89, negated_conjecture, (p4(f20(X1,X2),f20(X3,X4))|~p18(X1,X3)|~p19(X2,X4))). % 0.18/0.46 cnf(i_0_87, negated_conjecture, (p21(f24(X1,X2),f24(X3,X4))|~p14(X2,X4)|~p23(X1,X3))). % 0.18/0.46 cnf(i_0_86, negated_conjecture, (p19(f22(X1,X2),f22(X3,X4))|~p19(X2,X4)|~p21(X1,X3))). % 0.18/0.46 cnf(i_0_85, negated_conjecture, (p18(f26(X1,X2),f26(X3,X4))|~p25(X1,X3)|~p3(X2,X4))). % 0.18/0.46 cnf(i_0_84, negated_conjecture, (p14(f17(X1,X2),f17(X3,X4))|~p16(X1,X3)|~p2(X2,X4))). % 0.18/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.46 # Begin printing tableau % 0.18/0.46 # Found 8 steps % 0.18/0.46 cnf(i_0_84, negated_conjecture, (p14(f17(X15,X16),f17(X15,X16))|~p16(X15,X15)|~p2(X16,X16)), inference(start_rule)). % 0.18/0.46 cnf(i_0_96, plain, (~p16(X15,X15)), inference(closure_rule, [i_0_60])). % 0.18/0.46 cnf(i_0_97, plain, (~p2(X16,X16)), inference(closure_rule, [i_0_57])). % 0.18/0.46 cnf(i_0_95, plain, (p14(f17(X15,X16),f17(X15,X16))), inference(extension_rule, [i_0_87])). % 0.18/0.46 cnf(i_0_207, plain, (~p23(X17,X17)), inference(closure_rule, [i_0_55])). % 0.18/0.46 cnf(i_0_205, plain, (p21(f24(X17,f17(X15,X16)),f24(X17,f17(X15,X16)))), inference(extension_rule, [i_0_86])). % 0.18/0.46 cnf(i_0_215, plain, (~p19(X7,X7)), inference(closure_rule, [i_0_58])). % 0.18/0.46 cnf(i_0_214, plain, (p19(f22(f24(X17,f17(X15,X16)),X7),f22(f24(X17,f17(X15,X16)),X7))), inference(etableau_closure_rule, [i_0_214, ...])). % 0.18/0.46 # End printing tableau % 0.18/0.46 # SZS output end % 0.18/0.46 # Branches closed with saturation will be marked with an "s" % 0.18/0.46 # Child (7552) has found a proof. % 0.18/0.46 % 0.18/0.46 # Proof search is over... % 0.18/0.46 # Freeing feature tree %------------------------------------------------------------------------------