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