TSTP Solution File: HEN008-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HEN008-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 : n028.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:28 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : HEN008-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 1 15:03:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 13 Number of unprocessed: 13
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 13 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 7 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 6 extension rule candidate clauses
% 0.12/0.36 # 7 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36 # Creating equality axioms
% 0.12/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 17 tableaux to operate on
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_23, hypothesis, (less_equal(a,b))).
% 0.12/0.37 cnf(i_0_20, plain, (less_equal(X1,identity))).
% 0.12/0.37 cnf(i_0_18, plain, (less_equal(zero,X1))).
% 0.12/0.37 cnf(i_0_24, hypothesis, (quotient(a,c,aQc))).
% 0.12/0.37 cnf(i_0_25, hypothesis, (quotient(b,c,bQc))).
% 0.12/0.37 cnf(i_0_21, plain, (quotient(X1,X2,divide(X1,X2)))).
% 0.12/0.37 cnf(i_0_26, negated_conjecture, (~less_equal(aQc,bQc))).
% 0.12/0.37 cnf(i_0_19, plain, (X1=X2|~less_equal(X2,X1)|~less_equal(X1,X2))).
% 0.12/0.37 cnf(i_0_14, plain, (quotient(X1,X2,zero)|~less_equal(X1,X2))).
% 0.12/0.37 cnf(i_0_15, plain, (less_equal(X1,X2)|~quotient(X1,X2,zero))).
% 0.12/0.37 cnf(i_0_16, plain, (less_equal(X1,X2)|~quotient(X2,X3,X1))).
% 0.12/0.37 cnf(i_0_22, plain, (X1=X2|~quotient(X3,X4,X2)|~quotient(X3,X4,X1))).
% 0.12/0.37 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))).
% 0.12/0.37 cnf(i_0_136, plain, (X9=X9)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 7 steps
% 0.12/0.37 cnf(i_0_18, plain, (less_equal(zero,zero)), inference(start_rule)).
% 0.12/0.37 cnf(i_0_145, plain, (less_equal(zero,zero)), inference(extension_rule, [i_0_19])).
% 0.12/0.37 cnf(i_0_208, plain, (~less_equal(zero,zero)), inference(closure_rule, [i_0_18])).
% 0.12/0.37 cnf(i_0_206, plain, (zero=zero), inference(extension_rule, [i_0_140])).
% 0.12/0.37 cnf(i_0_415, plain, ($false), inference(closure_rule, [i_0_136])).
% 0.12/0.37 cnf(i_0_416, plain, (~less_equal(zero,identity)), inference(closure_rule, [i_0_20])).
% 0.12/0.37 cnf(i_0_413, plain, (less_equal(zero,identity)), inference(etableau_closure_rule, [i_0_413, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Child (14884) has found a proof.
% 0.12/0.37
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------