%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN691-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 : n027.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:21 EDT 2022 % Result : Unsatisfiable 0.13s 0.41s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.13 % Problem : SYN691-1 : TPTP v8.1.0. Released v2.5.0. % 0.13/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.35 % Computer : n027.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Mon Jul 11 13:37:34 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.39 # No SInE strategy applied % 0.13/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.39 # % 0.13/0.39 # Presaturation interreduction done % 0.13/0.39 # Number of axioms: 67 Number of unprocessed: 67 % 0.13/0.39 # Tableaux proof search. % 0.13/0.39 # APR header successfully linked. % 0.13/0.39 # Hello from C++ % 0.13/0.39 # The folding up rule is enabled... % 0.13/0.39 # Local unification is enabled... % 0.13/0.39 # Any saturation attempts will use folding labels... % 0.13/0.39 # 67 beginning clauses after preprocessing and clausification % 0.13/0.39 # Creating start rules for all 67 conjectures. % 0.13/0.39 # There are 67 start rule candidates: % 0.13/0.39 # Found 24 unit axioms. % 0.13/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.39 # 67 start rule tableaux created. % 0.13/0.39 # 43 extension rule candidate clauses % 0.13/0.39 # 24 unit axiom clauses % 0.13/0.39 % 0.13/0.39 # Requested 8, 32 cores available to the main process. % 0.13/0.40 # There were 1 total branch saturation attempts. % 0.13/0.40 # There were 0 of these attempts blocked. % 0.13/0.40 # There were 0 deferred branch saturation attempts. % 0.13/0.40 # There were 0 free duplicated saturations. % 0.13/0.40 # There were 1 total successful branch saturations. % 0.13/0.40 # There were 0 successful branch saturations in interreduction. % 0.13/0.40 # There were 0 successful branch saturations on the branch. % 0.13/0.40 # There were 1 successful branch saturations after the branch. % 0.13/0.40 # There were 1 total branch saturation attempts. % 0.13/0.40 # There were 0 of these attempts blocked. % 0.13/0.40 # There were 0 deferred branch saturation attempts. % 0.13/0.40 # There were 0 free duplicated saturations. % 0.13/0.40 # There were 1 total successful branch saturations. % 0.13/0.40 # There were 0 successful branch saturations in interreduction. % 0.13/0.40 # There were 0 successful branch saturations on the branch. % 0.13/0.40 # There were 1 successful branch saturations after the branch. % 0.13/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.41 # Begin clausification derivation % 0.13/0.41 % 0.13/0.41 # End clausification derivation % 0.13/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.41 cnf(i_0_68, negated_conjecture, (p11(X1,X1))). % 0.13/0.41 cnf(i_0_113, negated_conjecture, (p39(f5(c40,f7(c41,f10(f13(f15(c42,c43),c44),c45))),c46))). % 0.13/0.41 cnf(i_0_69, negated_conjecture, (p9(X1,X1))). % 0.13/0.41 cnf(i_0_70, negated_conjecture, (p8(X1,X1))). % 0.13/0.41 cnf(i_0_71, negated_conjecture, (p6(X1,X1))). % 0.13/0.41 cnf(i_0_72, negated_conjecture, (p4(X1,X1))). % 0.13/0.41 cnf(i_0_73, negated_conjecture, (p37(X1,X1))). % 0.13/0.41 cnf(i_0_74, negated_conjecture, (p35(X1,X1))). % 0.13/0.41 cnf(i_0_75, negated_conjecture, (p33(X1,X1))). % 0.13/0.41 cnf(i_0_76, negated_conjecture, (p31(X1,X1))). % 0.13/0.41 cnf(i_0_77, negated_conjecture, (p3(X1,X1))). % 0.13/0.41 cnf(i_0_78, negated_conjecture, (p29(X1,X1))). % 0.13/0.41 cnf(i_0_79, negated_conjecture, (p27(X1,X1))). % 0.13/0.41 cnf(i_0_80, negated_conjecture, (p25(X1,X1))). % 0.13/0.41 cnf(i_0_81, negated_conjecture, (p23(X1,X1))). % 0.13/0.41 cnf(i_0_82, negated_conjecture, (p22(X1,X1))). % 0.13/0.41 cnf(i_0_83, negated_conjecture, (p20(X1,X1))). % 0.13/0.41 cnf(i_0_84, negated_conjecture, (p2(X1,X1))). % 0.13/0.41 cnf(i_0_85, negated_conjecture, (p18(X1,X1))). % 0.13/0.41 cnf(i_0_86, negated_conjecture, (p16(X1,X1))). % 0.13/0.41 cnf(i_0_87, negated_conjecture, (p14(X1,X1))). % 0.13/0.41 cnf(i_0_88, negated_conjecture, (p12(X1,X1))). % 0.13/0.41 cnf(i_0_134, negated_conjecture, (p3(f7(c41,f10(f13(f15(c42,X1),X2),X3)),f10(f13(f15(c42,f17(f19(f21(c47,X1),X2),X3)),f26(f28(f30(c48,X1),X2),X3)),f34(f36(f38(c49,X1),X2),X3))))). % 0.13/0.41 cnf(i_0_110, negated_conjecture, (~p39(f5(c40,f10(f13(f15(c42,c43),c44),c45)),c46))). % 0.13/0.41 cnf(i_0_111, negated_conjecture, (p39(X1,X2)|~p39(f17(f19(f21(c47,X1),X3),X4),X2))). % 0.13/0.41 cnf(i_0_130, negated_conjecture, (p39(X1,X2)|~p39(f5(c40,f10(f13(f15(c42,X1),X3),X4)),X2))). % 0.13/0.41 cnf(i_0_89, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))). % 0.13/0.41 cnf(i_0_90, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))). % 0.13/0.41 cnf(i_0_91, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.13/0.41 cnf(i_0_92, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.13/0.41 cnf(i_0_93, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.13/0.41 cnf(i_0_94, negated_conjecture, (p37(X1,X2)|~p37(X3,X2)|~p37(X3,X1))). % 0.13/0.41 cnf(i_0_95, negated_conjecture, (p35(X1,X2)|~p35(X3,X2)|~p35(X3,X1))). % 0.13/0.41 cnf(i_0_96, negated_conjecture, (p33(X1,X2)|~p33(X3,X2)|~p33(X3,X1))). % 0.13/0.41 cnf(i_0_97, negated_conjecture, (p31(X1,X2)|~p31(X3,X2)|~p31(X3,X1))). % 0.13/0.41 cnf(i_0_98, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.13/0.41 cnf(i_0_99, negated_conjecture, (p29(X1,X2)|~p29(X3,X2)|~p29(X3,X1))). % 0.13/0.41 cnf(i_0_100, negated_conjecture, (p27(X1,X2)|~p27(X3,X2)|~p27(X3,X1))). % 0.13/0.41 cnf(i_0_101, negated_conjecture, (p25(X1,X2)|~p25(X3,X2)|~p25(X3,X1))). % 0.13/0.41 cnf(i_0_102, negated_conjecture, (p23(X1,X2)|~p23(X3,X2)|~p23(X3,X1))). % 0.13/0.41 cnf(i_0_103, negated_conjecture, (p22(X1,X2)|~p22(X3,X2)|~p22(X3,X1))). % 0.13/0.41 cnf(i_0_104, negated_conjecture, (p20(X1,X2)|~p20(X3,X2)|~p20(X3,X1))). % 0.13/0.41 cnf(i_0_105, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.13/0.41 cnf(i_0_106, negated_conjecture, (p18(X1,X2)|~p18(X3,X2)|~p18(X3,X1))). % 0.13/0.41 cnf(i_0_107, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))). % 0.13/0.41 cnf(i_0_108, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))). % 0.13/0.41 cnf(i_0_109, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))). % 0.13/0.41 cnf(i_0_131, negated_conjecture, (p39(f5(c40,f10(f13(f15(c42,X1),X2),X3)),X4)|~p39(X1,X4))). % 0.13/0.41 cnf(i_0_114, negated_conjecture, (p11(f15(X1,X2),f15(X3,X4))|~p14(X1,X3)|~p4(X2,X4))). % 0.13/0.41 cnf(i_0_115, negated_conjecture, (p9(f34(X1,X2),f34(X3,X4))|~p33(X1,X3)|~p9(X2,X4))). % 0.13/0.41 cnf(i_0_112, negated_conjecture, (p39(X1,X2)|~p39(X3,X4)|~p22(X4,X2)|~p4(X3,X1))). % 0.13/0.41 cnf(i_0_116, negated_conjecture, (p8(f13(X1,X2),f13(X3,X4))|~p12(X2,X4)|~p11(X1,X3))). % 0.13/0.41 cnf(i_0_117, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p2(X1,X3)|~p3(X2,X4))). % 0.13/0.41 cnf(i_0_118, negated_conjecture, (p4(f17(X1,X2),f17(X3,X4))|~p16(X1,X3)|~p9(X2,X4))). % 0.13/0.41 cnf(i_0_119, negated_conjecture, (p35(f38(X1,X2),f38(X3,X4))|~p37(X1,X3)|~p4(X2,X4))). % 0.13/0.41 cnf(i_0_120, negated_conjecture, (p33(f36(X1,X2),f36(X3,X4))|~p12(X2,X4)|~p35(X1,X3))). % 0.13/0.41 cnf(i_0_121, negated_conjec# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.41 # Begin clausification derivation % 0.13/0.41 % 0.13/0.41 # End clausification derivation % 0.13/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.41 cnf(i_0_68, negated_conjecture, (p11(X1,X1))). % 0.13/0.41 cnf(i_0_113, negated_conjecture, (p39(f5(c40,f7(c41,f10(f13(f15(c42,c43),c44),c45))),c46))). % 0.13/0.41 cnf(i_0_69, negated_conjecture, (p9(X1,X1))). % 0.13/0.41 cnf(i_0_70, negated_conjecture, (p8(X1,X1))). % 0.13/0.41 cnf(i_0_71, negated_conjecture, (p6(X1,X1))). % 0.13/0.41 cnf(i_0_72, negated_conjecture, (p4(X1,X1))). % 0.13/0.41 cnf(i_0_73, negated_conjecture, (p37(X1,X1))). % 0.13/0.41 cnf(i_0_74, negated_conjecture, (p35(X1,X1))). % 0.13/0.41 cnf(i_0_75, negated_conjecture, (p33(X1,X1))). % 0.13/0.41 cnf(i_0_76, negated_conjecture, (p31(X1,X1))). % 0.13/0.41 cnf(i_0_77, negated_conjecture, (p3(X1,X1))). % 0.13/0.41 cnf(i_0_78, negated_conjecture, (p29(X1,X1))). % 0.13/0.41 cnf(i_0_79, negated_conjecture, (p27(X1,X1))). % 0.13/0.41 cnf(i_0_80, negated_conjecture, (p25(X1,X1))). % 0.13/0.41 cnf(i_0_81, negated_conjecture, (p23(X1,X1))). % 0.13/0.41 cnf(i_0_82, negated_conjecture, (p22(X1,X1))). % 0.13/0.41 cnf(i_0_83, negated_conjecture, (p20(X1,X1))). % 0.13/0.41 cnf(i_0_84, negated_conjecture, (p2(X1,X1))). % 0.13/0.41 cnf(i_0_85, negated_conjecture, (p18(X1,X1))). % 0.13/0.41 cnf(i_0_86, negated_conjecture, (p16(X1,X1))). % 0.13/0.41 cnf(i_0_87, negated_conjecture, (p14(X1,X1))). % 0.13/0.41 cnf(i_0_88, negated_conjecture, (p12(X1,X1))). % 0.13/0.41 cnf(i_0_134, negated_conjecture, (p3(f7(c41,f10(f13(f15(c42,X1),X2),X3)),f10(f13(f15(c42,f17(f19(f21(c47,X1),X2),X3)),f26(f28(f30(c48,X1),X2),X3)),f34(f36(f38(c49,X1),X2),X3))))). % 0.13/0.41 cnf(i_0_110, negated_conjecture, (~p39(f5(c40,f10(f13(f15(c42,c43),c44),c45)),c46))). % 0.13/0.41 cnf(i_0_111, negated_conjecture, (p39(X1,X2)|~p39(f17(f19(f21(c47,X1),X3),X4),X2))). % 0.13/0.41 cnf(i_0_130, negated_conjecture, (p39(X1,X2)|~p39(f5(c40,f10(f13(f15(c42,X1),X3),X4)),X2))). % 0.13/0.41 cnf(i_0_89, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))). % 0.13/0.41 cnf(i_0_90, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))). % 0.13/0.41 cnf(i_0_91, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.13/0.41 cnf(i_0_92, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.13/0.41 cnf(i_0_93, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.13/0.41 cnf(i_0_94, negated_conjecture, (p37(X1,X2)|~p37(X3,X2)|~p37(X3,X1))). % 0.13/0.41 cnf(i_0_95, negated_conjecture, (p35(X1,X2)|~p35(X3,X2)|~p35(X3,X1))). % 0.13/0.41 cnf(i_0_96, negated_conjecture, (p33(X1,X2)|~p33(X3,X2)|~p33(X3,X1))). % 0.13/0.41 cnf(i_0_97, negated_conjecture, (p31(X1,X2)|~p31(X3,X2)|~p31(X3,X1))). % 0.13/0.41 cnf(i_0_98, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.13/0.41 cnf(i_0_99, negated_conjecture, (p29(X1,X2)|~p29(X3,X2)|~p29(X3,X1))). % 0.13/0.41 cnf(i_0_100, negated_conjecture, (p27(X1,X2)|~p27(X3,X2)|~p27(X3,X1))). % 0.13/0.41 cnf(i_0_101, negated_conjecture, (p25(X1,X2)|~p25(X3,X2)|~p25(X3,X1))). % 0.13/0.41 cnf(i_0_102, negated_conjecture, (p23(X1,X2)|~p23(X3,X2)|~p23(X3,X1))). % 0.13/0.41 cnf(i_0_103, negated_conjecture, (p22(X1,X2)|~p22(X3,X2)|~p22(X3,X1))). % 0.13/0.41 cnf(i_0_104, negated_conjecture, (p20(X1,X2)|~p20(X3,X2)|~p20(X3,X1))). % 0.13/0.41 cnf(i_0_105, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.13/0.41 cnf(i_0_106, negated_conjecture, (p18(X1,X2)|~p18(X3,X2)|~p18(X3,X1))). % 0.13/0.41 cnf(i_0_107, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))). % 0.13/0.41 cnf(i_0_108, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))). % 0.13/0.41 cnf(i_0_109, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))). % 0.13/0.41 cnf(i_0_131, negated_conjecture, (p39(f5(c40,f10(f13(f15(c42,X1),X2),X3)),X4)|~p39(X1,X4))). % 0.13/0.41 cnf(i_0_114, negated_conjecture, (p11(f15(X1,X2),f15(X3,X4))|~p14(X1,X3)|~p4(X2,X4))). % 0.13/0.41 cnf(i_0_115, negated_conjecture, (p9(f34(X1,X2),f34(X3,X4))|~p33(X1,X3)|~p9(X2,X4))). % 0.13/0.41 cnf(i_0_112, negated_conjecture, (p39(X1,X2)|~p39(X3,X4)|~p22(X4,X2)|~p4(X3,X1))). % 0.13/0.41 cnf(i_0_116, negated_conjecture, (p8(f13(X1,X2),f13(X3,X4))|~p12(X2,X4)|~p11(X1,X3))). % 0.13/0.41 cnf(i_0_117, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p2(X1,X3)|~p3(X2,X4))). % 0.13/0.41 cnf(i_0_118, negated_conjecture, (p4(f17(X1,X2),f17(X3,X4))|~p16(X1,X3)|~p9(X2,X4))). % 0.13/0.41 cnf(i_0_119, negated_conjecture, (p35(f38(X1,X2),f38(X3,X4))|~p37(X1,X3)|~p4(X2,X4))). % 0.13/0.41 cnf(i_0_120, negated_conjecture, (p33(f36(X1,X2),f36(X3,X4))|~p12(X2,X4)|~p35(X1,X3))). % 0.13/0.41 cnf(i_0_121, negated_conjec# There were 1 total branch saturation attempts. % 0.13/0.41 # There were 0 of these attempts blocked. % 0.13/0.41 # There were 0 deferred branch saturation attempts. % 0.13/0.41 # There were 0 free duplicated saturations. % 0.13/0.41 # There were 1 total successful branch saturations. % 0.13/0.41 # There were 0 successful branch saturations in interreduction. % 0.13/0.41 # There were 0 successful branch saturations on the branch. % 0.13/0.41 # There were 1 successful branch saturations after the branch. % 0.13/0.41 ture, (p31(f32(X1,X2),f32(X3,X4))|~p22(X2,X4)|~p9(X1,X3))). % 0.13/0.41 cnf(i_0_123, negated_conjecture, (p3(f10(X1,X2),f10(X3,X4))|~p8(X1,X3)|~p9(X2,X4))). % 0.13/0.41 cnf(i_0_122, negated_conjecture, (p3(f7(X1,X2),f7(X3,X4))|~p3(X2,X4)|~p6(X1,X3))). % 0.13/0.41 cnf(i_0_124, negated_conjecture, (p27(f30(X1,X2),f30(X3,X4))|~p29(X1,X3)|~p4(X2,X4))). % 0.13/0.41 cnf(i_0_125, negated_conjecture, (p25(f28(X1,X2),f28(X3,X4))|~p12(X2,X4)|~p27(X1,X3))). % 0.13/0.41 cnf(i_0_126, negated_conjecture, (p23(f24(X1,X2),f24(X3,X4))|~p12(X1,X3)|~p22(X2,X4))). % 0.13/0.41 cnf(i_0_127, negated_conjecture, (p18(f21(X1,X2),f21(X3,X4))|~p20(X1,X3)|~p4(X2,X4))). % 0.13/0.41 cnf(i_0_128, negated_conjecture, (p16(f19(X1,X2),f19(X3,X4))|~p12(X2,X4)|~p18(X1,X3))). % 0.13/0.41 cnf(i_0_129, negated_conjecture, (p12(f26(X1,X2),f26(X3,X4))|~p25(X1,X3)|~p9(X2,X4))). % 0.13/0.41 cnf(i_0_133, negated_conjecture, (p31(f32(f34(f36(f38(c49,X1),X2),X3),X4),f32(X3,X4))|~p39(f17(f19(f21(c47,X1),X2),X3),X4))). % 0.13/0.41 cnf(i_0_132, negated_conjecture, (p23(f24(f26(f28(f30(c48,X1),X2),X3),X4),f24(X2,X4))|~p39(f17(f19(f21(c47,X1),X2),X3),X4))). % 0.13/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.41 # Begin printing tableau % 0.13/0.41 # Found 8 steps % 0.13/0.41 cnf(i_0_127, negated_conjecture, (p18(f21(X14,X13),f21(X14,X13))|~p20(X14,X14)|~p4(X13,X13)), inference(start_rule)). % 0.13/0.41 cnf(i_0_146, plain, (~p20(X14,X14)), inference(closure_rule, [i_0_83])). % 0.13/0.41 cnf(i_0_147, plain, (~p4(X13,X13)), inference(closure_rule, [i_0_72])). % 0.13/0.41 cnf(i_0_145, plain, (p18(f21(X14,X13),f21(X14,X13))), inference(extension_rule, [i_0_128])). % 0.13/0.41 cnf(i_0_292, plain, (~p12(X10,X10)), inference(closure_rule, [i_0_88])). % 0.13/0.41 cnf(i_0_291, plain, (p16(f19(f21(X14,X13),X10),f19(f21(X14,X13),X10))), inference(extension_rule, [i_0_118])). % 0.13/0.41 cnf(i_0_330, plain, (~p9(X7,X7)), inference(closure_rule, [i_0_69])). % 0.13/0.41 cnf(i_0_328, plain, (p4(f17(f19(f21(X14,X13),X10),X7),f17(f19(f21(X14,X13),X10),X7))), inference(etableau_closure_rule, [i_0_328, ...])). % 0.13/0.41 # End printing tableau % 0.13/0.41 # SZS output end % 0.13/0.41 # Branches closed with saturation will be marked with an "s" % 0.13/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.41 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.41 # Begin clausification derivation % 0.13/0.41 % 0.13/0.41 # End clausification derivation % 0.13/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.41 cnf(i_0_68, negated_conjecture, (p11(X1,X1))). % 0.13/0.41 cnf(i_0_113, negated_conjecture, (p39(f5(c40,f7(c41,f10(f13(f15(c42,c43),c44),c45))),c46))). % 0.13/0.41 cnf(i_0_69, negated_conjecture, (p9(X1,X1))). % 0.13/0.41 cnf(i_0_70, negated_conjecture, (p8(X1,X1))). % 0.13/0.41 cnf(i_0_71, negated_conjecture, (p6(X1,X1))). % 0.13/0.41 cnf(i_0_72, negated_conjecture, (p4(X1,X1))). % 0.13/0.41 cnf(i_0_73, negated_conjecture, (p37(X1,X1))). % 0.13/0.41 cnf(i_0_74, negated_conjecture, (p35(X1,X1))). % 0.13/0.41 cnf(i_0_75, negated_conjecture, (p33(X1,X1))). % 0.13/0.41 cnf(i_0_76, negated_conjecture, (p31(X1,X1))). % 0.13/0.41 cnf(i_0_77, negated_conjecture, (p3(X1,X1))). % 0.13/0.41 cnf(i_0_78, negated_conjecture, (p29(X1,X1))). % 0.13/0.41 cnf(i_0_79, negated_conjecture, (p27(X1,X1))). % 0.13/0.41 cnf(i_0_80, negated_conjecture, (p25(X1,X1))). % 0.13/0.41 cnf(i_0_81, negated_conjecture, (p23(X1,X1))). % 0.13/0.41 cnf(i_0_82, negated_conjecture, (p22(X1,X1))). % 0.13/0.41 cnf(i_0_83, negated_conjecture, (p20(X1,X1))). % 0.13/0.41 cnf(i_0_84, negated_conjecture, (p2(X1,X1))). % 0.13/0.41 cnf(i_0_85, negated_conjecture, (p18(X1,X1))). % 0.13/0.41 cnf(i_0_86, negated_conjecture, (p16(X1,X1))). % 0.13/0.41 cnf(i_0_87, negated_conjecture, (p14(X1,X1))). % 0.13/0.41 cnf(i_0_88, negated_conjecture, (p12(X1,X1))). % 0.13/0.41 cnf(i_0_134, negated_conjecture, (p3(f7(c41,f10(f13(f15(c42,X1),X2),X3)),f10(f13(f15(c42,f17(f19(f21(c47,X1),X2),X3)),f26(f28(f30(c48,X1),X2),X3)),f34(f36(f38(c49,X1),X2),X3))))). % 0.13/0.41 cnf(i_0_110, negated_conjecture, (~p39(f5(c40,f10(f13(f15(c42,c43),c44),c45)),c46))). % 0.13/0.41 cnf(i_0_111, negated_conjecture, (p39(X1,X2)|~p39(f17(f19(f21(c47,X1),X3),X4),X2))). % 0.13/0.41 cnf(i_0_130, negated_conjecture, (p39(X1,X2)|~p39(f5(c40,f10(f13(f15(c42,X1),X3),X4)),X2))). % 0.13/0.41 cnf(i_0_89, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))). % 0.13/0.41 cnf(i_0_90, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))). % 0.13/0.41 cnf(i_0_91, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.13/0.41 cnf(i_0_92, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.13/0.41 cnf(i_0_93, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.13/0.41 cnf(i_0_94, negated_conjecture, (p37(X1,X2)|~p37(X3,X2)|~p37(X3,X1))). % 0.13/0.41 cnf(i_0_95, negated_conjecture, (p35(X1,X2)|~p35(X3,X2)|~p35(X3,X1))). % 0.13/0.41 cnf(i_0_96, negated_conjecture, (p33(X1,X2)|~p33(X3,X2)|~p33(X3,X1))). % 0.13/0.41 cnf(i_0_97, negated_conjecture, (p31(X1,X2)|~p31(X3,X2)|~p31(X3,X1))). % 0.13/0.41 cnf(i_0_98, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.13/0.41 cnf(i_0_99, negated_conjecture, (p29(X1,X2)|~p29(X3,X2)|~p29(X3,X1))). % 0.13/0.41 cnf(i_0_100, negated_conjecture, (p27(X1,X2)|~p27(X3,X2)|~p27(X3,X1))). % 0.13/0.41 cnf(i_0_101, negated_conjecture, (p25(X1,X2)|~p25(X3,X2)|~p25(X3,X1))). % 0.13/0.41 cnf(i_0_102, negated_conjecture, (p23(X1,X2)|~p23(X3,X2)|~p23(X3,X1))). % 0.13/0.41 cnf(i_0_103, negated_conjecture, (p22(X1,X2)|~p22(X3,X2)|~p22(X3,X1))). % 0.13/0.41 cnf(i_0_104, negated_conjecture, (p20(X1,X2)|~p20(X3,X2)|~p20(X3,X1))). % 0.13/0.41 cnf(i_0_105, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.13/0.41 cnf(i_0_106, negated_conjecture, (p18(X1,X2)|~p18(X3,X2)|~p18(X3,X1))). % 0.13/0.41 cnf(i_0_107, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))). % 0.13/0.41 cnf(i_0_108, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))). % 0.13/0.41 cnf(i_0_109, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))). % 0.13/0.41 cnf(i_0_131, negated_conjecture, (p39(f5(c40,f10(f13(f15(c42,X1),X2),X3)),X4)|~p39(X1,X4))). % 0.13/0.41 cnf(i_0_114, negated_conjecture, (p11(f15(X1,X2),f15(X3,X4))|~p14(X1,X3)|~p4(X2,X4))). % 0.13/0.41 cnf(i_0_115, negated_conjecture, (p9(f34(X1,X2),f34(X3,X4))|~p33(X1,X3)|~p9(X2,X4))). % 0.13/0.41 cnf(i_0_112, negated_conjecture, (p39(X1,X2)|~p39(X3,X4)|~p22(X4,X2)|~p4(X3,X1))). % 0.13/0.41 cnf(i_0_116, negated_conjecture, (p8(f13(X1,X2),f13(X3,X4))|~p12(X2,X4)|~p11(X1,X3))). % 0.13/0.41 cnf(i_0_117, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p2(X1,X3)|~p3(X2,X4))). % 0.13/0.41 cnf(i_0_118, negated_conjecture, (p4(f17(X1,X2),f17(X3,X4))|~p16(X1,X3)|~p9(X2,X4))). % 0.13/0.41 cnf(i_0_119, negated_conjecture, (p35(f38(X1,X2),f38(X3,X4))|~p37(X1,X3)|~p4(X2,X4))). % 0.13/0.41 cnf(i_0_120, negated_conjecture, (p33(f36(X1,X2),f36(X3,X4))|~p12(X2,X4)|~p35(X1,X3))). % 0.13/0.41 cnf(i_0_121, negated_conjecture, (p31(f32(X1,X2),f32(X3,X4))|~p22(X2,X4)|~p9(X1,X3))). % 0.13/0.41 cnf(i_0_123, negated_conjecture, (p3(f10(X1,X2),f10(X3,X4))|~p8(X1,X3)|~p9(X2,X4))). % 0.13/0.41 cnf(i_0_122, negated_conjecture, (p3(f7(X1,X2),f7(X3,X4))|~p3(X2,X4)|~p6(X1,X3))). % 0.13/0.41 cnf(i_0_124, negated_conjecture, (p27(f30(X1,X2),f30(X3,X4))|~p29(X1,X3)|~p4(X2,X4))). % 0.13/0.41 cnf(i_0_125, negated_conjecture, (p25(f28(X1,X2),f28(X3,X4))|~p12(X2,X4)|~p27(X1,X3))). % 0.13/0.41 cnf(i_0_126, negated_conjecture, (p23(f24(X1,X2),f24(X3,X4))|~p12(X1,X3)|~p22(X2,X4))). % 0.13/0.41 cnf(i_0_127, negated_conjecture, (p18(f21(X1,X2),f21(X3,X4))|~p20(X1,X3)|~p4(X2,X4))). % 0.13/0.41 cnf(i_0_128, negated_conjecture, (p16(f19(X1,X2),f19(X3,X4))|~p12(X2,X4)|~p18(X1,X3))). % 0.13/0.41 cnf(i_0_129, negated_conjecture, (p12(f26(X1,X2),f26(X3,X4))|~p25(X1,X3)|~p9(X2,X4))). % 0.13/0.41 cnf(i_0_133, negated_conjecture, (p31(f32(f34(f36(f38(c49,X1),X2),X3),X4),f32(X3,X4))|~p39(f17(f19(f21(c47,X1),X2),X3),X4))). % 0.13/0.41 cnf(i_0_132, negated_conjecture, (p23(f24(f26(f28(f30(c48,X1),X2),X3),X4),f24(X2,X4))|~p39(f17(f19(f21(c47,X1),X2),X3),X4))). % 0.13/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.41 # Begin printing tableau % 0.13/0.41 # Found 8 steps % 0.13/0.41 cnf(i_0_125, negated_conjecture, (p25(f28(X14,X13),f28(X14,X13))|~p12(X13,X13)|~p27(X14,X14)), inference(start_rule)). % 0.13/0.41 cnf(i_0_152, plain, (~p12(X13,X13)), inference(closure_rule, [i_0_88])). % 0.13/0.41 cnf(i_0_153, plain, (~p27(X14,X14)), inference(closure_rule, [i_0_79])). % 0.13/0.41 cnf(i_0_151, plain, (p25(f28(X14,X13),f28(X14,X13))), inference(extension_rule, [i_0_129])). % 0.13/0.41 cnf(i_0_290, plain, (~p9(X12,X12)), inference(closure_rule, [i_0_69])). % 0.13/0.41 cnf(i_0_288, plain, (p12(f26(f28(X14,X13),X12),f26(f28(X14,X13),X12))), inference(extension_rule, [i_0_128])). % 0.13/0.41 cnf(i_0_297, plain, (~p18(X5,X5)), inference(closure_rule, [i_0_85])). % 0.13/0.41 cnf(i_0_295, plain, (p16(f19(X5,f26(f28(X14,X13),X12)),f19(X5,f26(f28(X14,X13),X12)))), inference(etableau_closure_rule, [i_0_295, ...])). % 0.13/0.41 # End printing tableau % 0.13/0.41 # SZS output end % 0.13/0.41 # Branches closed with saturation will be marked with an "s" % 0.13/0.41 ture, (p31(f32(X1,X2),f32(X3,X4))|~p22(X2,X4)|~p9(X1,X3))). % 0.13/0.41 cnf(i_0_123, negated_conjecture, (p3(f10(X1,X2),f10(X3,X4))|~p8(X1,X3)|~p9(X2,X4))). % 0.13/0.41 cnf(i_0_122, negated_conjecture, (p3(f7(X1,X2),f7(X3,X4))|~p3(X2,X4)|~p6(X1,X3))). % 0.13/0.41 cnf(i_0_124, negated_conjecture, (p27(f30(X1,X2),f30(X3,X4))|~p29(X1,X3)|~p4(X2,X4))). % 0.13/0.41 cnf(i_0_125, negated_conjecture, (p25(f28(X1,X2),f28(X3,X4))|~p12(X2,X4)|~p27(X1,X3))). % 0.13/0.41 cnf(i_0_126, negated_conjecture, (p23(f24(X1,X2),f24(X3,X4))|~p12(X1,X3)|~p22(X2,X4))). % 0.13/0.41 cnf(i_0_127, negated_conjecture, (p18(f21(X1,X2),f21(X3,X4))|~p20(X1,X3)|~p4(X2,X4))). % 0.13/0.41 cnf(i_0_128, negated_conjecture, (p16(f19(X1,X2),f19(X3,X4))|~p12(X2,X4)|~p18(X1,X3))). % 0.13/0.41 cnf(i_0_129, negated_conjecture, (p12(f26(X1,X2),f26(X3,X4))|~p25(X1,X3)|~p9(X2,X4))). % 0.13/0.41 cnf(i_0_133, negated_conjecture, (p31(f32(f34(f36(f38(c49,X1),X2),X3),X4),f32(X3,X4))|~p39(f17(f19(f21(c47,X1),X2),X3),X4))). % 0.13/0.41 cnf(i_0_132, negated_conjecture, (p23(f24(f26(f28(f30(c48,X1),X2),X3),X4),f24(X2,X4))|~p39(f17(f19(f21(c47,X1),X2),X3),X4))). % 0.13/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.41 # Begin printing tableau % 0.13/0.41 # Found 8 steps % 0.13/0.41 cnf(i_0_128, negated_conjecture, (p16(f19(X17,X16),f19(X17,X16))|~p12(X16,X16)|~p18(X17,X17)), inference(start_rule)). % 0.13/0.41 cnf(i_0_143, plain, (~p12(X16,X16)), inference(closure_rule, [i_0_88])). % 0.13/0.41 cnf(i_0_144, plain, (~p18(X17,X17)), inference(closure_rule, [i_0_85])). % 0.13/0.41 cnf(i_0_142, plain, (p16(f19(X17,X16),f19(X17,X16))), inference(extension_rule, [i_0_118])). % 0.13/0.41 cnf(i_0_323, plain, (~p9(X15,X15)), inference(closure_rule, [i_0_69])). % 0.13/0.41 cnf(i_0_321, plain, (p4(f17(f19(X17,X16),X15),f17(f19(X17,X16),X15))), inference(extension_rule, [i_0_127])). % 0.13/0.41 cnf(i_0_335, plain, (~p20(X5,X5)), inference(closure_rule, [i_0_83])). % 0.13/0.41 cnf(i_0_334, plain, (p18(f21(X5,f17(f19(X17,X16),X15)),f21(X5,f17(f19(X17,X16),X15)))), inference(etableau_closure_rule, [i_0_334, ...])). % 0.13/0.41 # End printing tableau % 0.13/0.41 # SZS output end % 0.13/0.41 # Branches closed with saturation will be marked with an "s" % 0.13/0.41 # Child (8539) has found a proof. % 0.13/0.41 % 0.13/0.41 # Proof search is over... % 0.13/0.41 # Freeing feature tree %------------------------------------------------------------------------------