TSTP Solution File: HEN010-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HEN010-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 : n007.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:32 EDT 2022
% Result : Unsatisfiable 18.50s 4.75s
% Output : CNFRefutation 18.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : HEN010-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/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 : n007.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:19:24 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.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 13 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 1 conjectures.
% 0.13/0.37 # There are 1 start rule candidates:
% 0.13/0.37 # Found 7 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 6 extension rule candidate clauses
% 0.13/0.37 # 7 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 2.53/2.70 # Creating equality axioms
% 2.53/2.70 # Ran out of tableaux, making start rules for all clauses
% 2.53/2.70 # Returning from population with 22 new_tableaux and 0 remaining starting tableaux.
% 2.53/2.70 # We now have 22 tableaux to operate on
% 18.50/4.75 # There were 12 total branch saturation attempts.
% 18.50/4.75 # There were 1 of these attempts blocked.
% 18.50/4.75 # There were 0 deferred branch saturation attempts.
% 18.50/4.75 # There were 2 free duplicated saturations.
% 18.50/4.75 # There were 4 total successful branch saturations.
% 18.50/4.75 # There were 0 successful branch saturations in interreduction.
% 18.50/4.75 # There were 0 successful branch saturations on the branch.
% 18.50/4.75 # There were 2 successful branch saturations after the branch.
% 18.50/4.75 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.50/4.75 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 18.50/4.75 # Begin clausification derivation
% 18.50/4.75
% 18.50/4.75 # End clausification derivation
% 18.50/4.75 # Begin listing active clauses obtained from FOF to CNF conversion
% 18.50/4.75 cnf(i_0_25, hypothesis, (quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa))).
% 18.50/4.75 cnf(i_0_20, plain, (less_equal(X1,identity))).
% 18.50/4.75 cnf(i_0_18, plain, (less_equal(zero,X1))).
% 18.50/4.75 cnf(i_0_23, hypothesis, (quotient(identity,a,idQa))).
% 18.50/4.75 cnf(i_0_24, hypothesis, (quotient(identity,idQa,idQ_idQa))).
% 18.50/4.75 cnf(i_0_21, plain, (quotient(X1,X2,divide(X1,X2)))).
% 18.50/4.75 cnf(i_0_26, negated_conjecture, (idQa_Q__idQ_idQa!=idQa)).
% 18.50/4.75 cnf(i_0_19, plain, (X1=X2|~less_equal(X2,X1)|~less_equal(X1,X2))).
% 18.50/4.75 cnf(i_0_14, plain, (quotient(X1,X2,zero)|~less_equal(X1,X2))).
% 18.50/4.75 cnf(i_0_15, plain, (less_equal(X1,X2)|~quotient(X1,X2,zero))).
% 18.50/4.75 cnf(i_0_16, plain, (less_equal(X1,X2)|~quotient(X2,X3,X1))).
% 18.50/4.75 cnf(i_0_22, plain, (X1=X2|~quotient(X3,X4,X2)|~quotient(X3,X4,X1))).
% 18.50/4.75 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))).
% 18.50/4.75 cnf(i_0_225188, plain, (X9=X9)).
% 18.50/4.75 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 18.50/4.75 # Begin printing tableau
% 18.50/4.75 # Found 17 steps
% 18.50/4.75 cnf(i_0_25, hypothesis, (quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa)), inference(start_rule)).
% 18.50/4.75 cnf(i_0_225195, plain, (quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa)), inference(extension_rule, [i_0_22])).
% 18.50/4.75 cnf(i_0_225230, plain, (idQa_Q__idQ_idQa=idQa), inference(closure_rule, [i_0_26])).
% 18.50/4.75 cnf(i_0_225231, plain, (~quotient(idQa,idQ_idQa,idQa)), inference(extension_rule, [i_0_225193])).
% 18.50/4.75 cnf(i_0_225288, plain, ($false), inference(closure_rule, [i_0_225188])).
% 18.50/4.75 cnf(i_0_225289, plain, ($false), inference(closure_rule, [i_0_225188])).
% 18.50/4.75 cnf(i_0_225291, plain, (~quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa)), inference(closure_rule, [i_0_25])).
% 18.50/4.75 cnf(i_0_225290, plain, (idQa_Q__idQ_idQa!=idQa), inference(extension_rule, [i_0_19])).
% 18.50/4.75 cnf(i_0_282705, plain, (~less_equal(idQa_Q__idQ_idQa,idQa)), inference(closure_rule, [i_0_225298])).
% 18.50/4.75 cnf(i_0_282704, plain, (~less_equal(idQa,idQa_Q__idQ_idQa)), inference(extension_rule, [i_0_15])).
% 18.50/4.75 cnf(i_0_365707, plain, (~quotient(idQa,idQa_Q__idQ_idQa,zero)), inference(extension_rule, [i_0_225193])).
% 18.50/4.75 cnf(i_0_365730, plain, ($false), inference(closure_rule, [i_0_225188])).
% 18.50/4.75 cnf(i_0_365731, plain, ($false), inference(closure_rule, [i_0_225188])).
% 18.50/4.75 cnf(i_0_365733, plain, (~quotient(idQa,idQa_Q__idQ_idQa,divide(idQa,idQa_Q__idQ_idQa))), inference(closure_rule, [i_0_21])).
% 18.50/4.75 cnf(i_0_365732, plain, (divide(idQa,idQa_Q__idQ_idQa)!=zero), inference(extension_rule, [i_0_19])).
% 18.50/4.75 cnf(i_0_365756, plain, (~less_equal(zero,divide(idQa,idQa_Q__idQ_idQa))), inference(closure_rule, [i_0_18])).
% 18.50/4.75 cnf(i_0_365757, plain, (~less_equal(divide(idQa,idQa_Q__idQ_idQa),zero)), inference(etableau_closure_rule, [i_0_365757, ...])).
% 18.50/4.75 # End printing tableau
% 18.50/4.75 # SZS output end
% 18.50/4.75 # Branches closed with saturation will be marked with an "s"
% 18.50/4.76 # Child (26464) has found a proof.
% 18.50/4.76
% 18.50/4.76 # Proof search is over...
% 18.50/4.76 # Freeing feature tree
%------------------------------------------------------------------------------