TSTP Solution File: HEN009-4 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HEN009-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : n005.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.18s 0.42s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HEN009-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/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 : n005.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 13:57:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic H_____042_B03_F1_AE_Q4_SP_S2S
% 0.12/0.36 # and selection function SelectNewComplexAHP.
% 0.12/0.36 #
% 0.12/0.36 # Number of axioms: 16 Number of unprocessed: 16
% 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.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 16 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 1 conjectures.
% 0.12/0.37 # There are 1 start rule candidates:
% 0.12/0.37 # Found 9 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 7 extension rule candidate clauses
% 0.12/0.37 # 9 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.18/0.42 # There were 2 total branch saturation attempts.
% 0.18/0.42 # There were 0 of these attempts blocked.
% 0.18/0.42 # There were 0 deferred branch saturation attempts.
% 0.18/0.42 # There were 0 free duplicated saturations.
% 0.18/0.42 # There were 2 total successful branch saturations.
% 0.18/0.42 # There were 0 successful branch saturations in interreduction.
% 0.18/0.42 # There were 0 successful branch saturations on the branch.
% 0.18/0.42 # There were 2 successful branch saturations after the branch.
% 0.18/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.42 # Begin clausification derivation
% 0.18/0.42
% 0.18/0.42 # End clausification derivation
% 0.18/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.42 cnf(i_0_27, plain, (divide(a,zero)=a)).
% 0.18/0.42 cnf(i_0_24, plain, (divide(X1,identity)=zero)).
% 0.18/0.42 cnf(i_0_25, plain, (divide(zero,X1)=zero)).
% 0.18/0.42 cnf(i_0_23, plain, (less_equal(X1,identity))).
% 0.18/0.42 cnf(i_0_21, plain, (less_equal(zero,X1))).
% 0.18/0.42 cnf(i_0_26, plain, (divide(X1,X1)=zero)).
% 0.18/0.42 cnf(i_0_17, plain, (divide(X1,X2)=zero|~less_equal(X1,X2))).
% 0.18/0.42 cnf(i_0_18, plain, (less_equal(X1,X2)|divide(X1,X2)!=zero)).
% 0.18/0.42 cnf(i_0_19, plain, (less_equal(divide(X1,X2),X1))).
% 0.18/0.42 cnf(i_0_22, plain, (X1=X2|~less_equal(X2,X1)|~less_equal(X1,X2))).
% 0.18/0.42 cnf(i_0_28, plain, (less_equal(X1,X3)|~less_equal(X2,X3)|~less_equal(X1,X2))).
% 0.18/0.42 cnf(i_0_30, plain, (less_equal(divide(X3,X2),divide(X3,X1))|~less_equal(X1,X2))).
% 0.18/0.42 cnf(i_0_31, plain, (less_equal(divide(X1,X3),divide(X2,X3))|~less_equal(X1,X2))).
% 0.18/0.42 cnf(i_0_29, plain, (less_equal(divide(X1,X3),X2)|~less_equal(divide(X1,X2),X3))).
% 0.18/0.42 cnf(i_0_32, negated_conjecture, (divide(identity,divide(identity,divide(identity,a)))!=divide(identity,a))).
% 0.18/0.42 cnf(i_0_20, plain, (less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)))).
% 0.18/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.42 # Begin printing tableau
% 0.18/0.42 # Found 5 steps
% 0.18/0.42 cnf(i_0_32, negated_conjecture, (divide(identity,divide(identity,divide(identity,a)))!=divide(identity,a)), inference(start_rule)).
% 0.18/0.42 cnf(i_0_33, plain, (divide(identity,divide(identity,divide(identity,a)))!=divide(identity,a)), inference(extension_rule, [i_0_22])).
% 0.18/0.42 cnf(i_0_39, plain, (~less_equal(divide(identity,a),divide(identity,divide(identity,divide(identity,a))))), inference(extension_rule, [i_0_18])).
% 0.18/0.42 cnf(i_0_40, plain, (~less_equal(divide(identity,divide(identity,divide(identity,a))),divide(identity,a))), inference(etableau_closure_rule, [i_0_40, ...])).
% 0.18/0.42 cnf(i_0_53, plain, (divide(divide(identity,a),divide(identity,divide(identity,divide(identity,a))))!=zero), inference(etableau_closure_rule, [i_0_53, ...])).
% 0.18/0.42 # End printing tableau
% 0.18/0.42 # SZS output end
% 0.18/0.42 # Branches closed with saturation will be marked with an "s"
% 0.18/0.42 # Returning from population with 1 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.42 # We now have 1 tableaux to operate on
% 0.18/0.42 # Found closed tableau during pool population.
% 0.18/0.42 # Proof search is over...
% 0.18/0.42 # Freeing feature tree
%------------------------------------------------------------------------------