%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN619-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 : n012.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:52 EDT 2022 % Result : Unsatisfiable 0.20s 0.39s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SYN619-1 : TPTP v8.1.0. Released v2.5.0. % 0.07/0.13 % 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 : n012.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 : Tue Jul 12 06:37:57 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Presaturation interreduction done % 0.13/0.38 # Number of axioms: 34 Number of unprocessed: 33 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.13/0.38 # The folding up rule is enabled... % 0.13/0.38 # Local unification is enabled... % 0.13/0.38 # Any saturation attempts will use folding labels... % 0.13/0.38 # 33 beginning clauses after preprocessing and clausification % 0.13/0.38 # Creating start rules for all 33 conjectures. % 0.13/0.38 # There are 33 start rule candidates: % 0.13/0.38 # Found 8 unit axioms. % 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.38 # 33 start rule tableaux created. % 0.13/0.38 # 25 extension rule candidate clauses % 0.13/0.38 # 8 unit axiom clauses % 0.13/0.38 % 0.13/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_41, negated_conjecture, (p18(c24,f6(c25)))). % 0.20/0.39 cnf(i_0_35, negated_conjecture, (p10(X1,X1))). % 0.20/0.39 cnf(i_0_36, negated_conjecture, (p8(X1,X1))). % 0.20/0.39 cnf(i_0_37, negated_conjecture, (p5(X1,X1))). % 0.20/0.39 cnf(i_0_38, negated_conjecture, (p4(X1,X1))). % 0.20/0.39 cnf(i_0_39, negated_conjecture, (p2(X1,X1))). % 0.20/0.39 cnf(i_0_40, negated_conjecture, (p17(X1,X1))). % 0.20/0.39 cnf(i_0_42, negated_conjecture, (~p18(c24,f6(f7(c22,c23))))). % 0.20/0.39 cnf(i_0_43, negated_conjecture, (p17(X1,X2)|~p17(f3(X1),X2))). % 0.20/0.39 cnf(i_0_56, negated_conjecture, (p2(X1,X2)|~p2(f13(X3,X1),f13(X4,X2)))). % 0.20/0.39 cnf(i_0_57, negated_conjecture, (p2(X1,X2)|~p2(f13(X1,X3),f13(X2,X4)))). % 0.20/0.39 cnf(i_0_45, negated_conjecture, (p10(f12(X1),f12(X2))|~p4(X1,X2))). % 0.20/0.39 cnf(i_0_58, negated_conjecture, (p18(X1,f6(c19))|p2(f14(X1),c20)|~p18(X1,f6(c25)))). % 0.20/0.39 cnf(i_0_61, negated_conjecture, (p18(X1,f6(c19))|p17(f3(c21),f15(X1))|~p18(X1,f6(c25)))). % 0.20/0.39 cnf(i_0_44, negated_conjecture, (p5(f6(X1),f6(X2))|~p4(X1,X2))). % 0.20/0.39 cnf(i_0_50, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.20/0.39 cnf(i_0_46, negated_conjecture, (p2(f11(X1),f11(X2))|~p10(X1,X2))). % 0.20/0.39 cnf(i_0_47, negated_conjecture, (p2(f14(X1),f14(X2))|~p8(X1,X2))). % 0.20/0.39 cnf(i_0_51, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.20/0.39 cnf(i_0_52, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.20/0.39 cnf(i_0_53, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.20/0.39 cnf(i_0_54, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.20/0.39 cnf(i_0_48, negated_conjecture, (p2(f15(X1),f15(X2))|~p8(X1,X2))). % 0.20/0.39 cnf(i_0_49, negated_conjecture, (p2(f16(X1),f16(X2))|~p8(X1,X2))). % 0.20/0.39 cnf(i_0_66, negated_conjecture, (~p17(c21,X1)|~p2(X2,c20)|~p8(c24,f9(f13(X2,X1),X3)))). % 0.20/0.39 cnf(i_0_68, negated_conjecture, (p18(X1,f6(f7(c22,c23)))|p8(X1,f9(f13(c20,c21),f11(f12(f7(c22,c23)))))|~p18(X1,f6(c19)))). % 0.20/0.39 cnf(i_0_55, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.20/0.39 cnf(i_0_59, negated_conjecture, (p17(X1,X2)|~p17(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.20/0.39 cnf(i_0_62, negated_conjecture, (p8(f9(X1,X2),f9(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.20/0.39 cnf(i_0_60, negated_conjecture, (p18(X1,X2)|~p18(X3,X4)|~p5(X4,X2)|~p8(X3,X1))). % 0.20/0.39 cnf(i_0_65, negated_conjecture, (p4(f7(X1,X2),f7(X3,X4))|~p2(X1,X3)|~p4(X2,X4))). % 0.20/0.39 cnf(i_0_63, negated_conjecture, (p2(f13(X1,X2),f13(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.20/0.39 cnf(i_0_67, negated_conjecture, (p18(X1,f6(c19))|p8(X1,f9(f13(f14(X1),f15(X1)),f16(X1)))|~p18(X1,f6(c25)))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 8 steps % 0.20/0.39 cnf(i_0_63, negated_conjecture, (p2(f13(X12,X13),f13(X12,X13))|~p2(X13,X13)|~p2(X12,X12)), inference(start_rule)). % 0.20/0.39 cnf(i_0_73, plain, (~p2(X13,X13)), inference(closure_rule, [i_0_39])). % 0.20/0.39 cnf(i_0_74, plain, (~p2(X12,X12)), inference(closure_rule, [i_0_39])). % 0.20/0.39 cnf(i_0_72, plain, (p2(f13(X12,X13),f13(X12,X13))), inference(extension_rule, [i_0_63])). % 0.20/0.39 cnf(i_0_149, plain, (~p2(X14,X14)), inference(closure_rule, [i_0_39])). % 0.20/0.39 cnf(i_0_147, plain, (p2(f13(X14,f13(X12,X13)),f13(X14,f13(X12,X13)))), inference(extension_rule, [i_0_65])). % 0.20/0.39 cnf(i_0_155, plain, (~p4(X7,X7)), inference(closure_rule, [i_0_38])). % 0.20/0.39 cnf(i_0_153, plain, (p4(f7(f13(X14,f13(X12,X13)),X7),f7(f13(X14,f13(X12,X13)),X7))), inference(etableau_closure_rule, [i_0_153, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_41, negated_conjecture, (p18(c24,f6(c25)))). % 0.20/0.39 cnf(i_0_35, negated_conjecture, (p10(X1,X1))). % 0.20/0.39 cnf(i_0_36, negated_conjecture, (p8(X1,X1))). % 0.20/0.39 cnf(i_0_37, negated_conjecture, (p5(X1,X1))). % 0.20/0.39 cnf(i_0_38, negated_conjecture, (p4(X1,X1))). % 0.20/0.39 cnf(i_0_39, negated_conjecture, (p2(X1,X1))). % 0.20/0.39 cnf(i_0_40, negated_conjecture, (p17(X1,X1))). % 0.20/0.39 cnf(i_0_42, negated_conjecture, (~p18(c24,f6(f7(c22,c23))))). % 0.20/0.39 cnf(i_0_43, negated_conjecture, (p17(X1,X2)|~p17(f3(X1),X2))). % 0.20/0.39 cnf(i_0_56, negated_conjecture, (p2(X1,X2)|~p2(f13(X3,X1),f13(X4,X2)))). % 0.20/0.39 cnf(i_0_57, negated_conjecture, (p2(X1,X2)|~p2(f13(X1,X3),f13(X2,X4)))). % 0.20/0.39 cnf(i_0_45, negated_conjecture, (p10(f12(X1),f12(X2))|~p4(X1,X2))). % 0.20/0.39 cnf(i_0_58, negated_conjecture, (p18(X1,f6(c19))|p2(f14(X1),c20)|~p18(X1,f6(c25)))). % 0.20/0.39 cnf(i_0_61, negated_conjecture, (p18(X1,f6(c19))|p17(f3(c21),f15(X1))|~p18(X1,f6(c25)))). % 0.20/0.39 cnf(i_0_44, negated_conjecture, (p5(f6(X1),f6(X2))|~p4(X1,X2))). % 0.20/0.39 cnf(i_0_50, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.20/0.39 cnf(i_0_46, negated_conjecture, (p2(f11(X1),f11(X2))|~p10(X1,X2))). % 0.20/0.39 cnf(i_0_47, negated_conjecture, (p2(f14(X1),f14(X2))|~p8(X1,X2))). % 0.20/0.39 cnf(i_0_51, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.20/0.39 cnf(i_0_52, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.20/0.39 cnf(i_0_53, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.20/0.39 cnf(i_0_54, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.20/0.39 cnf(i_0_48, negated_conjecture, (p2(f15(X1),f15(X2))|~p8(X1,X2))). % 0.20/0.39 cnf(i_0_49, negated_conjecture, (p2(f16(X1),f16(X2))|~p8(X1,X2))). % 0.20/0.39 cnf(i_0_66, negated_conjecture, (~p17(c21,X1)|~p2(X2,c20)|~p8(c24,f9(f13(X2,X1),X3)))). % 0.20/0.39 cnf(i_0_68, negated_conjecture, (p18(X1,f6(f7(c22,c23)))|p8(X1,f9(f13(c20,c21),f11(f12(f7(c22,c23)))))|~p18(X1,f6(c19)))). % 0.20/0.39 cnf(i_0_55, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.20/0.39 cnf(i_0_59, negated_conjecture, (p17(X1,X2)|~p17(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.20/0.39 cnf(i_0_62, negated_conjecture, (p8(f9(X1,X2),f9(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.20/0.39 cnf(i_0_60, negated_conjecture, (p18(X1,X2)|~p18(X3,X4)|~p5(X4,X2)|~p8(X3,X1))). % 0.20/0.39 cnf(i_0_65, negated_conjecture, (p4(f7(X1,X2),f7(X3,X4))|~p2(X1,X3)|~p4(X2,X4))). % 0.20/0.39 cnf(i_0_63, negated_conjecture, (p2(f13(X1,X2),f13(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.20/0.39 cnf(i_0_67, negated_conjecture, (p18(X1,f6(c19))|p8(X1,f9(f13(f14(X1),f15(X1)),f16(X1)))|~p18(X1,f6(c25)))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 11 steps % 0.20/0.39 cnf(i_0_65, negated_conjecture, (p4(f7(X8,X9),f7(X8,X9))|~p2(X8,X8)|~p4(X9,X9)), inference(start_rule)). % 0.20/0.39 cnf(i_0_76, plain, (~p2(X8,X8)), inference(closure_rule, [i_0_39])). % 0.20/0.39 cnf(i_0_77, plain, (~p4(X9,X9)), inference(closure_rule, [i_0_38])). % 0.20/0.39 cnf(i_0_75, plain, (p4(f7(X8,X9),f7(X8,X9))), inference(extension_rule, [i_0_65])). % 0.20/0.39 cnf(i_0_151, plain, (~p2(X5,X5)), inference(closure_rule, [i_0_39])). % 0.20/0.39 cnf(i_0_150, plain, (p4(f7(X5,f7(X8,X9)),f7(X5,f7(X8,X9)))), inference(extension_rule, [i_0_54])). % 0.20/0.39 cnf(i_0_183, plain, (p4(f7(X5,f7(X8,X9)),f7(X5,f7(X8,X9)))), inference(extension_rule, [i_0_44])). % 0.20/0.39 cnf(i_0_185, plain, (~p4(f7(X5,f7(X8,X9)),f7(X5,f7(X8,X9)))), inference(extension_rule, [i_0_65])). % 0.20/0.39 cnf(i_0_293, plain, (~p2(X5,X5)), inference(closure_rule, [i_0_39])). % 0.20/0.39 cnf(i_0_294, plain, (~p4(f7(X8,X9),f7(X8,X9))), inference(closure_rule, [i_0_38])). % 0.20/0.39 cnf(i_0_231, plain, (p5(f6(f7(X5,f7(X8,X9))),f6(f7(X5,f7(X8,X9))))), inference(etableau_closure_rule, [i_0_231, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # There were 1 total branch saturation attempts. % 0.20/0.39 # There were 0 of these attempts blocked. % 0.20/0.39 # There were 0 deferred branch saturation attempts. % 0.20/0.39 # There were 0 free duplicated saturations. % 0.20/0.39 # There were 1 total successful branch saturations. % 0.20/0.39 # There were 0 successful branch saturations in interreduction. % 0.20/0.39 # There were 0 successful branch saturations on the branch. % 0.20/0.39 # There were 1 successful branch saturations after the branch. % 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_41, negated_conjecture, (p18(c24,f6(c25)))). % 0.20/0.39 cnf(i_0_35, negated_conjecture, (p10(X1,X1))). % 0.20/0.39 cnf(i_0_36, negated_conjecture, (p8(X1,X1))). % 0.20/0.39 cnf(i_0_37, negated_conjecture, (p5(X1,X1))). % 0.20/0.39 cnf(i_0_38, negated_conjecture, (p4(X1,X1))). % 0.20/0.39 cnf(i_0_39, negated_conjecture, (p2(X1,X1))). % 0.20/0.39 cnf(i_0_40, negated_conjecture, (p17(X1,X1))). % 0.20/0.39 cnf(i_0_42, negated_conjecture, (~p18(c24,f6(f7(c22,c23))))). % 0.20/0.39 cnf(i_0_43, negated_conjecture, (p17(X1,X2)|~p17(f3(X1),X2))). % 0.20/0.39 cnf(i_0_56, negated_conjecture, (p2(X1,X2)|~p2(f13(X3,X1),f13(X4,X2)))). % 0.20/0.39 cnf(i_0_57, negated_conjecture, (p2(X1,X2)|~p2(f13(X1,X3),f13(X2,X4)))). % 0.20/0.39 cnf(i_0_45, negated_conjecture, (p10(f12(X1),f12(X2))|~p4(X1,X2))). % 0.20/0.39 cnf(i_0_58, negated_conjecture, (p18(X1,f6(c19))|p2(f14(X1),c20)|~p18(X1,f6(c25)))). % 0.20/0.39 cnf(i_0_61, negated_conjecture, (p18(X1,f6(c19))|p17(f3(c21),f15(X1))|~p18(X1,f6(c25)))). % 0.20/0.39 cnf(i_0_44, negated_conjecture, (p5(f6(X1),f6(X2))|~p4(X1,X2))). % 0.20/0.39 cnf(i_0_50, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.20/0.39 cnf(i_0_46, negated_conjecture, (p2(f11(X1),f11(X2))|~p10(X1,X2))). % 0.20/0.39 cnf(i_0_47, negated_conjecture, (p2(f14(X1),f14(X2))|~p8(X1,X2))). % 0.20/0.39 cnf(i_0_51, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.20/0.39 cnf(i_0_52, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.20/0.39 cnf(i_0_53, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.20/0.39 cnf(i_0_54, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.20/0.39 cnf(i_0_48, negated_conjecture, (p2(f15(X1),f15(X2))|~p8(X1,X2))). % 0.20/0.39 cnf(i_0_49, negated_conjecture, (p2(f16(X1),f16(X2))|~p8(X1,X2))). % 0.20/0.39 cnf(i_0_66, negated_conjecture, (~p17(c21,X1)|~p2(X2,c20)|~p8(c24,f9(f13(X2,X1),X3)))). % 0.20/0.39 cnf(i_0_68, negated_conjecture, (p18(X1,f6(f7(c22,c23)))|p8(X1,f9(f13(c20,c21),f11(f12(f7(c22,c23)))))|~p18(X1,f6(c19)))). % 0.20/0.39 cnf(i_0_55, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.20/0.39 cnf(i_0_59, negated_conjecture, (p17(X1,X2)|~p17(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.20/0.39 cnf(i_0_62, negated_conjecture, (p8(f9(X1,X2),f9(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.20/0.39 cnf(i_0_60, negated_conjecture, (p18(X1,X2)|~p18(X3,X4)|~p5(X4,X2)|~p8(X3,X1))). % 0.20/0.39 cnf(i_0_65, negated_conjecture, (p4(f7(X1,X2),f7(X3,X4))|~p2(X1,X3)|~p4(X2,X4))). % 0.20/0.39 cnf(i_0_63, negated_conjecture, (p2(f13(X1,X2),f13(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.20/0.39 cnf(i_0_67, negated_conjecture, (p18(X1,f6(c19))|p8(X1,f9(f13(f14(X1),f15(X1)),f16(X1)))|~p18(X1,f6(c25)))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 8 steps % 0.20/0.39 cnf(i_0_55, negated_conjecture, (p2(X11,X11)|~p2(X11,X11)|~p2(X11,X11)), inference(start_rule)). % 0.20/0.39 cnf(i_0_90, plain, (~p2(X11,X11)), inference(closure_rule, [i_0_39])). % 0.20/0.39 cnf(i_0_91, plain, (~p2(X11,X11)), inference(closure_rule, [i_0_39])). % 0.20/0.39 cnf(i_0_89, plain, (p2(X11,X11)), inference(extension_rule, [i_0_63])). % 0.20/0.39 cnf(i_0_149, plain, (~p2(X12,X12)), inference(closure_rule, [i_0_39])). % 0.20/0.39 cnf(i_0_147, plain, (p2(f13(X12,X11),f13(X12,X11))), inference(extension_rule, [i_0_65])). % 0.20/0.39 cnf(i_0_155, plain, (~p4(X8,X8)), inference(closure_rule, [i_0_38])). % 0.20/0.39 cnf(i_0_153, plain, (p4(f7(f13(X12,X11),X8),f7(f13(X12,X11),X8))), inference(etableau_closure_rule, [i_0_153, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.39 # Begin clausification derivation % 0.20/0.39 % 0.20/0.39 # End clausification derivation % 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.39 cnf(i_0_41, negated_conjecture, (p18(c24,f6(c25)))). % 0.20/0.39 cnf(i_0_35, negated_conjecture, (p10(X1,X1))). % 0.20/0.39 cnf(i_0_36, negated_conjecture, (p8(X1,X1))). % 0.20/0.39 cnf(i_0_37, negated_conjecture, (p5(X1,X1))). % 0.20/0.39 cnf(i_0_38, negated_conjecture, (p4(X1,X1))). % 0.20/0.39 cnf(i_0_39, negated_conjecture, (p2(X1,X1))). % 0.20/0.39 cnf(i_0_40, negated_conjecture, (p17(X1,X1))). % 0.20/0.39 cnf(i_0_42, negated_conjecture, (~p18(c24,f6(f7(c22,c23))))). % 0.20/0.39 cnf(i_0_43, negated_conjecture, (p17(X1,X2)|~p17(f3(X1),X2))). % 0.20/0.39 cnf(i_0_56, negated_conjecture, (p2(X1,X2)|~p2(f13(X3,X1),f13(X4,X2)))). % 0.20/0.39 cnf(i_0_57, negated_conjecture, (p2(X1,X2)|~p2(f13(X1,X3),f13(X2,X4)))). % 0.20/0.39 cnf(i_0_45, negated_conjecture, (p10(f12(X1),f12(X2))|~p4(X1,X2))). % 0.20/0.39 cnf(i_0_58, negated_conjecture, (p18(X1,f6(c19))|p2(f14(X1),c20)|~p18(X1,f6(c25)))). % 0.20/0.39 cnf(i_0_61, negated_conjecture, (p18(X1,f6(c19))|p17(f3(c21),f15(X1))|~p18(X1,f6(c25)))). % 0.20/0.39 cnf(i_0_44, negated_conjecture, (p5(f6(X1),f6(X2))|~p4(X1,X2))). % 0.20/0.39 cnf(i_0_50, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.20/0.39 cnf(i_0_46, negated_conjecture, (p2(f11(X1),f11(X2))|~p10(X1,X2))). % 0.20/0.39 cnf(i_0_47, negated_conjecture, (p2(f14(X1),f14(X2))|~p8(X1,X2))). % 0.20/0.39 cnf(i_0_51, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.20/0.39 cnf(i_0_52, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X3,X1))). % 0.20/0.39 cnf(i_0_53, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.20/0.39 cnf(i_0_54, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.20/0.39 cnf(i_0_48, negated_conjecture, (p2(f15(X1),f15(X2))|~p8(X1,X2))). % 0.20/0.39 cnf(i_0_49, negated_conjecture, (p2(f16(X1),f16(X2))|~p8(X1,X2))). % 0.20/0.39 cnf(i_0_66, negated_conjecture, (~p17(c21,X1)|~p2(X2,c20)|~p8(c24,f9(f13(X2,X1),X3)))). % 0.20/0.39 cnf(i_0_68, negated_conjecture, (p18(X1,f6(f7(c22,c23)))|p8(X1,f9(f13(c20,c21),f11(f12(f7(c22,c23)))))|~p18(X1,f6(c19)))). % 0.20/0.39 cnf(i_0_55, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.20/0.39 cnf(i_0_59, negated_conjecture, (p17(X1,X2)|~p17(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.20/0.39 cnf(i_0_62, negated_conjecture, (p8(f9(X1,X2),f9(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.20/0.39 cnf(i_0_60, negated_conjecture, (p18(X1,X2)|~p18(X3,X4)|~p5(X4,X2)|~p8(X3,X1))). % 0.20/0.39 cnf(i_0_65, negated_conjecture, (p4(f7(X1,X2),f7(X3,X4))|~p2(X1,X3)|~p4(X2,X4))). % 0.20/0.39 cnf(i_0_63, negated_conjecture, (p2(f13(X1,X2),f13(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.20/0.39 cnf(i_0_67, negated_conjecture, (p18(X1,f6(c19))|p8(X1,f9(f13(f14(X1),f15(X1)),f16(X1)))|~p18(X1,f6(c25)))). % 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.39 # Begin printing tableau % 0.20/0.39 # Found 8 steps % 0.20/0.39 cnf(i_0_60, negated_conjecture, (p18(c24,f6(f7(c22,c23)))|~p18(c24,f6(c25))|~p5(f6(c25),f6(f7(c22,c23)))|~p8(c24,c24)), inference(start_rule)). % 0.20/0.39 cnf(i_0_78, plain, (p18(c24,f6(f7(c22,c23)))), inference(closure_rule, [i_0_42])). % 0.20/0.39 cnf(i_0_79, plain, (~p18(c24,f6(c25))), inference(closure_rule, [i_0_41])). % 0.20/0.39 cnf(i_0_81, plain, (~p8(c24,c24)), inference(closure_rule, [i_0_36])). % 0.20/0.39 cnf(i_0_80, plain, (~p5(f6(c25),f6(f7(c22,c23)))), inference(extension_rule, [i_0_53])). % 0.20/0.39 cnf(i_0_181, plain, (~p5(f6(f7(c22,c23)),f6(f7(c22,c23)))), inference(closure_rule, [i_0_37])). % 0.20/0.39 cnf(i_0_182, plain, (~p5(f6(f7(c22,c23)),f6(c25))), inference(extension_rule, [i_0_44])). % 0.20/0.39 cnf(i_0_232, plain, (~p4(f7(c22,c23),c25)), inference(etableau_closure_rule, [i_0_232, ...])). % 0.20/0.39 # End printing tableau % 0.20/0.39 # SZS output end % 0.20/0.39 # Branches closed with saturation will be marked with an "s" % 0.20/0.39 # Child (22651) has found a proof. % 0.20/0.39 % 0.20/0.39 # Proof search is over... % 0.20/0.39 # Freeing feature tree %------------------------------------------------------------------------------