%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN584-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 : n018.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:37 EDT 2022 % Result : Unsatisfiable 0.19s 0.44s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.11 % Problem : SYN584-1 : TPTP v8.1.0. Released v2.5.0. % 0.10/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.33 % Computer : n018.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Mon Jul 11 16:23:29 EDT 2022 % 0.13/0.33 % CPUTime : % 0.19/0.43 # No SInE strategy applied % 0.19/0.43 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.19/0.43 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.19/0.43 # % 0.19/0.43 # Number of axioms: 25 Number of unprocessed: 25 % 0.19/0.43 # Tableaux proof search. % 0.19/0.43 # APR header successfully linked. % 0.19/0.43 # Hello from C++ % 0.19/0.43 # The folding up rule is enabled... % 0.19/0.43 # Local unification is enabled... % 0.19/0.43 # Any saturation attempts will use folding labels... % 0.19/0.43 # 25 beginning clauses after preprocessing and clausification % 0.19/0.43 # Creating start rules for all 25 conjectures. % 0.19/0.43 # There are 25 start rule candidates: % 0.19/0.43 # Found 9 unit axioms. % 0.19/0.43 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.19/0.43 # 25 start rule tableaux created. % 0.19/0.43 # 16 extension rule candidate clauses % 0.19/0.43 # 9 unit axiom clauses % 0.19/0.43 % 0.19/0.43 # Requested 8, 32 cores available to the main process. % 0.19/0.44 # There were 2 total branch saturation attempts. % 0.19/0.44 # There were 0 of these attempts blocked. % 0.19/0.44 # There were 0 deferred branch saturation attempts. % 0.19/0.44 # There were 0 free duplicated saturations. % 0.19/0.44 # There were 2 total successful branch saturations. % 0.19/0.44 # There were 1 successful branch saturations in interreduction. % 0.19/0.44 # There were 0 successful branch saturations on the branch. % 0.19/0.44 # There were 1 successful branch saturations after the branch. % 0.19/0.44 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.44 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.44 # Begin clausification derivation % 0.19/0.44 % 0.19/0.44 # End clausification derivation % 0.19/0.44 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.44 cnf(i_0_26, negated_conjecture, (p12(X1,X1))). % 0.19/0.44 cnf(i_0_27, negated_conjecture, (p6(X1,X1))). % 0.19/0.44 cnf(i_0_28, negated_conjecture, (p5(X1,X1))). % 0.19/0.44 cnf(i_0_29, negated_conjecture, (p3(X1,X1))). % 0.19/0.44 cnf(i_0_30, negated_conjecture, (p2(X1,X1))). % 0.19/0.44 cnf(i_0_31, negated_conjecture, (p5(f11(X1),f11(X2))|~p5(X1,X2))). % 0.19/0.44 cnf(i_0_33, negated_conjecture, (p5(f10(X1),f10(X2))|~p5(X1,X2))). % 0.19/0.44 cnf(i_0_32, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))). % 0.19/0.44 cnf(i_0_34, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))). % 0.19/0.44 cnf(i_0_35, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.19/0.44 cnf(i_0_36, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.19/0.44 cnf(i_0_37, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.19/0.44 cnf(i_0_38, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.19/0.44 cnf(i_0_39, negated_conjecture, (p16(X1,X2)|~p12(X4,X1)|~p12(X3,X2)|~p16(X4,X3))). % 0.19/0.44 cnf(i_0_40, negated_conjecture, (p15(X1,X2)|~p12(X3,X1)|~p3(X4,X2)|~p15(X3,X4))). % 0.19/0.44 cnf(i_0_41, negated_conjecture, (p12(f13(X1,X2),f13(X3,X4))|~p12(X2,X4)|~p12(X1,X3))). % 0.19/0.44 cnf(i_0_45, negated_conjecture, (p12(f14(X1,X2),f14(X3,X4))|~p12(X2,X4)|~p2(X1,X3))). % 0.19/0.44 cnf(i_0_42, negated_conjecture, (p6(f8(X1,X2),f8(X3,X4))|~p5(X2,X4)|~p5(X1,X3))). % 0.19/0.44 cnf(i_0_43, negated_conjecture, (p5(f9(X1,X2),f9(X3,X4))|~p5(X2,X4)|~p5(X1,X3))). % 0.19/0.44 cnf(i_0_44, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p6(X2,X4)|~p5(X1,X3))). % 0.19/0.44 cnf(i_0_46, negated_conjecture, (p15(c22,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))))). % 0.19/0.44 cnf(i_0_47, negated_conjecture, (p15(c17,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))))). % 0.19/0.44 cnf(i_0_49, negated_conjecture, (~p16(X1,c17)|~p16(c22,X1)|~p15(X1,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))))). % 0.19/0.44 cnf(i_0_48, negated_conjecture, (p12(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),c22))). % 0.19/0.44 cnf(i_0_50, negated_conjecture, (~p15(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))))). % 0.19/0.44 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.44 # Begin printing tableau % 0.19/0.44 # Found 8 steps % 0.19/0.44 cnf(i_0_50, negated_conjecture, (~p15(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20)))))))), inference(start_rule)). % 0.19/0.44 cnf(i_0_51, plain, (~p15(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20)))))))), inference(extension_rule, [i_0_40])). % 0.19/0.44 cnf(i_0_126, plain, (~p12(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)))), inference(closure_rule, [i_0_26])). % 0.19/0.44 cnf(i_0_128, plain, (~p15(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20)))))))), inference(extension_rule, [i_0_40])). % 0.19/0.44 cnf(i_0_174, plain, (~p3(f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20)))))),f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20)))))))), inference(closure_rule, [i_0_29])). % 0.19/0.44 cnf(i_0_175, plain, (~p15(c17,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20)))))))), inference(closure_rule, [i_0_47])). % 0.19/0.44 cnf(i_0_127, plain, (~p3(f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20)))))),f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20)))))))), inference(etableau_closure_rule, [i_0_127, ...])). % 0.19/0.44 cnf(i_0_173, plain, (~p12(c17,f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)))), inference(etableau_closure_rule, [i_0_173, ...])). % 0.19/0.44 # End printing tableau % 0.19/0.44 # SZS output end % 0.19/0.44 # Branches closed with saturation will be marked with an "s" % 0.19/0.45 # There were 1 total branch saturation attempts. % 0.19/0.45 # There were 0 of these attempts blocked. % 0.19/0.45 # There were 0 deferred branch saturation attempts. % 0.19/0.45 # There were 0 free duplicated saturations. % 0.19/0.45 # There were 1 total successful branch saturations. % 0.19/0.45 # There were 0 successful branch saturations in interreduction. % 0.19/0.45 # There were 0 successful branch saturations on the branch. % 0.19/0.45 # There were 1 successful branch saturations after the branch. % 0.19/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.45 # Begin clausification derivation % 0.19/0.45 % 0.19/0.45 # End clausification derivation % 0.19/0.45 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.45 cnf(i_0_26, negated_conjecture, (p12(X1,X1))). % 0.19/0.45 cnf(i_0_27, negated_conjecture, (p6(X1,X1))). % 0.19/0.45 cnf(i_0_28, negated_conjecture, (p5(X1,X1))). % 0.19/0.45 cnf(i_0_29, negated_conjecture, (p3(X1,X1))). % 0.19/0.45 cnf(i_0_30, negated_conjecture, (p2(X1,X1))). % 0.19/0.45 cnf(i_0_31, negated_conjecture, (p5(f11(X1),f11(X2))|~p5(X1,X2))). % 0.19/0.45 cnf(i_0_33, negated_conjecture, (p5(f10(X1),f10(X2))|~p5(X1,X2))). % 0.19/0.45 cnf(i_0_32, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))). % 0.19/0.45 cnf(i_0_34, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))). % 0.19/0.45 cnf(i_0_35, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.19/0.45 cnf(i_0_36, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.19/0.45 cnf(i_0_37, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.19/0.45 cnf(i_0_38, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.19/0.45 cnf(i_0_39, negated_conjecture, (p16(X1,X2)|~p12(X4,X1)|~p12(X3,X2)|~p16(X4,X3))). % 0.19/0.45 cnf(i_0_40, negated_conjecture, (p15(X1,X2)|~p12(X3,X1)|~p3(X4,X2)|~p15(X3,X4))). % 0.19/0.45 cnf(i_0_41, negated_conjecture, (p12(f13(X1,X2),f13(X3,X4))|~p12(X2,X4)|~p12(X1,X3))). % 0.19/0.45 cnf(i_0_45, negated_conjecture, (p12(f14(X1,X2),f14(X3,X4))|~p12(X2,X4)|~p2(X1,X3))). % 0.19/0.45 cnf(i_0_42, negated_conjecture, (p6(f8(X1,X2),f8(X3,X4))|~p5(X2,X4)|~p5(X1,X3))). % 0.19/0.45 cnf(i_0_43, negated_conjecture, (p5(f9(X1,X2),f9(X3,X4))|~p5(X2,X4)|~p5(X1,X3))). % 0.19/0.45 cnf(i_0_44, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p6(X2,X4)|~p5(X1,X3))). % 0.19/0.45 cnf(i_0_46, negated_conjecture, (p15(c22,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))))). % 0.19/0.45 cnf(i_0_47, negated_conjecture, (p15(c17,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))))). % 0.19/0.45 cnf(i_0_49, negated_conjecture, (~p16(X1,c17)|~p16(c22,X1)|~p15(X1,f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))))). % 0.19/0.45 cnf(i_0_48, negated_conjecture, (p12(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),c22))). % 0.19/0.45 cnf(i_0_50, negated_conjecture, (~p15(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),f4(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))))))). % 0.19/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.45 # Begin printing tableau % 0.19/0.45 # Found 8 steps % 0.19/0.45 cnf(i_0_42, negated_conjecture, (p6(f8(X15,X16),f8(X15,X16))|~p5(X16,X16)|~p5(X15,X15)), inference(start_rule)). % 0.19/0.45 cnf(i_0_65, plain, (~p5(X16,X16)), inference(closure_rule, [i_0_28])). % 0.19/0.45 cnf(i_0_66, plain, (~p5(X15,X15)), inference(closure_rule, [i_0_28])). % 0.19/0.45 cnf(i_0_64, plain, (p6(f8(X15,X16),f8(X15,X16))), inference(extension_rule, [i_0_44])). % 0.19/0.45 cnf(i_0_112, plain, (~p5(X17,X17)), inference(closure_rule, [i_0_28])). % 0.19/0.45 cnf(i_0_110, plain, (p2(f7(X17,f8(X15,X16)),f7(X17,f8(X15,X16)))), inference(extension_rule, [i_0_45])). % 0.19/0.45 cnf(i_0_123, plain, (~p12(f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17)),c22)), inference(closure_rule, [i_0_48])). % 0.19/0.45 cnf(i_0_122, plain, (p12(f14(f7(X17,f8(X15,X16)),f13(c17,f14(f7(c18,f8(f9(c19,f10(f11(c20))),f9(c21,f10(f11(c20))))),c17))),f14(f7(X17,f8(X15,X16)),c22))), inference(etableau_closure_rule, [i_0_122, ...])). % 0.19/0.45 # End printing tableau % 0.19/0.45 # SZS output end % 0.19/0.45 # Branches closed with saturation will be marked with an "s" % 0.19/0.45 # There were 1 total branch saturation attempts. % 0.19/0.45 # There were 0 of these attempts blocked. % 0.19/0.45 # There were 0 deferred branch saturation attempts. % 0.19/0.45 # There were 0 free duplicated saturations. % 0.19/0.45 # There were 1 total successful branch saturations. % 0.19/0.45 # There were 0 successful branch saturations in interreduction. % 0.19/0.45 # There were 0 successful branch saturations on the branch. % 0.19/0.45 # There were 1 successful branch saturations after the branch. % 0.19/0.45 # Child (536) has found a proof. % 0.19/0.45 % 0.19/0.45 # Proof search is over... % 0.19/0.45 # Freeing feature tree %------------------------------------------------------------------------------