%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : NUM024-1 : TPTP v8.1.0. Bugfixed v4.0.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 : Mon Jul 18 09:38:25 EDT 2022 % Result : Unsatisfiable 0.12s 0.38s % Output : CNFRefutation 0.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NUM024-1 : TPTP v8.1.0. Bugfixed v4.0.0. % 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.34 % Computer : n011.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Wed Jul 6 08:14:38 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I % 0.12/0.37 # and selection function SelectCQArEqLast. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 16 Number of unprocessed: 16 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.38 # The folding up rule is enabled... % 0.12/0.38 # Local unification is enabled... % 0.12/0.38 # Any saturation attempts will use folding labels... % 0.12/0.38 # 16 beginning clauses after preprocessing and clausification % 0.12/0.38 # Creating start rules for all 1 conjectures. % 0.12/0.38 # There are 1 start rule candidates: % 0.12/0.38 # Found 8 unit axioms. % 0.12/0.38 # 1 start rule tableaux created. % 0.12/0.38 # 8 extension rule candidate clauses % 0.12/0.38 # 8 unit axiom clauses % 0.12/0.38 % 0.12/0.38 # Requested 8, 32 cores available to the main process. % 0.12/0.38 # There are not enough tableaux to fork, creating more from the initial 1 % 0.12/0.38 # There were 1 total branch saturation attempts. % 0.12/0.38 # There were 0 of these attempts blocked. % 0.12/0.38 # There were 0 deferred branch saturation attempts. % 0.12/0.38 # There were 0 free duplicated saturations. % 0.12/0.38 # There were 1 total successful branch saturations. % 0.12/0.38 # There were 0 successful branch saturations in interreduction. % 0.12/0.38 # There were 0 successful branch saturations on the branch. % 0.12/0.38 # There were 1 successful branch saturations after the branch. % 0.12/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.38 # Begin clausification derivation % 0.12/0.38 % 0.12/0.38 # End clausification derivation % 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.12/0.38 cnf(i_0_26, plain, (equalish(X1,X1))). % 0.12/0.38 cnf(i_0_19, plain, (equalish(multiply(X1,n0),n0))). % 0.12/0.38 cnf(i_0_17, plain, (equalish(add(X1,n0),X1))). % 0.12/0.38 cnf(i_0_31, hypothesis, (less(a,a))). % 0.12/0.38 cnf(i_0_30, plain, (equalish(add(X1,X2),add(X2,X1)))). % 0.12/0.38 cnf(i_0_18, plain, (equalish(add(X1,successor(X2)),successor(add(X1,X2))))). % 0.12/0.38 cnf(i_0_20, plain, (equalish(multiply(X1,successor(X2)),add(multiply(X1,X2),X1)))). % 0.12/0.38 cnf(i_0_32, negated_conjecture, (~equalish(successor(X1),n0))). % 0.12/0.38 cnf(i_0_27, plain, (equalish(X1,X2)|~equalish(X2,X1))). % 0.12/0.38 cnf(i_0_22, plain, (equalish(successor(X1),successor(X2))|~equalish(X1,X2))). % 0.12/0.38 cnf(i_0_21, plain, (equalish(X1,X2)|~equalish(successor(X1),successor(X2)))). % 0.12/0.38 cnf(i_0_28, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))). % 0.12/0.38 cnf(i_0_24, plain, (less(X1,X2)|~equalish(add(successor(X3),X1),X2))). % 0.12/0.38 cnf(i_0_29, plain, (equalish(X1,X2)|~equalish(add(X1,X3),add(X2,X3)))). % 0.12/0.38 cnf(i_0_25, plain, (equalish(add(successor(predecessor_of_1st_minus_2nd(X1,X2)),X2),X1)|~less(X2,X1))). % 0.12/0.38 cnf(i_0_23, plain, (less(X1,X2)|~less(X1,X3)|~less(X3,X2))). % 0.12/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.12/0.38 # Begin printing tableau % 0.12/0.38 # Found 4 steps % 0.12/0.38 cnf(i_0_32, negated_conjecture, (~equalish(successor(X8),n0)), inference(start_rule)). % 0.12/0.38 cnf(i_0_33, plain, (~equalish(successor(X8),n0)), inference(extension_rule, [i_0_29])). % 0.12/0.38 cnf(i_0_46, plain, (~equalish(add(successor(X8),X6),add(n0,X6))), inference(extension_rule, [i_0_27])). % 0.12/0.38 cnf(i_0_53, plain, (~equalish(add(n0,X6),add(successor(X8),X6))), inference(etableau_closure_rule, [i_0_53, ...])). % 0.12/0.38 # End printing tableau % 0.12/0.38 # SZS output end % 0.12/0.38 # Branches closed with saturation will be marked with an "s" % 0.12/0.38 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.12/0.38 # We now have 4 tableaux to operate on % 0.12/0.38 # Found closed tableau during pool population. % 0.12/0.38 # Proof search is over... % 0.12/0.38 # Freeing feature tree %------------------------------------------------------------------------------