%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : HEN009-1 : TPTP v8.1.0. Released v1.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 : n004.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 : Sat Jul 16 12:52:30 EDT 2022 % Result : Unsatisfiable 10.28s 3.03s % Output : CNFRefutation 10.28s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : HEN009-1 : TPTP v8.1.0. Released v1.0.0. % 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.34 % Computer : n004.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jul 1 14:00:23 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 13 Number of unprocessed: 13 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.19/0.43 # The folding up rule is enabled... % 0.19/0.43 # Local unification is enabled... % 0.19/0.43 # Any saturation attempts will use folding labels... % 0.19/0.43 # 13 beginning clauses after preprocessing and clausification % 0.19/0.43 # Creating start rules for all 1 conjectures. % 0.19/0.43 # There are 1 start rule candidates: % 0.19/0.43 # Found 7 unit axioms. % 0.19/0.43 # 1 start rule tableaux created. % 0.19/0.43 # 6 extension rule candidate clauses % 0.19/0.43 # 7 unit axiom clauses % 0.19/0.43 % 0.19/0.43 # Requested 8, 32 cores available to the main process. % 0.19/0.43 # There are not enough tableaux to fork, creating more from the initial 1 % 1.68/1.92 # Creating equality axioms % 1.68/1.92 # Ran out of tableaux, making start rules for all clauses % 1.68/1.92 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux. % 1.68/1.92 # We now have 17 tableaux to operate on % 10.28/3.03 # There were 10 total branch saturation attempts. % 10.28/3.03 # There were 2 of these attempts blocked. % 10.28/3.03 # There were 0 deferred branch saturation attempts. % 10.28/3.03 # There were 2 free duplicated saturations. % 10.28/3.03 # There were 4 total successful branch saturations. % 10.28/3.03 # There were 0 successful branch saturations in interreduction. % 10.28/3.03 # There were 0 successful branch saturations on the branch. % 10.28/3.03 # There were 2 successful branch saturations after the branch. % 10.28/3.03 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.28/3.03 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.28/3.03 # Begin clausification derivation % 10.28/3.03 % 10.28/3.03 # End clausification derivation % 10.28/3.03 # Begin listing active clauses obtained from FOF to CNF conversion % 10.28/3.03 cnf(i_0_20, plain, (less_equal(X1,identity))). % 10.28/3.03 cnf(i_0_18, plain, (less_equal(zero,X1))). % 10.28/3.03 cnf(i_0_23, hypothesis, (quotient(identity,a,idQa))). % 10.28/3.03 cnf(i_0_24, hypothesis, (quotient(identity,idQa,idQ_idQa))). % 10.28/3.03 cnf(i_0_25, hypothesis, (quotient(identity,idQ_idQa,idQ__idQ_idQa))). % 10.28/3.03 cnf(i_0_21, plain, (quotient(X1,X2,divide(X1,X2)))). % 10.28/3.03 cnf(i_0_26, negated_conjecture, (idQ__idQ_idQa!=idQa)). % 10.28/3.03 cnf(i_0_19, plain, (X1=X2|~less_equal(X2,X1)|~less_equal(X1,X2))). % 10.28/3.03 cnf(i_0_14, plain, (quotient(X1,X2,zero)|~less_equal(X1,X2))). % 10.28/3.03 cnf(i_0_15, plain, (less_equal(X1,X2)|~quotient(X1,X2,zero))). % 10.28/3.03 cnf(i_0_16, plain, (less_equal(X1,X2)|~quotient(X2,X3,X1))). % 10.28/3.03 cnf(i_0_22, plain, (X1=X2|~quotient(X3,X4,X2)|~quotient(X3,X4,X1))). % 10.28/3.03 cnf(i_0_17, plain, (less_equal(X1,X2)|~quotient(X3,X4,X1)|~quotient(X5,X6,X2)|~quotient(X7,X6,X4)|~quotient(X8,X6,X3)|~quotient(X8,X7,X5))). % 10.28/3.03 cnf(i_0_159271, plain, (X9=X9)). % 10.28/3.03 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 10.28/3.03 # Begin printing tableau % 10.28/3.03 # Found 8 steps % 10.28/3.03 cnf(i_0_18, plain, (less_equal(zero,zero)), inference(start_rule)). % 10.28/3.03 cnf(i_0_159279, plain, (less_equal(zero,zero)), inference(extension_rule, [i_0_19])). % 10.28/3.03 cnf(i_0_159343, plain, (~less_equal(zero,zero)), inference(closure_rule, [i_0_18])). % 10.28/3.03 cnf(i_0_159341, plain, (zero=zero), inference(extension_rule, [i_0_159275])). % 10.28/3.03 cnf(i_0_159550, plain, ($false), inference(closure_rule, [i_0_159271])). % 10.28/3.03 cnf(i_0_159551, plain, (~less_equal(zero,identity)), inference(closure_rule, [i_0_20])). % 10.28/3.03 cnf(i_0_159548, plain, (less_equal(zero,identity)), inference(extension_rule, [i_0_14])). % 10.28/3.03 cnf(i_0_234085, plain, (quotient(zero,identity,zero)), inference(etableau_closure_rule, [i_0_234085, ...])). % 10.28/3.03 # End printing tableau % 10.28/3.03 # SZS output end % 10.28/3.03 # Branches closed with saturation will be marked with an "s" % 10.28/3.04 # Child (8001) has found a proof. % 10.28/3.04 % 10.28/3.04 # Proof search is over... % 10.28/3.04 # Freeing feature tree %------------------------------------------------------------------------------