%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : ALG440-1 : TPTP v8.1.0. Released v5.4.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 : n028.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 14 16:52:49 EDT 2022 % Result : Unsatisfiable 0.19s 0.43s % Output : CNFRefutation 0.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : ALG440-1 : TPTP v8.1.0. Released v5.4.0. % 0.13/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 : n028.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 : Wed Jun 8 13:12:01 EDT 2022 % 0.13/0.33 % CPUTime : % 0.19/0.36 # No SInE strategy applied % 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.19/0.36 # and selection function SelectCQIPrecWNTNp. % 0.19/0.36 # % 0.19/0.36 # Presaturation interreduction done % 0.19/0.36 # Number of axioms: 14 Number of unprocessed: 13 % 0.19/0.36 # Tableaux proof search. % 0.19/0.36 # APR header successfully linked. % 0.19/0.36 # Hello from C++ % 0.19/0.36 # The folding up rule is enabled... % 0.19/0.36 # Local unification is enabled... % 0.19/0.36 # Any saturation attempts will use folding labels... % 0.19/0.36 # 13 beginning clauses after preprocessing and clausification % 0.19/0.36 # Creating start rules for all 1 conjectures. % 0.19/0.36 # There are 1 start rule candidates: % 0.19/0.36 # Found 10 unit axioms. % 0.19/0.36 # 1 start rule tableaux created. % 0.19/0.36 # 3 extension rule candidate clauses % 0.19/0.36 # 10 unit axiom clauses % 0.19/0.36 % 0.19/0.36 # Requested 8, 32 cores available to the main process. % 0.19/0.36 # There are not enough tableaux to fork, creating more from the initial 1 % 0.19/0.36 # Creating equality axioms % 0.19/0.36 # Ran out of tableaux, making start rules for all clauses % 0.19/0.36 # Returning from population with 22 new_tableaux and 0 remaining starting tableaux. % 0.19/0.36 # We now have 22 tableaux to operate on % 0.19/0.43 # There were 1 total branch saturation attempts. % 0.19/0.43 # There were 0 of these attempts blocked. % 0.19/0.43 # There were 0 deferred branch saturation attempts. % 0.19/0.43 # There were 0 free duplicated saturations. % 0.19/0.43 # There were 1 total successful branch saturations. % 0.19/0.43 # There were 0 successful branch saturations in interreduction. % 0.19/0.43 # There were 0 successful branch saturations on the branch. % 0.19/0.43 # There were 1 successful branch saturations after the branch. % 0.19/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.43 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.19/0.43 # Begin clausification derivation % 0.19/0.43 % 0.19/0.43 # End clausification derivation % 0.19/0.43 # Begin listing active clauses obtained from FOF to CNF conversion % 0.19/0.43 cnf(i_0_27, plain, (r(a,a,b))). % 0.19/0.43 cnf(i_0_28, plain, (r(a,b,a))). % 0.19/0.43 cnf(i_0_29, plain, (r(b,a,a))). % 0.19/0.43 cnf(i_0_17, plain, (m(X1,X2,X2)=X1)). % 0.19/0.43 cnf(i_0_16, plain, (m(X1,X1,X2)=X2)). % 0.19/0.43 cnf(i_0_18, plain, (u(X1,X1,X1)=X1)). % 0.19/0.43 cnf(i_0_22, plain, (u(X1,X1,X2)=u(X2,X2,X1))). % 0.19/0.43 cnf(i_0_21, plain, (u(X1,X1,X2)=u(X2,X1,X1))). % 0.19/0.43 cnf(i_0_20, plain, (u(X1,X1,X2)=u(X1,X2,X1))). % 0.19/0.43 cnf(i_0_30, negated_conjecture, (~r(a,a,a))). % 0.19/0.43 cnf(i_0_26, plain, (r(u(X1,X1,X2),u(X3,X3,X4),u(X5,X5,X6))|~r(X2,X4,X6)|~r(X1,X3,X5))). % 0.19/0.43 cnf(i_0_24, plain, (r(m(X1,X2,X3),m(X4,X5,X6),m(X7,X8,X9))|~r(X3,X6,X9)|~r(X2,X5,X8)|~r(X1,X4,X7))). % 0.19/0.43 cnf(i_0_25, plain, (r(u(X1,X2,X3),u(X4,X5,X6),u(X7,X8,X9))|~r(X3,X6,X9)|~r(X2,X5,X8)|~r(X1,X4,X7))). % 0.19/0.43 cnf(i_0_43, plain, (X10=X10)). % 0.19/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.19/0.43 # Begin printing tableau % 0.19/0.43 # Found 8 steps % 0.19/0.43 cnf(i_0_27, plain, (r(a,a,b)), inference(start_rule)). % 0.19/0.43 cnf(i_0_50, plain, (r(a,a,b)), inference(extension_rule, [i_0_49])). % 0.19/0.43 cnf(i_0_98, plain, (r(a,a,a)), inference(closure_rule, [i_0_30])). % 0.19/0.43 cnf(i_0_99, plain, ($false), inference(closure_rule, [i_0_43])). % 0.19/0.43 cnf(i_0_100, plain, ($false), inference(closure_rule, [i_0_43])). % 0.19/0.43 cnf(i_0_101, plain, (b!=a), inference(extension_rule, [i_0_46])). % 0.19/0.43 cnf(i_0_119, plain, (b!=u(b,b,b)), inference(closure_rule, [i_0_18])). % 0.19/0.43 cnf(i_0_120, plain, (u(b,b,b)!=a), inference(etableau_closure_rule, [i_0_120, ...])). % 0.19/0.43 # End printing tableau % 0.19/0.43 # SZS output end % 0.19/0.43 # Branches closed with saturation will be marked with an "s" % 0.19/0.44 # Child (29788) has found a proof. % 0.19/0.44 % 0.19/0.44 # Proof search is over... % 0.19/0.44 # Freeing feature tree %------------------------------------------------------------------------------