TSTP Solution File: HEN011-5 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : HEN011-5 : 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 : n015.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:35 EDT 2022

% Result   : Unsatisfiable 31.79s 31.97s
% Output   : CNFRefutation 31.79s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : HEN011-5 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.14  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.35  % Computer : n015.cluster.edu
% 0.12/0.35  % Model    : x86_64 x86_64
% 0.12/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35  % Memory   : 8042.1875MB
% 0.12/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit : 300
% 0.12/0.35  % WCLimit  : 600
% 0.12/0.35  % DateTime : Fri Jul  1 13:50:43 EDT 2022
% 0.12/0.35  % CPUTime  : 
% 0.19/0.38  # No SInE strategy applied
% 0.19/0.38  # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.19/0.38  # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.19/0.38  #
% 0.19/0.38  # Number of axioms: 14 Number of unprocessed: 14
% 0.19/0.38  # Tableaux proof search.
% 0.19/0.38  # APR header successfully linked.
% 0.19/0.38  # Hello from C++
% 5.98/6.21  # The folding up rule is enabled...
% 5.98/6.21  # Local unification is enabled...
% 5.98/6.21  # Any saturation attempts will use folding labels...
% 5.98/6.21  # 14 beginning clauses after preprocessing and clausification
% 5.98/6.21  # Creating start rules for all 1 conjectures.
% 5.98/6.21  # There are 1 start rule candidates:
% 5.98/6.21  # Found 9 unit axioms.
% 5.98/6.21  # 1 start rule tableaux created.
% 5.98/6.21  # 5 extension rule candidate clauses
% 5.98/6.21  # 9 unit axiom clauses
% 5.98/6.21  
% 5.98/6.21  # Requested 8, 32 cores available to the main process.
% 5.98/6.21  # There are not enough tableaux to fork, creating more from the initial 1
% 31.79/31.97  # There were 5 total branch saturation attempts.
% 31.79/31.97  # There were 2 of these attempts blocked.
% 31.79/31.97  # There were 0 deferred branch saturation attempts.
% 31.79/31.97  # There were 0 free duplicated saturations.
% 31.79/31.97  # There were 2 total successful branch saturations.
% 31.79/31.97  # There were 0 successful branch saturations in interreduction.
% 31.79/31.97  # There were 0 successful branch saturations on the branch.
% 31.79/31.97  # There were 2 successful branch saturations after the branch.
% 31.79/31.97  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 31.79/31.97  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 31.79/31.97  # Begin clausification derivation
% 31.79/31.97  
% 31.79/31.97  # End clausification derivation
% 31.79/31.97  # Begin listing active clauses obtained from FOF to CNF conversion
% 31.79/31.97  cnf(i_0_19, plain, (divide(X1,identity)=zero)).
% 31.79/31.97  cnf(i_0_17, plain, (divide(zero,X1)=zero)).
% 31.79/31.97  cnf(i_0_21, plain, (divide(X1,zero)=X1)).
% 31.79/31.97  cnf(i_0_20, plain, (divide(X1,X1)=zero)).
% 31.79/31.97  cnf(i_0_15, plain, (divide(divide(X1,X2),X1)=zero)).
% 31.79/31.97  cnf(i_0_18, plain, (X1=X2|divide(X2,X1)!=zero|divide(X1,X2)!=zero)).
% 31.79/31.97  cnf(i_0_22, plain, (divide(X1,X3)=zero|divide(X2,X3)!=zero|divide(X1,X2)!=zero)).
% 31.79/31.97  cnf(i_0_24, plain, (divide(divide(X3,X2),divide(X3,X1))=zero|divide(X1,X2)!=zero)).
% 31.79/31.97  cnf(i_0_25, plain, (divide(divide(X1,X3),divide(X2,X3))=zero|divide(X1,X2)!=zero)).
% 31.79/31.97  cnf(i_0_26, plain, (divide(identity,divide(identity,divide(identity,X1)))=divide(identity,X1))).
% 31.79/31.97  cnf(i_0_23, plain, (divide(divide(X1,X3),X2)=zero|divide(divide(X1,X2),X3)!=zero)).
% 31.79/31.97  cnf(i_0_27, plain, (divide(divide(identity,X1),divide(identity,divide(identity,X1)))=divide(identity,X1))).
% 31.79/31.97  cnf(i_0_16, plain, (divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2))=zero)).
% 31.79/31.97  cnf(i_0_28, negated_conjecture, (divide(divide(identity,a),divide(identity,divide(identity,b)))!=divide(divide(identity,b),divide(identity,divide(identity,a))))).
% 31.79/31.97  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 31.79/31.97  # Begin printing tableau
% 31.79/31.97  # Found 6 steps
% 31.79/31.97  cnf(i_0_28, negated_conjecture, (divide(divide(identity,a),divide(identity,divide(identity,b)))!=divide(divide(identity,b),divide(identity,divide(identity,a)))), inference(start_rule)).
% 31.79/31.97  cnf(i_0_29, plain, (divide(divide(identity,a),divide(identity,divide(identity,b)))!=divide(divide(identity,b),divide(identity,divide(identity,a)))), inference(extension_rule, [i_0_18])).
% 31.79/31.97  cnf(i_0_32, plain, (divide(divide(divide(identity,a),divide(identity,divide(identity,b))),divide(divide(identity,b),divide(identity,divide(identity,a))))!=zero), inference(extension_rule, [i_0_18])).
% 31.79/31.97  cnf(i_0_641905, plain, (divide(zero,divide(divide(divide(identity,a),divide(identity,divide(identity,b))),divide(divide(identity,b),divide(identity,divide(identity,a)))))!=zero), inference(closure_rule, [i_0_17])).
% 31.79/31.97  cnf(i_0_31, plain, (divide(divide(divide(identity,b),divide(identity,divide(identity,a))),divide(divide(identity,a),divide(identity,divide(identity,b))))!=zero), inference(etableau_closure_rule, [i_0_31, ...])).
% 31.79/31.97  cnf(i_0_641906, plain, (divide(divide(divide(divide(identity,a),divide(identity,divide(identity,b))),divide(divide(identity,b),divide(identity,divide(identity,a)))),zero)!=zero), inference(etableau_closure_rule, [i_0_641906, ...])).
% 31.79/31.97  # End printing tableau
% 31.79/31.97  # SZS output end
% 31.79/31.97  # Branches closed with saturation will be marked with an "s"
% 31.79/31.97  # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 31.79/31.97  # We now have 4 tableaux to operate on
% 31.79/31.97  # Found closed tableau during pool population.
% 31.79/31.97  # Proof search is over...
% 31.79/31.97  # Freeing feature tree
%------------------------------------------------------------------------------