%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN646-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 : n010.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:03 EDT 2022 % Result : Unsatisfiable 0.18s 0.36s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SYN646-1 : TPTP v8.1.0. Released v2.5.0. % 0.03/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 : n010.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 01:22:30 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.35 # No SInE strategy applied % 0.12/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.35 # % 0.12/0.35 # Presaturation interreduction done % 0.12/0.35 # Number of axioms: 44 Number of unprocessed: 44 % 0.12/0.35 # Tableaux proof search. % 0.12/0.35 # APR header successfully linked. % 0.12/0.35 # Hello from C++ % 0.12/0.35 # The folding up rule is enabled... % 0.12/0.35 # Local unification is enabled... % 0.12/0.35 # Any saturation attempts will use folding labels... % 0.12/0.35 # 44 beginning clauses after preprocessing and clausification % 0.12/0.35 # Creating start rules for all 44 conjectures. % 0.12/0.35 # There are 44 start rule candidates: % 0.12/0.35 # Found 22 unit axioms. % 0.12/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.35 # 44 start rule tableaux created. % 0.12/0.35 # 22 extension rule candidate clauses % 0.12/0.35 # 22 unit axiom clauses % 0.12/0.35 % 0.12/0.35 # Requested 8, 32 cores available to the main process. % 0.18/0.36 # There were 1 total branch saturation attempts. % 0.18/0.36 # There were 0 of these attempts blocked. % 0.18/0.36 # There were 0 deferred branch saturation attempts. % 0.18/0.36 # There were 0 free duplicated saturations. % 0.18/0.36 # There were 1 total successful branch saturations. % 0.18/0.36 # There were 0 successful branch saturations in interreduction. % 0.18/0.36 # There were 0 successful branch saturations on the branch. % 0.18/0.36 # There were 1 successful branch saturations after the branch. % 0.18/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.36 # Begin clausification derivation % 0.18/0.36 % 0.18/0.36 # End clausification derivation % 0.18/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.36 cnf(i_0_45, negated_conjecture, (p18(c22))). % 0.18/0.36 cnf(i_0_53, negated_conjecture, (p2(f12(f11(c22)),f7(c24)))). % 0.18/0.36 cnf(i_0_54, negated_conjecture, (p2(f12(f11(c25)),f7(c24)))). % 0.18/0.36 cnf(i_0_46, negated_conjecture, (p10(X1,X1))). % 0.18/0.36 cnf(i_0_47, negated_conjecture, (p4(X1,X1))). % 0.18/0.36 cnf(i_0_48, negated_conjecture, (p3(X1,X1))). % 0.18/0.36 cnf(i_0_49, negated_conjecture, (p2(X1,X1))). % 0.18/0.36 cnf(i_0_50, negated_conjecture, (p16(X1,X1))). % 0.18/0.36 cnf(i_0_55, negated_conjecture, (p2(f12(f11(c23)),f7(c24)))). % 0.18/0.36 cnf(i_0_58, negated_conjecture, (p2(f13(f11(c23)),f13(f11(c22))))). % 0.18/0.36 cnf(i_0_56, negated_conjecture, (p20(f14(f11(c25)),f14(f11(c22))))). % 0.18/0.36 cnf(i_0_57, negated_conjecture, (p19(f14(f11(c23)),f14(f11(c22))))). % 0.18/0.36 cnf(i_0_80, negated_conjecture, (p2(f13(f11(c25)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))))). % 0.18/0.36 cnf(i_0_79, negated_conjecture, (p2(f13(f11(c23)),f7(f8(f9(f8(f9(f9(f9(f9(f8(c24)))))))))))). % 0.18/0.36 cnf(i_0_83, negated_conjecture, (p2(f14(f11(c25)),f7(f9(f9(f9(f9(f8(f9(f8(f9(f9(f9(f8(f8(f9(f8(f9(f8(f9(f8(f8(f8(f9(f8(c24)))))))))))))))))))))))))). % 0.18/0.36 cnf(i_0_82, negated_conjecture, (p2(f14(f11(c23)),f7(f8(f8(f8(f8(f9(f9(f8(f9(f9(f9(f8(f8(f9(f8(f9(f8(f9(f8(f8(f8(f9(f8(c24)))))))))))))))))))))))))). % 0.18/0.36 cnf(i_0_85, negated_conjecture, (p4(f11(c25),f5(f7(c24),f6(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f7(f9(f9(f9(f9(f8(f9(f8(f9(f9(f9(f8(f8(f9(f8(f9(f8(f9(f8(f8(f8(f9(f8(c24)))))))))))))))))))))))))))). % 0.18/0.36 cnf(i_0_86, negated_conjecture, (p4(f11(c23),f5(f7(c24),f6(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f7(f8(f8(f8(f8(f9(f9(f8(f9(f9(f9(f8(f8(f9(f8(f9(f8(f9(f8(f8(f8(f9(f8(c24)))))))))))))))))))))))))))). % 0.18/0.36 cnf(i_0_87, negated_conjecture, (p10(f15(f5(f7(c24),f6(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f7(f8(f8(f8(f8(f9(f9(f8(f9(f9(f9(f8(f8(f9(f8(f9(f8(f9(f8(f8(f8(f9(f8(c24)))))))))))))))))))))))))),c23))). % 0.18/0.36 cnf(i_0_88, negated_conjecture, (p10(f15(f5(f7(c24),f6(f7(f8(f9(f8(f9(f9(f9(f9(f8(c24))))))))),f7(f9(f9(f9(f9(f8(f9(f8(f9(f9(f9(f8(f8(f9(f8(f9(f8(f9(f8(f8(f8(f9(f8(c24)))))))))))))))))))))))))),c25))). % 0.18/0.36 cnf(i_0_52, negated_conjecture, (~p21(f17(c22),f17(c23)))). % 0.18/0.36 cnf(i_0_51, negated_conjecture, (~p21(f17(c25),f17(c22)))). % 0.18/0.36 cnf(i_0_59, negated_conjecture, (p18(X1)|~p10(X2,X1)|~p18(X2))). % 0.18/0.36 cnf(i_0_61, negated_conjecture, (p10(f15(X1),f15(X2))|~p4(X1,X2))). % 0.18/0.36 cnf(i_0_60, negated_conjecture, (p4(f11(X1),f11(X2))|~p10(X1,X2))). % 0.18/0.36 cnf(i_0_69, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.18/0.36 cnf(i_0_70, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.18/0.36 cnf(i_0_71, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.18/0.36 cnf(i_0_72, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.18/0.36 cnf(i_0_63, negated_conjecture, (p2(f12(X1),f12(X2))|~p4(X1,X2))). % 0.18/0.36 cnf(i_0_66, negated_conjecture, (p2(f7(X1),f7(X2))|~p2(X1,X2))). % 0.18/0.36 cnf(i_0_65, negated_conjecture, (p2(f14(X1),f14(X2))|~p4(X1,X2))). % 0.18/0.36 cnf(i_0_64, negated_conjecture, (p2(f13(X1),f13(X2))|~p4(X1,X2))). % 0.18/0.36 cnf(i_0_73, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))). % 0.18/0.36 cnf(i_0_67, negated_conjecture, (p2(f8(X1),f8(X2))|~p2(X1,X2))). % 0.18/0.36 cnf(i_0_68, negated_conjecture, (p2(f9(X1),f9(X2))|~p2(X1,X2))). % 0.18/0.36 cnf(i_0_62, negated_conjecture, (p16(f17(X1),f17(X2))|~p10(X1,X2))). % 0.18/0.36 cnf(i_0_77, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p2(X1,X3)|~p3(X2,X4))). % 0.18/0.36 cnf(i_0_75, negated_conjecture, (p21(X1,X2)|~p21(X3,X4)|~p16(X3,X1)|~p16(X4,X2))). % 0.18/0.36 cnf(i_0_78, negated_conjecture, (p3(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.18/0.36 cnf(i_0_76, negated_conjecture, (p20(X1,X2)|~p20(X3,X4)|~p2(X3,X1)|~p2(X4,X2))). % 0.18/0.36 cnf(i_0_74, negated_conjecture, (p19(X1,X2)|~p19(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.18/0.36 cnf(i_0_81, negated_conjecture, (p21(f17(X1),f17(X2))|~p19(f13(f11(X1)),f13(f11(X2)))|~p2(f12(f11(X2)),f7(c24))|~p2(f12(f11(X1)),f7(c24)))). % 0.18/0.36 cnf(i_0_84, negated_conjecture, (p21(f17(X1),f17(X2))|~p20(f14(f11(X1)),f14(f11(X2)))|~p2(f13(f11(X1)),f13(f11(X2)))|~p2(f12(f11(X2)),f7(c24))|~p2(f12(f11(X1)),f7(c24)))). % 0.18/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.36 # Begin printing tableau % 0.18/0.36 # Found 10 steps % 0.18/0.36 cnf(i_0_75, negated_conjecture, (p21(f17(c25),f17(c22))|~p21(f17(c25),f17(c22))|~p16(f17(c25),f17(c25))|~p16(f17(c22),f17(c22))), inference(start_rule)). % 0.18/0.36 cnf(i_0_109, plain, (p21(f17(c25),f17(c22))), inference(closure_rule, [i_0_51])). % 0.18/0.36 cnf(i_0_111, plain, (~p16(f17(c25),f17(c25))), inference(closure_rule, [i_0_50])). % 0.18/0.36 cnf(i_0_112, plain, (~p16(f17(c22),f17(c22))), inference(closure_rule, [i_0_50])). % 0.18/0.36 cnf(i_0_110, plain, (~p21(f17(c25),f17(c22))), inference(extension_rule, [i_0_84])). % 0.18/0.36 cnf(i_0_175, plain, (~p20(f14(f11(c25)),f14(f11(c22)))), inference(closure_rule, [i_0_56])). % 0.18/0.36 cnf(i_0_177, plain, (~p2(f12(f11(c22)),f7(c24))), inference(closure_rule, [i_0_53])). % 0.18/0.36 cnf(i_0_178, plain, (~p2(f12(f11(c25)),f7(c24))), inference(closure_rule, [i_0_54])). % 0.18/0.36 cnf(i_0_176, plain, (~p2(f13(f11(c25)),f13(f11(c22)))), inference(extension_rule, [i_0_64])). % 0.18/0.36 cnf(i_0_211, plain, (~p4(f11(c25),f11(c22))), inference(etableau_closure_rule, [i_0_211, ...])). % 0.18/0.36 # End printing tableau % 0.18/0.36 # SZS output end % 0.18/0.36 # Branches closed with saturation will be marked with an "s" % 0.18/0.36 # Child (7129) has found a proof. % 0.18/0.36 % 0.18/0.36 # Proof search is over... % 0.18/0.36 # Freeing feature tree %------------------------------------------------------------------------------