TSTP Solution File: HEN009-6 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HEN009-6 : 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 : 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 : Sat Jul 16 12:52:31 EDT 2022
% Result : Unsatisfiable 0.21s 0.45s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : HEN009-6 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Fri Jul 1 14:08:14 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.15/0.38 # No SInE strategy applied
% 0.15/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.15/0.38 #
% 0.15/0.38 # Presaturation interreduction done
% 0.15/0.38 # Number of axioms: 17 Number of unprocessed: 16
% 0.15/0.38 # Tableaux proof search.
% 0.15/0.38 # APR header successfully linked.
% 0.15/0.38 # Hello from C++
% 0.15/0.39 # The folding up rule is enabled...
% 0.15/0.39 # Local unification is enabled...
% 0.15/0.39 # Any saturation attempts will use folding labels...
% 0.15/0.39 # 16 beginning clauses after preprocessing and clausification
% 0.15/0.39 # Creating start rules for all 1 conjectures.
% 0.15/0.39 # There are 1 start rule candidates:
% 0.15/0.39 # Found 11 unit axioms.
% 0.15/0.39 # 1 start rule tableaux created.
% 0.15/0.39 # 5 extension rule candidate clauses
% 0.15/0.39 # 11 unit axiom clauses
% 0.15/0.39
% 0.15/0.39 # Requested 8, 32 cores available to the main process.
% 0.15/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.45 # There were 2 total branch saturation attempts.
% 0.21/0.45 # There were 0 of these attempts blocked.
% 0.21/0.45 # There were 0 deferred branch saturation attempts.
% 0.21/0.45 # There were 0 free duplicated saturations.
% 0.21/0.45 # There were 2 total successful branch saturations.
% 0.21/0.45 # There were 0 successful branch saturations in interreduction.
% 0.21/0.45 # There were 0 successful branch saturations on the branch.
% 0.21/0.45 # There were 2 successful branch saturations after the branch.
% 0.21/0.45 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.45 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.45 # Begin clausification derivation
% 0.21/0.45
% 0.21/0.45 # End clausification derivation
% 0.21/0.45 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.45 cnf(i_0_32, hypothesis, (divide(identity,b)=c)).
% 0.21/0.45 cnf(i_0_31, hypothesis, (divide(identity,a)=b)).
% 0.21/0.45 cnf(i_0_33, hypothesis, (divide(identity,c)=d)).
% 0.21/0.45 cnf(i_0_25, plain, (divide(X1,identity)=zero)).
% 0.21/0.45 cnf(i_0_26, plain, (divide(zero,X1)=zero)).
% 0.21/0.45 cnf(i_0_24, plain, (less_equal(X1,identity))).
% 0.21/0.45 cnf(i_0_22, plain, (less_equal(zero,X1))).
% 0.21/0.45 cnf(i_0_27, plain, (divide(X1,X1)=zero)).
% 0.21/0.45 cnf(i_0_20, plain, (less_equal(divide(X1,X2),X1))).
% 0.21/0.45 cnf(i_0_21, plain, (less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)))).
% 0.21/0.45 cnf(i_0_34, negated_conjecture, (d!=b)).
% 0.21/0.45 cnf(i_0_18, plain, (divide(X1,X2)=zero|~less_equal(X1,X2))).
% 0.21/0.45 cnf(i_0_19, plain, (less_equal(X1,X2)|divide(X1,X2)!=zero)).
% 0.21/0.45 cnf(i_0_23, plain, (X1=X2|~less_equal(X2,X1)|~less_equal(X1,X2))).
% 0.21/0.45 cnf(i_0_29, plain, (less_equal(divide(X1,X2),divide(X3,X2))|~less_equal(X1,X3))).
% 0.21/0.45 cnf(i_0_28, plain, (less_equal(divide(X1,X2),X3)|~less_equal(divide(X1,X3),X2))).
% 0.21/0.45 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.45 # Begin printing tableau
% 0.21/0.45 # Found 5 steps
% 0.21/0.45 cnf(i_0_34, negated_conjecture, (d!=b), inference(start_rule)).
% 0.21/0.45 cnf(i_0_35, plain, (d!=b), inference(extension_rule, [i_0_23])).
% 0.21/0.45 cnf(i_0_41, plain, (~less_equal(b,d)), inference(extension_rule, [i_0_19])).
% 0.21/0.45 cnf(i_0_42, plain, (~less_equal(d,b)), inference(etableau_closure_rule, [i_0_42, ...])).
% 0.21/0.45 cnf(i_0_50, plain, (divide(b,d)!=zero), inference(etableau_closure_rule, [i_0_50, ...])).
% 0.21/0.45 # End printing tableau
% 0.21/0.45 # SZS output end
% 0.21/0.45 # Branches closed with saturation will be marked with an "s"
% 0.21/0.45 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.45 # We now have 1 tableaux to operate on
% 0.21/0.45 # Found closed tableau during pool population.
% 0.21/0.45 # Proof search is over...
% 0.21/0.45 # Freeing feature tree
%------------------------------------------------------------------------------