%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN594-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 : n016.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:41 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.08/0.13 % Problem : SYN594-1 : TPTP v8.1.0. Released v2.5.0. % 0.08/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.36 % Computer : n016.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Mon Jul 11 22:23:43 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: 27 Number of unprocessed: 27 % 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 # 27 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 27 conjectures. % 0.14/0.39 # There are 27 start rule candidates: % 0.14/0.39 # Found 8 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 27 start rule tableaux created. % 0.14/0.39 # 19 extension rule candidate clauses % 0.14/0.39 # 8 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_31, negated_conjecture, (p14(c18,f3(f4(f5(c17)))))). % 0.14/0.40 cnf(i_0_34, negated_conjecture, (p14(c19,f6(f3(f4(f5(c17))),c16)))). % 0.14/0.40 cnf(i_0_43, negated_conjecture, (p15(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19))). % 0.14/0.40 cnf(i_0_28, negated_conjecture, (p2(X1,X1))). % 0.14/0.40 cnf(i_0_29, negated_conjecture, (p7(X1,X1))). % 0.14/0.40 cnf(i_0_52, negated_conjecture, (p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))))). % 0.14/0.40 cnf(i_0_30, negated_conjecture, (~p2(c16,f3(c17)))). % 0.14/0.40 cnf(i_0_44, negated_conjecture, (~p2(c19,f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17))))))). % 0.14/0.40 cnf(i_0_33, negated_conjecture, (~p14(X1,X2)|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_32, negated_conjecture, (p15(X1,X2)|~p14(X1,X2))). % 0.14/0.40 cnf(i_0_40, negated_conjecture, (p14(X1,X2)|p2(X1,X2)|~p15(X1,X2))). % 0.14/0.40 cnf(i_0_42, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.14/0.40 cnf(i_0_36, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_38, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_37, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_35, negated_conjecture, (p7(f12(X1),f12(X2))|~p7(X1,X2))). % 0.14/0.40 cnf(i_0_39, negated_conjecture, (p7(f11(X1),f11(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_41, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.14/0.40 cnf(i_0_45, negated_conjecture, (p14(X1,X2)|~p14(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.14/0.40 cnf(i_0_46, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.14/0.40 cnf(i_0_51, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.14/0.40 cnf(i_0_47, negated_conjecture, (p2(f13(X1,X2),f13(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.14/0.40 cnf(i_0_48, negated_conjecture, (p7(f9(X1,X2),f9(X3,X4))|~p7(X2,X4)|~p7(X1,X3))). % 0.14/0.40 cnf(i_0_53, negated_conjecture, (~p15(X1,f6(f3(f4(f5(c17))),c16))|~p14(X2,f3(f4(f5(c17))))|~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),X2),f8(f10(f11(f3(f4(f5(c17)))),X3),f9(f11(X1),f10(f11(f3(f4(f5(c17)))),c22)))))|~p2(X3,f3(c17)))). % 0.14/0.40 cnf(i_0_54, negated_conjecture, (~p15(X1,f6(f3(f4(f5(c17))),c16))|~p14(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),X1)|~p14(X2,f3(f4(f5(c17))))|~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),X2),f8(f10(f11(f3(f4(f5(c17)))),X3),f9(f11(X1),f10(f11(f3(f4(f5(c17)))),c22))))))). % 0.14/0.40 cnf(i_0_49, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p7(X2,X4)|~p7(X1,X3))). % 0.14/0.40 cnf(i_0_50, negated_conjecture, (p7(f10(X1,X2),f10(X3,X4))|~p7(X1,X3)|~p2(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 8 steps % 0.14/0.40 cnf(i_0_47, negated_conjecture, (p2(f13(X10,X9),f13(X10,X9))|~p2(X9,X9)|~p2(X10,X10)), inference(start_rule)). % 0.14/0.40 cnf(i_0_73, plain, (~p2(X9,X9)), inference(closure_rule, [i_0_28])). % 0.14/0.40 cnf(i_0_74, plain, (~p2(X10,X10)), inference(closure_rule, [i_0_28])). % 0.14/0.40 cnf(i_0_72, plain, (p2(f13(X10,X9),f13(X10,X9))), inference(extension_rule, [i_0_50])). % 0.14/0.40 cnf(i_0_118, plain, (~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))))), inference(closure_rule, [i_0_52])). % 0.14/0.40 cnf(i_0_117, plain, (p7(f10(c20,f13(X10,X9)),f10(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f13(X10,X9)))), inference(extension_rule, [i_0_49])). % 0.14/0.40 cnf(i_0_122, plain, (~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))))), inference(closure_rule, [i_0_52])). % 0.14/0.40 cnf(i_0_120, plain, (p7(f8(c20,f10(c20,f13(X10,X9))),f8(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f10(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f13(X10,X9))))), inference(etableau_closure_rule, [i_0_120, ...])). % 0.14/0.40 # End printing tableau % 0.14/0.40 # SZS output end % 0.14/0.40 # Branches closed with saturation will # 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_31, negated_conjecture, (p14(c18,f3(f4(f5(c17)))))). % 0.14/0.40 cnf(i_0_34, negated_conjecture, (p14(c19,f6(f3(f4(f5(c17))),c16)))). % 0.14/0.40 cnf(i_0_43, negated_conjecture, (p15(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19))). % 0.14/0.40 cnf(i_0_28, negated_conjecture, (p2(X1,X1))). % 0.14/0.40 cnf(i_0_29, negated_conjecture, (p7(X1,X1))). % 0.14/0.40 cnf(i_0_52, negated_conjecture, (p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))))). % 0.14/0.40 cnf(i_0_30, negated_conjecture, (~p2(c16,f3(c17)))). % 0.14/0.40 cnf(i_0_44, negated_conjecture, (~p2(c19,f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17))))))). % 0.14/0.40 cnf(i_0_33, negated_conjecture, (~p14(X1,X2)|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_32, negated_conjecture, (p15(X1,X2)|~p14(X1,X2))). % 0.14/0.40 cnf(i_0_40, negated_conjecture, (p14(X1,X2)|p2(X1,X2)|~p15(X1,X2))). % 0.14/0.40 cnf(i_0_42, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.14/0.40 cnf(i_0_36, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_38, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_37, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_35, negated_conjecture, (p7(f12(X1),f12(X2))|~p7(X1,X2))). % 0.14/0.40 cnf(i_0_39, negated_conjecture, (p7(f11(X1),f11(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_41, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.14/0.40 cnf(i_0_45, negated_conjecture, (p14(X1,X2)|~p14(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.14/0.40 cnf(i_0_46, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.14/0.40 cnf(i_0_51, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.14/0.40 cnf(i_0_47, negated_conjecture, (p2(f13(X1,X2),f13(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.14/0.40 cnf(i_0_48, negated_conjecture, (p7(f9(X1,X2),f9(X3,X4))|~p7(X2,X4)|~p7(X1,X3))). % 0.14/0.40 cnf(i_0_53, negated_conjecture, (~p15(X1,f6(f3(f4(f5(c17))),c16))|~p14(X2,f3(f4(f5(c17))))|~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),X2),f8(f10(f11(f3(f4(f5(c17)))),X3),f9(f11(X1),f10(f11(f3(f4(f5(c17)))),c22)))))|~p2(X3,f3(c17)))). % 0.14/0.40 cnf(i_0_54, negated_conjecture, (~p15(X1,f6(f3(f4(f5(c17))),c16))|~p14(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),X1)|~p14(X2,f3(f4(f5(c17))))|~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),X2),f8(f10(f11(f3(f4(f5(c17)))),X3),f9(f11(X1),f10(f11(f3(f4(f5(c17)))),c22))))))). % 0.14/0.40 cnf(i_0_49, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p7(X2,X4)|~p7(X1,X3))). % 0.14/0.40 cnf(i_0_50, negated_conjecture, (p7(f10(X1,X2),f10(X3,X4))|~p7(X1,X3)|~p2(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 8 steps % 0.14/0.40 cnf(i_0_51, negated_conjecture, (p2(f6(X10,X9),f6(X10,X9))|~p2(X9,X9)|~p2(X10,X10)), inference(start_rule)). % 0.14/0.40 cnf(i_0_76, plain, (~p2(X9,X9)), inference(closure_rule, [i_0_28])). % 0.14/0.40 cnf(i_0_77, plain, (~p2(X10,X10)), inference(closure_rule, [i_0_28])). % 0.14/0.40 cnf(i_0_75, plain, (p2(f6(X10,X9),f6(X10,X9))), inference(extension_rule, [i_0_50])). % 0.14/0.40 cnf(i_0_118, plain, (~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))))), inference(closure_rule, [i_0_52])). % 0.14/0.40 cnf(i_0_117, plain, (p7(f10(c20,f6(X10,X9)),f10(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f6(X10,X9)))), inference(extension_rule, [i_0_49])). % 0.14/0.40 cnf(i_0_122, plain, (~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))))), inference(closure_rule, [i_0_52])). % 0.14/0.40 cnf(i_0_120, plain, (p7(f8(c20,f10(c20,f6(X10,X9))),f8(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f10(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f6(X10,X9))))), inference(etableau_closure_rule, [i_0_120, ...])). % 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 # 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_31, negated_conjecture, (p14(c18,f3(f4(f5(c17)))))). % 0.14/0.40 cnf(i_0_34, negated_conjecture, (p14(c19,f6(f3(f4(f5(c17))),c16)))). % 0.14/0.40 cnf(i_0_43, negated_conjecture, (p15(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19))). % 0.14/0.40 cnf(i_0_28, negated_conjecture, (p2(X1,X1))). % 0.14/0.40 cnf(i_0_29, negated_conjecture, (p7(X1,X1))). % 0.14/0.40 cnf(i_0_52, negated_conjecture, (p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))))). % 0.14/0.40 cnf(i_0_30, negated_conjecture, (~p2(c16,f3(c17)))). % 0.14/0.40 cnf(i_0_44, negated_conjecture, (~p2(c19,f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17))))))). % 0.14/0.40 cnf(i_0_33, negated_conjecture, (~p14(X1,X2)|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_32, negated_conjecture, (p15(X1,X2)|~p14(X1,X2))). % 0.14/0.40 cnf(i_0_40, negated_conjecture, (p14(X1,X2)|p2(X1,X2)|~p15(X1,X2))). % 0.14/0.40 cnf(i_0_42, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.14/0.40 cnf(i_0_36, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_38, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_37, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_35, negated_conjecture, (p7(f12(X1),f12(X2))|~p7(X1,X2))). % 0.14/0.40 cnf(i_0_39, negated_conjecture, (p7(f11(X1),f11(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_41, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.14/0.40 cnf(i_0_45, negated_conjecture, (p14(X1,X2)|~p14(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.14/0.40 cnf(i_0_46, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.14/0.40 cnf(i_0_51, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.14/0.40 cnf(i_0_47, negated_conjecture, (p2(f13(X1,X2),f13(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.14/0.40 cnf(i_0_48, negated_conjecture, (p7(f9(X1,X2),f9(X3,X4))|~p7(X2,X4)|~p7(X1,X3))). % 0.14/0.40 cnf(i_0_53, negated_conjecture, (~p15(X1,f6(f3(f4(f5(c17))),c16))|~p14(X2,f3(f4(f5(c17))))|~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),X2),f8(f10(f11(f3(f4(f5(c17)))),X3),f9(f11(X1),f10(f11(f3(f4(f5(c17)))),c22)))))|~p2(X3,f3(c17)))). % 0.14/0.40 cnf(i_0_54, negated_conjecture, (~p15(X1,f6(f3(f4(f5(c17))),c16))|~p14(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),X1)|~p14(X2,f3(f4(f5(c17))))|~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),X2),f8(f10(f11(f3(f4(f5(c17)))),X3),f9(f11(X1),f10(f11(f3(f4(f5(c17)))),c22))))))). % 0.14/0.40 cnf(i_0_49, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p7(X2,X4)|~p7(X1,X3))). % 0.14/0.40 cnf(i_0_50, negated_conjecture, (p7(f10(X1,X2),f10(X3,X4))|~p7(X1,X3)|~p2(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 8 steps % 0.14/0.40 cnf(i_0_50, negated_conjecture, (p7(f10(c20,X12),f10(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),X12))|~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))))|~p2(X12,X12)), inference(start_rule)). % 0.14/0.40 cnf(i_0_56, plain, (~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))))), inference(closure_rule, [i_0_52])). % 0.14/0.40 cnf(i_0_57, plain, (~p2(X12,X12)), inference(closure_rule, [i_0_28])). % 0.14/0.40 cnf(i_0_55, plain, (p7(f10(c20,X12),f10(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),X12))), inference(extension_rule, [i_0_50])). % 0.14/0.40 cnf(i_0_119, plain, (~p2(X11,X11)), inference(closure_rule, [i_0_28])). % 0.14/0.40 cnf(i_0_117, plain, (p7(f10(f10(c20,X12),X11),f10(f10(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),X12),X11))), inference(extension_rule, [i_0_49])). % 0.14/0.40 cnf(i_0_122, plain, (~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))))), inference(closure_rule, [i_0_52])). % 0.14/0.40 cnf(i_0_120, plain, (p7(f8(c20,f10(f10(c20,X12),X11)),f8(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f10(f10(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),X12),X11)))), inference(etableau_closure_rule, [i_0_120, ...])). % 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 # 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 be marked with an "s" % 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_31, negated_conjecture, (p14(c18,f3(f4(f5(c17)))))). % 0.14/0.40 cnf(i_0_34, negated_conjecture, (p14(c19,f6(f3(f4(f5(c17))),c16)))). % 0.14/0.40 cnf(i_0_43, negated_conjecture, (p15(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),c19))). % 0.14/0.40 cnf(i_0_28, negated_conjecture, (p2(X1,X1))). % 0.14/0.40 cnf(i_0_29, negated_conjecture, (p7(X1,X1))). % 0.14/0.40 cnf(i_0_52, negated_conjecture, (p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))))). % 0.14/0.40 cnf(i_0_30, negated_conjecture, (~p2(c16,f3(c17)))). % 0.14/0.40 cnf(i_0_44, negated_conjecture, (~p2(c19,f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17))))))). % 0.14/0.40 cnf(i_0_33, negated_conjecture, (~p14(X1,X2)|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_32, negated_conjecture, (p15(X1,X2)|~p14(X1,X2))). % 0.14/0.40 cnf(i_0_40, negated_conjecture, (p14(X1,X2)|p2(X1,X2)|~p15(X1,X2))). % 0.14/0.40 cnf(i_0_42, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.14/0.40 cnf(i_0_36, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_38, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_37, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_35, negated_conjecture, (p7(f12(X1),f12(X2))|~p7(X1,X2))). % 0.14/0.40 cnf(i_0_39, negated_conjecture, (p7(f11(X1),f11(X2))|~p2(X1,X2))). % 0.14/0.40 cnf(i_0_41, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.14/0.40 cnf(i_0_45, negated_conjecture, (p14(X1,X2)|~p14(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.14/0.40 cnf(i_0_46, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p2(X4,X2)|~p2(X3,X1))). % 0.14/0.40 cnf(i_0_51, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.14/0.40 cnf(i_0_47, negated_conjecture, (p2(f13(X1,X2),f13(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.14/0.40 cnf(i_0_48, negated_conjecture, (p7(f9(X1,X2),f9(X3,X4))|~p7(X2,X4)|~p7(X1,X3))). % 0.14/0.40 cnf(i_0_53, negated_conjecture, (~p15(X1,f6(f3(f4(f5(c17))),c16))|~p14(X2,f3(f4(f5(c17))))|~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),X2),f8(f10(f11(f3(f4(f5(c17)))),X3),f9(f11(X1),f10(f11(f3(f4(f5(c17)))),c22)))))|~p2(X3,f3(c17)))). % 0.14/0.40 cnf(i_0_54, negated_conjecture, (~p15(X1,f6(f3(f4(f5(c17))),c16))|~p14(f6(f3(f4(f5(c17))),f13(c16,f3(f5(c17)))),X1)|~p14(X2,f3(f4(f5(c17))))|~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),X2),f8(f10(f11(f3(f4(f5(c17)))),X3),f9(f11(X1),f10(f11(f3(f4(f5(c17)))),c22))))))). % 0.14/0.40 cnf(i_0_49, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p7(X2,X4)|~p7(X1,X3))). % 0.14/0.40 cnf(i_0_50, negated_conjecture, (p7(f10(X1,X2),f10(X3,X4))|~p7(X1,X3)|~p2(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 8 steps % 0.14/0.40 cnf(i_0_49, negated_conjecture, (p7(f8(c20,c20),f8(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))))|~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))))|~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))))), inference(start_rule)). % 0.14/0.40 cnf(i_0_59, plain, (~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))))), inference(closure_rule, [i_0_52])). % 0.14/0.40 cnf(i_0_60, plain, (~p7(c20,f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))))), inference(closure_rule, [i_0_52])). % 0.14/0.40 cnf(i_0_58, plain, (p7(f8(c20,c20),f8(f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22)))),f8(f10(f12(f11(f3(f5(c17)))),c18),f8(f10(f11(f3(f4(f5(c17)))),c21),f9(f11(c19),f10(f11(f3(f4(f5(c17)))),c22))))))), inference(extension_rule, [i_0_50])). % 0.14/0.40 cnf(i_0_119, plain, (~p2(X10,X10)), inference(closure_rule, [i_0_28])). % 0.14/0.40 cnf(i_0_117, plain, (p7(f10(f8(c20,c20),X10),f10(f8(f8(f10(f12(f11# Child (24849) has found a proof. % 0.14/0.40 % 0.14/0.40 # Proof search is over... % 0.14/0.40 # Freeing feature tree %------------------------------------------------------------------------------