%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN580-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 : n014.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:36 EDT 2022 % Result : Unsatisfiable 0.13s 0.36s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN580-1 : TPTP v8.1.0. Released v2.5.0. % 0.06/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 : n014.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 : Tue Jul 12 05:43:49 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.35 # No SInE strategy applied % 0.13/0.35 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.35 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.35 # % 0.13/0.35 # Presaturation interreduction done % 0.13/0.35 # Number of axioms: 23 Number of unprocessed: 23 % 0.13/0.35 # Tableaux proof search. % 0.13/0.35 # APR header successfully linked. % 0.13/0.35 # Hello from C++ % 0.13/0.35 # The folding up rule is enabled... % 0.13/0.35 # Local unification is enabled... % 0.13/0.35 # Any saturation attempts will use folding labels... % 0.13/0.35 # 23 beginning clauses after preprocessing and clausification % 0.13/0.35 # Creating start rules for all 23 conjectures. % 0.13/0.35 # There are 23 start rule candidates: % 0.13/0.35 # Found 8 unit axioms. % 0.13/0.35 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.35 # 23 start rule tableaux created. % 0.13/0.35 # 15 extension rule candidate clauses % 0.13/0.35 # 8 unit axiom clauses % 0.13/0.35 % 0.13/0.35 # Requested 8, 32 cores available to the main process. % 0.13/0.36 # There were 2 total branch saturation attempts. % 0.13/0.36 # There were 0 of these attempts blocked. % 0.13/0.36 # There were 0 deferred branch saturation attempts. % 0.13/0.36 # There were 0 free duplicated saturations. % 0.13/0.36 # There were 2 total successful branch saturations. % 0.13/0.36 # There were 0 successful branch saturations in interreduction. % 0.13/0.36 # There were 0 successful branch saturations on the branch. % 0.13/0.36 # There were 2 successful branch saturations after the branch. % 0.13/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.13/0.36 # Begin clausification derivation % 0.13/0.36 % 0.13/0.36 # End clausification derivation % 0.13/0.36 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.36 cnf(i_0_28, negated_conjecture, (p11(c15,c16))). % 0.13/0.36 cnf(i_0_29, negated_conjecture, (p9(c12,c13))). % 0.13/0.36 cnf(i_0_30, negated_conjecture, (p2(c14,f3(c15)))). % 0.13/0.36 cnf(i_0_24, negated_conjecture, (p10(X1,X1))). % 0.13/0.36 cnf(i_0_25, negated_conjecture, (p7(X1,X1))). % 0.13/0.36 cnf(i_0_26, negated_conjecture, (p4(X1,X1))). % 0.13/0.36 cnf(i_0_27, negated_conjecture, (p2(X1,X1))). % 0.13/0.36 cnf(i_0_31, negated_conjecture, (~p8(c12,c13,c14))). % 0.13/0.36 cnf(i_0_35, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))). % 0.13/0.36 cnf(i_0_36, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))). % 0.13/0.36 cnf(i_0_37, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))). % 0.13/0.36 cnf(i_0_32, negated_conjecture, (p4(f6(X1),f6(X2))|~p2(X1,X2))). % 0.13/0.36 cnf(i_0_34, negated_conjecture, (p4(f5(X1),f5(X2))|~p2(X1,X2))). % 0.13/0.36 cnf(i_0_33, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))). % 0.13/0.36 cnf(i_0_39, negated_conjecture, (p8(c12,X1,X2)|~p9(c12,X1)|~p11(X2,c16))). % 0.13/0.36 cnf(i_0_40, negated_conjecture, (p8(c12,X1,X2)|p9(c12,f5(X2))|~p9(c12,X1))). % 0.13/0.36 cnf(i_0_38, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.13/0.36 cnf(i_0_41, negated_conjecture, (p8(c12,X1,f3(X2))|p9(c12,f6(X2))|~p9(c12,X1))). % 0.13/0.36 cnf(i_0_43, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p2(X3,X1)|~p10(X4,X2))). % 0.13/0.36 cnf(i_0_42, negated_conjecture, (p9(X1,X2)|~p9(X3,X4)|~p4(X4,X2)|~p7(X3,X1))). % 0.13/0.36 cnf(i_0_44, negated_conjecture, (p8(c12,X1,X2)|~p8(c12,f5(X2),f3(X2))|~p9(c12,X1))). % 0.13/0.36 cnf(i_0_45, negated_conjecture, (p8(c12,X1,f3(X2))|~p8(c12,f6(X2),X2)|~p9(c12,X1))). % 0.13/0.36 cnf(i_0_46, negated_conjecture, (p8(X1,X2,X3)|~p8(X4,X5,X6)|~p2(X6,X3)|~p4(X5,X2)|~p7(X4,X1))). % 0.13/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.36 # Begin printing tableau % 0.13/0.36 # Found 18 steps % 0.13/0.36 cnf(i_0_41, negated_conjecture, (p8(c12,c13,f3(c15))|p9(c12,f6(c15))|~p9(c12,c13)), inference(start_rule)). % 0.13/0.36 cnf(i_0_68, plain, (~p9(c12,c13)), inference(closure_rule, [i_0_29])). % 0.13/0.36 cnf(i_0_66, plain, (p8(c12,c13,f3(c15))), inference(extension_rule, [i_0_46])). % 0.13/0.36 cnf(i_0_101, plain, (p8(c12,c13,c14)), inference(closure_rule, [i_0_31])). % 0.13/0.36 cnf(i_0_104, plain, (~p4(c13,c13)), inference(closure_rule, [i_0_26])). % 0.13/0.36 cnf(i_0_105, plain, (~p7(c12,c12)), inference(closure_rule, [i_0_25])). % 0.13/0.36 cnf(i_0_103, plain, (~p2(f3(c15),c14)), inference(extension_rule, [i_0_38])). % 0.13/0.36 cnf(i_0_124, plain, (~p2(c14,c14)), inference(closure_rule, [i_0_27])). % 0.13/0.36 cnf(i_0_125, plain, (~p2(c14,f3(c15))), inference(closure_rule, [i_0_30])). % 0.13/0.36 cnf(i_0_67, plain, (p9(c12,f6(c15))), inference(extension_rule, [i_0_45])). % 0.13/0.36 cnf(i_0_126, plain, (p8(c12,f6(c15),f3(c15))), inference(extension_rule, [i_0_46])). % 0.13/0.36 cnf(i_0_164, plain, (p8(c12,c13,c14)), inference(closure_rule, [i_0_31])). % 0.13/0.36 cnf(i_0_168, plain, (~p7(c12,c12)), inference(closure_rule, [i_0_25])). % 0.13/0.36 cnf(i_0_166, plain, (~p2(f3(c15),c14)), inference(extension_rule, [i_0_38])). % 0.13/0.36 cnf(i_0_205, plain, (~p2(c14,c14)), inference(closure_rule, [i_0_27])). % 0.13/0.36 cnf(i_0_206, plain, (~p2(c14,f3(c15))), inference(closure_rule, [i_0_30])). % 0.13/0.36 cnf(i_0_127, plain, (~p8(c12,f6(c15),c15)), inference(etableau_closure_rule, [i_0_127, ...])). % 0.13/0.36 cnf(i_0_167, plain, (~p4(f6(c15),c13)), inference(etableau_closure_rule, [i_0_167, ...])). % 0.13/0.36 # End printing tableau % 0.13/0.36 # SZS output end % 0.13/0.36 # Branches closed with saturation will be marked with an "s" % 0.13/0.36 # Child (3559) has found a proof. % 0.13/0.36 % 0.13/0.36 # Proof search is over... % 0.13/0.36 # Freeing feature tree %------------------------------------------------------------------------------