%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN591-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 : n025.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:40 EDT 2022 % Result : Unsatisfiable 0.14s 0.39s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN591-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.14/0.34 % Computer : n025.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Tue Jul 12 01:14:47 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN % 0.14/0.37 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 27 Number of unprocessed: 27 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.37 # The folding up rule is enabled... % 0.14/0.37 # Local unification is enabled... % 0.14/0.37 # Any saturation attempts will use folding labels... % 0.14/0.37 # 27 beginning clauses after preprocessing and clausification % 0.14/0.37 # Creating start rules for all 27 conjectures. % 0.14/0.37 # There are 27 start rule candidates: % 0.14/0.37 # Found 13 unit axioms. % 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.37 # 27 start rule tableaux created. % 0.14/0.37 # 14 extension rule candidate clauses % 0.14/0.37 # 13 unit axiom clauses % 0.14/0.37 % 0.14/0.37 # Requested 8, 32 cores available to the main process. % 0.14/0.39 # There were 3 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 3 total successful branch saturations. % 0.14/0.39 # There were 1 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 2 successful branch saturations after the branch. % 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_28, negated_conjecture, (p9(c14))). % 0.14/0.39 cnf(i_0_29, negated_conjecture, (p8(c13))). % 0.14/0.39 cnf(i_0_34, negated_conjecture, (p10(c13,c15))). % 0.14/0.39 cnf(i_0_35, negated_conjecture, (p10(c13,c17))). % 0.14/0.39 cnf(i_0_36, negated_conjecture, (p10(c13,c16))). % 0.14/0.39 cnf(i_0_33, negated_conjecture, (p10(c14,X1))). % 0.14/0.39 cnf(i_0_30, negated_conjecture, (p7(X1,X1))). % 0.14/0.39 cnf(i_0_31, negated_conjecture, (p2(X1,X1))). % 0.14/0.39 cnf(i_0_32, negated_conjecture, (p3(X1,X1))). % 0.14/0.39 cnf(i_0_38, negated_conjecture, (p12(c14,f4(c18,c17)))). % 0.14/0.39 cnf(i_0_37, negated_conjecture, (~p2(c15,c17))). % 0.14/0.39 cnf(i_0_39, negated_conjecture, (~p11(c13,f4(c17,f6(c18))))). % 0.14/0.39 cnf(i_0_40, negated_conjecture, (~p11(c13,f4(f6(c18),c17)))). % 0.14/0.39 cnf(i_0_43, negated_conjecture, (p11(c14,f4(c15,X1))|~p10(c13,X1))). % 0.14/0.39 cnf(i_0_49, negated_conjecture, (p2(f6(X1),f5(X1))|~p12(c14,f4(X1,c17)))). % 0.14/0.39 cnf(i_0_54, negated_conjecture, (p11(c13,f4(f5(X1),c17))|p11(c13,f4(c17,f5(X1)))|~p12(c14,f4(X1,c17)))). % 0.14/0.39 cnf(i_0_42, negated_conjecture, (p9(X1)|~p7(X2,X1)|~p9(X2))). % 0.14/0.39 cnf(i_0_45, negated_conjecture, (p2(f6(X1),f6(X2))|~p2(X1,X2))). % 0.14/0.39 cnf(i_0_41, negated_conjecture, (p8(X1)|~p7(X2,X1)|~p8(X2))). % 0.14/0.39 cnf(i_0_46, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.14/0.39 cnf(i_0_47, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.14/0.39 cnf(i_0_48, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.14/0.39 cnf(i_0_44, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 0.14/0.39 cnf(i_0_53, negated_conjecture, (p3(f4(X1,X2),f4(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.14/0.39 cnf(i_0_50, negated_conjecture, (p10(X1,X2)|~p10(X3,X4)|~p2(X4,X2)|~p7(X3,X1))). % 0.14/0.39 cnf(i_0_51, negated_conjecture, (p12(X1,X2)|~p12(X3,X4)|~p3(X4,X2)|~p7(X3,X1))). % 0.14/0.39 cnf(i_0_52, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p3(X4,X2)|~p7(X3,X1))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 10 steps % 0.14/0.39 cnf(i_0_40, negated_conjecture, (~p11(c13,f4(f6(c18),c17))), inference(start_rule)). % 0.14/0.39 cnf(i_0_96, plain, (~p11(c13,f4(f6(c18),c17))), inference(extension_rule, [i_0_52])). % 0.14/0.39 cnf(i_0_339, plain, (~p3(f4(f6(c18),c17),f4(f6(c18),c17))), inference(closure_rule, [i_0_32])). % 0.14/0.39 cnf(i_0_338, plain, (~p11(c13,f4(f6(c18),c17))), inference(extension_rule, [i_0_52])). % 0.14/0.39 cnf(i_0_381, plain, (~p7(c13,c13)), inference(closure_rule, [i_0_30])). % 0.14/0.39 cnf(i_0_379, plain, (~p11(c13,f4(f5(c18),c17))), inference(extension_rule, [i_0_54])). % 0.14/0.39 cnf(i_0_411, plain, (~p12(c14,f4(c18,c17))), inference(closure_rule, [i_0_38])). % 0.14/0.39 cnf(i_0_340, plain, (~p7(c13,c13)), inference(etableau_closure_rule, [i_0_340, ...])). % 0.14/0.39 cnf(i_0_380, plain, (~p3(f4(f5(c18),c17),f4(f6(c18),c17))), inference(etableau_closure_rule, [i_0_380, ...])). % 0.14/0.39 cnf(i_0_410, plain, (p11(c13,f4(c17,f5(c18)))), inference(etableau_closure_rule, [i_0_410, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # There were 2 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 2 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 2 successful branch saturations after the branch. % 0.14/0.39 # There were 2 total branch saturation attempts. % 0.14/0.39 # There were 0 of these attempts blocked. % 0.14/0.39 # There were 0 deferred branch saturation attempts. % 0.14/0.39 # There were 0 free duplicated saturations. % 0.14/0.39 # There were 2 total successful branch saturations. % 0.14/0.39 # There were 0 successful branch saturations in interreduction. % 0.14/0.39 # There were 0 successful branch saturations on the branch. % 0.14/0.39 # There were 2 successful branch saturations after the branch. % 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_28, negated_conjecture, (p9(c14))). % 0.14/0.39 cnf(i_0_29, negated_conjecture, (p8(c13))). % 0.14/0.39 cnf(i_0_34, negated_conjecture, (p10(c13,c15))). % 0.14/0.39 cnf(i_0_35, negated_conjecture, (p10(c13,c17))). % 0.14/0.39 cnf(i_0_36, negated_conjecture, (p10(c13,c16))). % 0.14/0.39 cnf(i_0_33, negated_conjecture, (p10(c14,X1))). % 0.14/0.39 cnf(i_0_30, negated_conjecture, (p7(X1,X1))). % 0.14/0.39 cnf(i_0_31, negated_conjecture, (p2(X1,X1))). % 0.14/0.39 cnf(i_0_32, negated_conjecture, (p3(X1,X1))). % 0.14/0.39 cnf(i_0_38, negated_conjecture, (p12(c14,f4(c18,c17)))). % 0.14/0.39 cnf(i_0_37, negated_conjecture, (~p2(c15,c17))). % 0.14/0.39 cnf(i_0_39, negated_conjecture, (~p11(c13,f4(c17,f6(c18))))). % 0.14/0.39 cnf(i_0_40, negated_conjecture, (~p11(c13,f4(f6(c18),c17)))). % 0.14/0.39 cnf(i_0_43, negated_conjecture, (p11(c14,f4(c15,X1))|~p10(c13,X1))). % 0.14/0.39 cnf(i_0_49, negated_conjecture, (p2(f6(X1),f5(X1))|~p12(c14,f4(X1,c17)))). % 0.14/0.39 cnf(i_0_54, negated_conjecture, (p11(c13,f4(f5(X1),c17))|p11(c13,f4(c17,f5(X1)))|~p12(c14,f4(X1,c17)))). % 0.14/0.39 cnf(i_0_42, negated_conjecture, (p9(X1)|~p7(X2,X1)|~p9(X2))). % 0.14/0.39 cnf(i_0_45, negated_conjecture, (p2(f6(X1),f6(X2))|~p2(X1,X2))). % 0.14/0.39 cnf(i_0_41, negated_conjecture, (p8(X1)|~p7(X2,X1)|~p8(X2))). % 0.14/0.39 cnf(i_0_46, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.14/0.39 cnf(i_0_47, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.14/0.39 cnf(i_0_48, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.14/0.39 cnf(i_0_44, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 0.14/0.39 cnf(i_0_53, negated_conjecture, (p3(f4(X1,X2),f4(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.14/0.39 cnf(i_0_50, negated_conjecture, (p10(X1,X2)|~p10(X3,X4)|~p2(X4,X2)|~p7(X3,X1))). % 0.14/0.39 cnf(i_0_51, negated_conjecture, (p12(X1,X2)|~p12(X3,X4)|~p3(X4,X2)|~p7(X3,X1))). % 0.14/0.39 cnf(i_0_52, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p3(X4,X2)|~p7(X3,X1))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 14 steps % 0.14/0.39 cnf(i_0_53, negated_conjecture, (p3(f4(f5(c18),c17),f4(f5(c18),c17))|~p2(c17,c17)|~p2(f5(c18),f5(c18))), inference(start_rule)). % 0.14/0.39 cnf(i_0_68, plain, (~p2(c17,c17)), inference(closure_rule, [i_0_31])). % 0.14/0.39 cnf(i_0_69, plain, (~p2(f5(c18),f5(c18))), inference(closure_rule, [i_0_31])). % 0.14/0.39 cnf(i_0_67, plain, (p3(f4(f5(c18),c17),f4(f5(c18),c17))), inference(extension_rule, [i_0_52])). % 0.14/0.39 cnf(i_0_110, plain, (~p11(c13,f4(f5(c18),c17))), inference(extension_rule, [i_0_54])). % 0.14/0.39 cnf(i_0_473, plain, (~p12(c14,f4(c18,c17))), inference(closure_rule, [i_0_38])). % 0.14/0.39 cnf(i_0_472, plain, (p11(c13,f4(c17,f5(c18)))), inference(etableau_closure_rule, [i_0_472, ...])). % 0.14/0.39 cnf(i_0_112, plain, (~p7(c13,c13)), inference(extension_rule, [i_0_46])). % 0.14/0.39 cnf(i_0_924, plain, (~p7(c13,c13)), inference(closure_rule, [i_0_30])). % 0.14/0.39 cnf(i_0_925, plain, (~p7(c13,c13)), inference(closure_rule, [i_0_30])). % 0.14/0.39 cnf(i_0_109, plain, (p11(c13,f4(f5(c18),c17))), inference(extension_rule, [i_0_52])). % 0.14/0.39 cnf(i_0_957, plain, (p11(c13,f4(f6(c18),c17))), inference(closure_rule, [i_0_40])). % 0.14/0.39 cnf(i_0_960, plain, (~p7(c13,c13)), inference(closure_rule, [i_0_30])). % 0.14/0.39 cnf(i_0_959, plain, (~p3(f4(f5(c18),c17),f4(f6(c18),c17))), inference(etableau_closure_rule, [i_0_959, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # Child (14425) has found a proof. % 0.14/0.39 % 0.14/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.39 # Begin clausification derivation % 0.14/0.39 % 0.14/0.39 # End clausification derivation % 0.14/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.39 cnf(i_0_28, negated_conjecture, (p9(c14))). % 0.14/0.39 cnf(i_0_29, negated_conjecture, (p8(c13))). % 0.14/0.39 cnf(i_0_34, negated_conjecture, (p10(c13,c15))). % 0.14/0.39 cnf(i_0_35, negated_conjecture, (p10(c13,c17))). % 0.14/0.39 cnf(i_0_36, negated_conjecture, (p10(c13,c16))). % 0.14/0.39 cnf(i_0_33, negated_conjecture, (p10(c14,X1))). % 0.14/0.39 cnf(i_0_30, negated_conjecture, (p7(X1,X1))). % 0.14/0.39 cnf(i_0_31, negated_conjecture, (p2(X1,X1))). % 0.14/0.39 cnf(i_0_32, negated_conjecture, (p3(X1,X1))). % 0.14/0.39 cnf(i_0_38, negated_conjecture, (p12(c14,f4(c18,c17)))). % 0.14/0.39 cnf(i_0_37, negated_conjecture, (~p2(c15,c17))). % 0.14/0.39 cnf(i_0_39, negated_conjecture, (~p11(c13,f4(c17,f6(c18))))). % 0.14/0.39 cnf(i_0_40, negated_conjecture, (~p11(c13,f4(f6(c18),c17)))). % 0.14/0.39 cnf(i_0_43, negated_conjecture, (p11(c14,f4(c15,X1))|~p10(c13,X1))). % 0.14/0.39 cnf(i_0_49, negated_conjecture, (p2(f6(X1),f5(X1))|~p12(c14,f4(X1,c17)))). % 0.14/0.39 cnf(i_0_54, negated_conjecture, (p11(c13,f4(f5(X1),c17))|p11(c13,f4(c17,f5(X1)))|~p12(c14,f4(X1,c17)))). % 0.14/0.39 cnf(i_0_42, negated_conjecture, (p9(X1)|~p7(X2,X1)|~p9(X2))). % 0.14/0.39 cnf(i_0_45, negated_conjecture, (p2(f6(X1),f6(X2))|~p2(X1,X2))). % 0.14/0.39 cnf(i_0_41, negated_conjecture, (p8(X1)|~p7(X2,X1)|~p8(X2))). % 0.14/0.39 cnf(i_0_46, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.14/0.39 cnf(i_0_47, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.14/0.39 cnf(i_0_48, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.14/0.39 cnf(i_0_44, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))). % 0.14/0.39 cnf(i_0_53, negated_conjecture, (p3(f4(X1,X2),f4(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.14/0.39 cnf(i_0_50, negated_conjecture, (p10(X1,X2)|~p10(X3,X4)|~p2(X4,X2)|~p7(X3,X1))). % 0.14/0.39 cnf(i_0_51, negated_conjecture, (p12(X1,X2)|~p12(X3,X4)|~p3(X4,X2)|~p7(X3,X1))). % 0.14/0.39 cnf(i_0_52, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p3(X4,X2)|~p7(X3,X1))). % 0.14/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.39 # Begin printing tableau % 0.14/0.39 # Found 14 steps % 0.14/0.39 cnf(i_0_48, negated_conjecture, (p3(f4(f5(c18),c17),f4(f5(c18),c17))|~p3(f4(f5(c18),c17),f4(f5(c18),c17))|~p3(f4(f5(c18),c17),f4(f5(c18),c17))), inference(start_rule)). % 0.14/0.39 cnf(i_0_73, plain, (~p3(f4(f5(c18),c17),f4(f5(c18),c17))), inference(closure_rule, [i_0_32])). % 0.14/0.39 cnf(i_0_74, plain, (~p3(f4(f5(c18),c17),f4(f5(c18),c17))), inference(closure_rule, [i_0_32])). % 0.14/0.39 cnf(i_0_72, plain, (p3(f4(f5(c18),c17),f4(f5(c18),c17))), inference(extension_rule, [i_0_52])). % 0.14/0.39 cnf(i_0_110, plain, (~p11(c13,f4(f5(c18),c17))), inference(extension_rule, [i_0_54])). % 0.14/0.39 cnf(i_0_473, plain, (~p12(c14,f4(c18,c17))), inference(closure_rule, [i_0_38])). % 0.14/0.39 cnf(i_0_472, plain, (p11(c13,f4(c17,f5(c18)))), inference(etableau_closure_rule, [i_0_472, ...])). % 0.14/0.39 cnf(i_0_112, plain, (~p7(c13,c13)), inference(extension_rule, [i_0_46])). % 0.14/0.39 cnf(i_0_926, plain, (~p7(c13,c13)), inference(closure_rule, [i_0_30])). % 0.14/0.39 cnf(i_0_927, plain, (~p7(c13,c13)), inference(closure_rule, [i_0_30])). % 0.14/0.39 cnf(i_0_109, plain, (p11(c13,f4(f5(c18),c17))), inference(extension_rule, [i_0_52])). % 0.14/0.39 cnf(i_0_959, plain, (p11(c13,f4(f6(c18),c17))), inference(closure_rule, [i_0_40])). % 0.14/0.39 cnf(i_0_962, plain, (~p7(c13,c13)), inference(closure_rule, [i_0_30])). % 0.14/0.39 cnf(i_0_961, plain, (~p3(f4(f5(c18),c17),f4(f6(c18),c17))), inference(etableau_closure_rule, [i_0_961, ...])). % 0.14/0.39 # End printing tableau % 0.14/0.39 # SZS output end % 0.14/0.39 # Branches closed with saturation will be marked with an "s" % 0.14/0.39 # Proof search is over... % 0.14/0.39 # Freeing feature tree %------------------------------------------------------------------------------