%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN560-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 : n011.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:28 EDT 2022 % Result : Unsatisfiable 0.18s 0.38s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : SYN560-1 : TPTP v8.1.0. Released v2.5.0. % 0.07/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n011.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jul 11 15:50:57 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 15 Number of unprocessed: 15 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 15 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 15 conjectures. % 0.12/0.36 # There are 15 start rule candidates: % 0.12/0.36 # Found 6 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 15 start rule tableaux created. % 0.12/0.36 # 9 extension rule candidate clauses % 0.12/0.36 # 6 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 0.18/0.38 # There were 1 total branch saturation attempts. % 0.18/0.38 # There were 0 of these attempts blocked. % 0.18/0.38 # There were 0 deferred branch saturation attempts. % 0.18/0.38 # There were 0 free duplicated saturations. % 0.18/0.38 # There were 1 total successful branch saturations. % 0.18/0.38 # There were 0 successful branch saturations in interreduction. % 0.18/0.38 # There were 0 successful branch saturations on the branch. % 0.18/0.38 # There were 1 successful branch saturations after the branch. % 0.18/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.38 # Begin clausification derivation % 0.18/0.38 % 0.18/0.38 # End clausification derivation % 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.38 cnf(i_0_18, negated_conjecture, (p2(c11,f4(f5(c12,c13))))). % 0.18/0.38 cnf(i_0_25, negated_conjecture, (p8(f6(c9,f4(c12)),f6(c9,f4(f5(c12,c14)))))). % 0.18/0.38 cnf(i_0_16, negated_conjecture, (p2(X1,X1))). % 0.18/0.38 cnf(i_0_19, negated_conjecture, (p2(f4(X1),f5(X1,f3(f7(c10)))))). % 0.18/0.38 cnf(i_0_17, negated_conjecture, (~p2(c9,f3(c10)))). % 0.18/0.38 cnf(i_0_26, negated_conjecture, (~p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14))))))). % 0.18/0.38 cnf(i_0_21, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.18/0.38 cnf(i_0_23, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.18/0.38 cnf(i_0_24, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X1,X3))). % 0.18/0.38 cnf(i_0_22, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))). % 0.18/0.38 cnf(i_0_20, negated_conjecture, (p2(f7(X1),f7(X2))|~p2(X1,X2))). % 0.18/0.38 cnf(i_0_28, negated_conjecture, (p2(f5(X1,X2),f5(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.18/0.38 cnf(i_0_30, negated_conjecture, (p8(f6(X1,X2),f6(X1,f5(X2,f3(f7(c10)))))|p2(X1,f3(c10)))). % 0.18/0.38 cnf(i_0_29, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.18/0.38 cnf(i_0_27, negated_conjecture, (p8(X1,X2)|~p8(X3,X4)|~p2(X3,X1)|~p2(X4,X2))). % 0.18/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.38 # Begin printing tableau % 0.18/0.38 # Found 7 steps % 0.18/0.38 cnf(i_0_23, negated_conjecture, (p2(c9,f3(c10))|~p2(f3(c10),f3(c10))|~p2(f3(c10),c9)), inference(start_rule)). % 0.18/0.38 cnf(i_0_50, plain, (p2(c9,f3(c10))), inference(closure_rule, [i_0_17])). % 0.18/0.38 cnf(i_0_51, plain, (~p2(f3(c10),f3(c10))), inference(closure_rule, [i_0_16])). % 0.18/0.38 cnf(i_0_52, plain, (~p2(f3(c10),c9)), inference(extension_rule, [i_0_23])). % 0.18/0.38 cnf(i_0_81, plain, (~p2(c9,c9)), inference(closure_rule, [i_0_16])). % 0.18/0.38 cnf(i_0_82, plain, (~p2(c9,f3(c10))), inference(extension_rule, [i_0_30])). % 0.18/0.38 cnf(i_0_90, plain, (p8(f6(c9,X4),f6(c9,f5(X4,f3(f7(c10)))))), inference(etableau_closure_rule, [i_0_90, ...])). % 0.18/0.38 # End printing tableau % 0.18/0.38 # SZS output end % 0.18/0.38 # Branches closed with saturation will be marked with an "s" % 0.18/0.38 # There were 1 total branch saturation attempts. % 0.18/0.38 # There were 0 of these attempts blocked. % 0.18/0.38 # There were 0 deferred branch saturation attempts. % 0.18/0.38 # There were 0 free duplicated saturations. % 0.18/0.38 # There were 1 total successful branch saturations. % 0.18/0.38 # There were 0 successful branch saturations in interreduction. % 0.18/0.38 # There were 0 successful branch saturations on the branch. % 0.18/0.38 # There were 1 successful branch saturations after the branch. % 0.18/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.18/0.38 # Begin clausification derivation % 0.18/0.38 % 0.18/0.38 # End clausification derivation % 0.18/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.38 cnf(i_0_18, negated_conjecture, (p2(c11,f4(f5(c12,c13))))). % 0.18/0.38 cnf(i_0_25, negated_conjecture, (p8(f6(c9,f4(c12)),f6(c9,f4(f5(c12,c14)))))). % 0.18/0.38 cnf(i_0_16, negated_conjecture, (p2(X1,X1))). % 0.18/0.38 cnf(i_0_19, negated_conjecture, (p2(f4(X1),f5(X1,f3(f7(c10)))))). % 0.18/0.38 cnf(i_0_17, negated_conjecture, (~p2(c9,f3(c10)))). % 0.18/0.38 cnf(i_0_26, negated_conjecture, (~p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14))))))). % 0.18/0.38 cnf(i_0_21, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.18/0.38 cnf(i_0_23, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.18/0.38 cnf(i_0_24, negated_conjecture, (p8(X1,X2)|~p8(X3,X2)|~p8(X1,X3))). % 0.18/0.38 cnf(i_0_22, negated_conjecture, (p2(f4(X1),f4(X2))|~p2(X1,X2))). % 0.18/0.38 cnf(i_0_20, negated_conjecture, (p2(f7(X1),f7(X2))|~p2(X1,X2))). % 0.18/0.38 cnf(i_0_28, negated_conjecture, (p2(f5(X1,X2),f5(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.18/0.38 cnf(i_0_30, negated_conjecture, (p8(f6(X1,X2),f6(X1,f5(X2,f3(f7(c10)))))|p2(X1,f3(c10)))). % 0.18/0.38 cnf(i_0_29, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p2(X1,X3))). % 0.18/0.38 cnf(i_0_27, negated_conjecture, (p8(X1,X2)|~p8(X3,X4)|~p2(X3,X1)|~p2(X4,X2))). % 0.18/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.38 # Begin printing tableau % 0.18/0.38 # Found 8 steps % 0.18/0.38 cnf(i_0_27, negated_conjecture, (p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14)))))|~p8(f6(c9,f4(c12)),f6(c9,f4(f5(c12,c14))))|~p2(f6(c9,f4(c12)),f6(c9,f4(c12)))|~p2(f6(c9,f4(f5(c12,c14))),f6(c9,f4(f4(f5(c12,c14)))))), inference(start_rule)). % 0.18/0.38 cnf(i_0_31, plain, (p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14)))))), inference(closure_rule, [i_0_26])). % 0.18/0.38 cnf(i_0_32, plain, (~p8(f6(c9,f4(c12)),f6(c9,f4(f5(c12,c14))))), inference(closure_rule, [i_0_25])). % 0.18/0.38 cnf(i_0_33, plain, (~p2(f6(c9,f4(c12)),f6(c9,f4(c12)))), inference(closure_rule, [i_0_16])). % 0.18/0.38 cnf(i_0_34, plain, (~p2(f6(c9,f4(f5(c12,c14))),f6(c9,f4(f4(f5(c12,c14)))))), inference(extension_rule, [i_0_29])). % 0.18/0.38 cnf(i_0_67, plain, (~p2(c9,c9)), inference(closure_rule, [i_0_16])). % 0.18/0.38 cnf(i_0_66, plain, (~p2(f4(f5(c12,c14)),f4(f4(f5(c12,c14))))), inference(extension_rule, [i_0_22])). % 0.18/0.38 cnf(i_0_80, plain, (~p2(f5(c12,c14),f4(f5(c12,c14)))), inference(etableau_closure_rule, [i_0_80, ...])). % 0.18/0.38 # End printing tableau % 0.18/0.38 # SZS output end % 0.18/0.38 # Branches closed with saturation will be marked with an "s" % 0.18/0.38 # Child (28417) has found a proof. % 0.18/0.38 % 0.18/0.38 # Proof search is over... % 0.18/0.38 # Freeing feature tree %------------------------------------------------------------------------------