%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : HEN013-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 : n010.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:36 EDT 2022 % Result : Satisfiable 205.43s 26.11s % Output : CNFRefutation 205.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : HEN013-1 : TPTP v8.1.0. Released v2.5.0. % 0.07/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 : n010.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 : Fri Jul 1 13:37:18 EDT 2022 % 0.13/0.33 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d % 0.13/0.36 # and selection function SelectCQIPrecWNTNp. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 9 Number of unprocessed: 9 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.36 # The folding up rule is enabled... % 0.13/0.36 # Local unification is enabled... % 0.13/0.36 # Any saturation attempts will use folding labels... % 0.13/0.36 # 9 beginning clauses after preprocessing and clausification % 0.13/0.36 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive. % 0.13/0.36 # No conjectures. % 0.13/0.36 # There are 9 start rule candidates: % 0.13/0.36 # Found 3 unit axioms. % 0.13/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.36 # 9 start rule tableaux created. % 0.13/0.36 # 6 extension rule candidate clauses % 0.13/0.36 # 3 unit axiom clauses % 0.13/0.36 % 0.13/0.36 # Requested 8, 32 cores available to the main process. % 4.61/0.95 # Creating equality axioms % 4.61/0.95 # Ran out of tableaux, making start rules for all clauses % 4.61/0.95 # Creating equality axioms % 4.61/0.95 # Ran out of tableaux, making start rules for all clauses % 4.61/0.95 # Creating equality axioms % 4.61/0.95 # Ran out of tableaux, making start rules for all clauses % 205.43/26.11 # 7677 Satisfiable branch % 205.43/26.11 # Satisfiable branch found. % 205.43/26.11 # There were 47 total branch saturation attempts. % 205.43/26.11 # There were 0 of these attempts blocked. % 205.43/26.11 # There were 0 deferred branch saturation attempts. % 205.43/26.11 # There were 0 free duplicated saturations. % 205.43/26.11 # There were 0 total successful branch saturations. % 205.43/26.11 # There were 0 successful branch saturations in interreduction. % 205.43/26.11 # There were 0 successful branch saturations on the branch. % 205.43/26.11 # There were 0 successful branch saturations after the branch. % 205.43/26.11 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 205.43/26.11 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 205.43/26.11 # Begin clausification derivation % 205.43/26.11 % 205.43/26.11 # End clausification derivation % 205.43/26.11 # Begin listing active clauses obtained from FOF to CNF conversion % 205.43/26.11 cnf(i_0_16, plain, (less_equal(X1,identity))). % 205.43/26.11 cnf(i_0_14, plain, (less_equal(zero,X1))). % 205.43/26.11 cnf(i_0_17, plain, (quotient(X1,X2,divide(X1,X2)))). % 205.43/26.11 cnf(i_0_10, plain, (quotient(X1,X2,zero)|~less_equal(X1,X2))). % 205.43/26.11 cnf(i_0_11, plain, (less_equal(X1,X2)|~quotient(X1,X2,zero))). % 205.43/26.11 cnf(i_0_15, plain, (X1=X2|~less_equal(X2,X1)|~less_equal(X1,X2))). % 205.43/26.11 cnf(i_0_12, plain, (less_equal(X1,X2)|~quotient(X2,X3,X1))). % 205.43/26.11 cnf(i_0_18, plain, (X1=X2|~quotient(X3,X4,X2)|~quotient(X3,X4,X1))). % 205.43/26.11 cnf(i_0_13, 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))). % 205.43/26.11 cnf(i_0_58, plain, (X9=X9)). % 205.43/26.11 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 205.43/26.11 # Begin printing tableau % 205.43/26.11 # Found 24 steps % 205.43/26.11 cnf(i_0_13, plain, (less_equal(identity,zero)|~quotient(divide(zero,zero),divide(identity,zero),identity)|~quotient(divide(zero,identity),zero,zero)|~quotient(identity,zero,divide(identity,zero))|~quotient(zero,zero,divide(zero,zero))|~quotient(zero,identity,divide(zero,identity))), inference(start_rule)). % 205.43/26.11 cnf(i_0_83, plain, (~quotient(identity,zero,divide(identity,zero))), inference(closure_rule, [i_0_17])). % 205.43/26.11 cnf(i_0_84, plain, (~quotient(zero,zero,divide(zero,zero))), inference(closure_rule, [i_0_17])). % 205.43/26.11 cnf(i_0_85, plain, (~quotient(zero,identity,divide(zero,identity))), inference(closure_rule, [i_0_17])). % 205.43/26.11 cnf(i_0_80, plain, (less_equal(identity,zero)), inference(extension_rule, [i_0_15])). % 205.43/26.11 cnf(i_0_3328188, plain, (~less_equal(zero,identity)), inference(closure_rule, [i_0_16])). % 205.43/26.11 cnf(i_0_3328186, plain, (zero=identity), inference(extension_rule, [i_0_60])). % 205.43/26.11 cnf(i_0_3328189, plain, (identity=zero), inference(extension_rule, [i_0_61])). % 205.43/26.11 cnf(i_0_81, plain, (~quotient(divide(zero,zero),divide(identity,zero),identity)), inference(extension_rule, [i_0_63])). % 205.43/26.11 cnf(i_0_3328219, plain, ($false), inference(closure_rule, [i_0_58])). % 205.43/26.11 cnf(i_0_3328220, plain, ($false), inference(closure_rule, [i_0_58])). % 205.43/26.11 cnf(i_0_3328222, plain, (~quotient(divide(zero,zero),divide(identity,zero),divide(divide(zero,zero),divide(identity,zero)))), inference(closure_rule, [i_0_17])). % 205.43/26.11 cnf(i_0_3328221, plain, (divide(divide(zero,zero),divide(identity,zero))!=identity), inference(extension_rule, [i_0_18])). % 205.43/26.11 cnf(i_0_3328233, plain, (~quotient(identity,identity,identity)), inference(extension_rule, [i_0_63])). % 205.43/26.11 cnf(i_0_3328265, plain, ($false), inference(closure_rule, [i_0_58])). % 205.43/26.11 cnf(i_0_3328266, plain, ($false), inference(closure_rule, [i_0_58])). % 205.43/26.11 cnf(i_0_3328268, plain, (~quotient(identity,identity,divide(identity,identity))), inference(closure_rule, [i_0_17])). % 205.43/26.11 cnf(i_0_3328234, plain, (~quotient(identity,identity,divide(divide(zero,zero),divide(identity,zero)))), inference(extension_rule, [i_0_63])). % 205.43/26.11 cnf(i_0_3328302, plain, ($false), inference(closure_rule, [i_0_58])). % 205.43/26.11 cnf(i_0_3328303, plain, ($false), inference(closure_rule, [i_0_58])). % 205.43/26.11 cnf(i_0_3328305, plain, (~quotient(identity,identity,divide(identity,identity))), inference(closure_rule, [i_0_17])). % 205.43/26.11 cnf(i_0_82, plain, (~quotient(divide(zero,identity),zero,zero)), inference(extension_rule, [i_0_10])). % 205.43/26.11 cnf(i_0_3328324, plain, (~less_equal(divide(zero,identity),zero)), inference(extension_rule, [i_0_12])). % 205.43/26.11 cnf(i_0_3329323, plain, (~quotient(zero,identity,divide(zero,identity))), inference(closure_rule, [i_0_17])). % 205.43/26.11 # End printing tableau % 205.43/26.11 # SZS output end % 205.43/26.11 # Branches closed with saturation will be marked with an "s" % 205.43/26.11 # Child (7677) has found a proof. % 205.43/26.11 % 205.43/26.11 # Proof search is over... % 205.43/26.11 # Freeing feature tree %------------------------------------------------------------------------------