TSTP Solution File: GRP074-1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : GRP074-1 : TPTP v8.1.0. Bugfixed v2.3.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 : n016.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 09:04:17 EDT 2022

% Result   : Unsatisfiable 0.19s 0.44s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP074-1 : TPTP v8.1.0. Bugfixed v2.3.0.
% 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 : n016.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 : Tue Jun 14 03:58:30 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.36  # No SInE strategy applied
% 0.19/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.36  #
% 0.19/0.36  # Presaturation interreduction done
% 0.19/0.36  # Number of axioms: 2 Number of unprocessed: 2
% 0.19/0.36  # Tableaux proof search.
% 0.19/0.36  # APR header successfully linked.
% 0.19/0.36  # Hello from C++
% 0.19/0.40  # The folding up rule is enabled...
% 0.19/0.40  # Local unification is enabled...
% 0.19/0.40  # Any saturation attempts will use folding labels...
% 0.19/0.40  # 2 beginning clauses after preprocessing and clausification
% 0.19/0.40  # Creating start rules for all 1 conjectures.
% 0.19/0.40  # There are 1 start rule candidates:
% 0.19/0.40  # Found 1 unit axioms.
% 0.19/0.40  # 1 start rule tableaux created.
% 0.19/0.40  # 1 extension rule candidate clauses
% 0.19/0.40  # 1 unit axiom clauses
% 0.19/0.40  
% 0.19/0.40  # Requested 8, 32 cores available to the main process.
% 0.19/0.40  # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.40  # Creating equality axioms
% 0.19/0.40  # Ran out of tableaux, making start rules for all clauses
% 0.19/0.44  # There were 2 total branch saturation attempts.
% 0.19/0.44  # There were 0 of these attempts blocked.
% 0.19/0.44  # There were 0 deferred branch saturation attempts.
% 0.19/0.44  # There were 0 free duplicated saturations.
% 0.19/0.44  # There were 2 total successful branch saturations.
% 0.19/0.44  # There were 0 successful branch saturations in interreduction.
% 0.19/0.44  # There were 0 successful branch saturations on the branch.
% 0.19/0.44  # There were 2 successful branch saturations after the branch.
% 0.19/0.44  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44  # Begin clausification derivation
% 0.19/0.44  
% 0.19/0.44  # End clausification derivation
% 0.19/0.44  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.44  cnf(i_0_4, plain, (divide(inverse(divide(divide(divide(X1,X1),X2),divide(X3,divide(X2,X4)))),X4)=X3)).
% 0.19/0.44  cnf(i_0_6, negated_conjecture, (divide(divide(a3,inverse(b3)),inverse(c3))!=divide(a3,inverse(divide(b3,inverse(c3))))|divide(inverse(a1),inverse(a1))!=divide(inverse(b1),inverse(b1))|divide(divide(inverse(b2),inverse(b2)),inverse(a2))!=a2)).
% 0.19/0.44  cnf(i_0_19, plain, (X5=X5)).
% 0.19/0.44  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.44  # Begin printing tableau
% 0.19/0.44  # Found 5 steps
% 0.19/0.44  cnf(i_0_4, plain, (divide(inverse(divide(divide(divide(X15,X15),X16),divide(X18,divide(X16,X17)))),X17)=X18), inference(start_rule)).
% 0.19/0.44  cnf(i_0_25, plain, (divide(inverse(divide(divide(divide(X15,X15),X16),divide(X18,divide(X16,X17)))),X17)=X18), inference(extension_rule, [i_0_24])).
% 0.19/0.44  cnf(i_0_43, plain, (inverse(divide(inverse(divide(divide(divide(X15,X15),X16),divide(X18,divide(X16,X17)))),X17))=inverse(X18)), inference(extension_rule, [i_0_23])).
% 0.19/0.44  cnf(i_0_56, plain, ($false), inference(closure_rule, [i_0_19])).
% 0.19/0.44  cnf(i_0_55, plain, (divide(X2,inverse(divide(inverse(divide(divide(divide(X15,X15),X16),divide(X18,divide(X16,X17)))),X17)))=divide(X2,inverse(X18))), inference(etableau_closure_rule, [i_0_55, ...])).
% 0.19/0.44  # End printing tableau
% 0.19/0.44  # SZS output end
% 0.19/0.44  # Branches closed with saturation will be marked with an "s"
% 0.19/0.44  # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.44  # We now have 9 tableaux to operate on
% 0.19/0.44  # Found closed tableau during pool population.
% 0.19/0.44  # Proof search is over...
% 0.19/0.44  # Freeing feature tree
%------------------------------------------------------------------------------