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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : GRP058-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 : n019.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:13 EDT 2022

% Result   : Unsatisfiable 0.23s 0.49s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : GRP058-1 : TPTP v8.1.0. Released v1.0.0.
% 0.14/0.14  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.36  % Computer : n019.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Tue Jun 14 04:19:54 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.14/0.39  # No SInE strategy applied
% 0.14/0.39  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.39  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.39  #
% 0.14/0.39  # Presaturation interreduction done
% 0.14/0.39  # Number of axioms: 2 Number of unprocessed: 2
% 0.14/0.39  # Tableaux proof search.
% 0.14/0.39  # APR header successfully linked.
% 0.14/0.39  # Hello from C++
% 0.23/0.48  # The folding up rule is enabled...
% 0.23/0.48  # Local unification is enabled...
% 0.23/0.48  # Any saturation attempts will use folding labels...
% 0.23/0.48  # 2 beginning clauses after preprocessing and clausification
% 0.23/0.48  # Creating start rules for all 1 conjectures.
% 0.23/0.48  # There are 1 start rule candidates:
% 0.23/0.48  # Found 1 unit axioms.
% 0.23/0.48  # 1 start rule tableaux created.
% 0.23/0.48  # 1 extension rule candidate clauses
% 0.23/0.48  # 1 unit axiom clauses
% 0.23/0.48  
% 0.23/0.48  # Requested 8, 32 cores available to the main process.
% 0.23/0.48  # There are not enough tableaux to fork, creating more from the initial 1
% 0.23/0.48  # Creating equality axioms
% 0.23/0.48  # Ran out of tableaux, making start rules for all clauses
% 0.23/0.49  # There were 1 total branch saturation attempts.
% 0.23/0.49  # There were 0 of these attempts blocked.
% 0.23/0.49  # There were 0 deferred branch saturation attempts.
% 0.23/0.49  # There were 0 free duplicated saturations.
% 0.23/0.49  # There were 1 total successful branch saturations.
% 0.23/0.49  # There were 0 successful branch saturations in interreduction.
% 0.23/0.49  # There were 0 successful branch saturations on the branch.
% 0.23/0.49  # There were 1 successful branch saturations after the branch.
% 0.23/0.49  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.49  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.49  # Begin clausification derivation
% 0.23/0.49  
% 0.23/0.49  # End clausification derivation
% 0.23/0.49  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.23/0.49  cnf(i_0_3, plain, (multiply(X1,inverse(multiply(X2,multiply(multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,X2))),X1))))=X4)).
% 0.23/0.49  cnf(i_0_4, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3))|multiply(inverse(a1),a1)!=multiply(inverse(b1),b1)|multiply(multiply(inverse(b2),b2),a2)!=a2)).
% 0.23/0.49  cnf(i_0_17, plain, (X5=X5)).
% 0.23/0.49  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.23/0.49  # Begin printing tableau
% 0.23/0.49  # Found 6 steps
% 0.23/0.49  cnf(i_0_3, plain, (multiply(X13,inverse(multiply(X12,multiply(multiply(multiply(X11,inverse(X11)),inverse(multiply(inverse(multiply(X2,multiply(multiply(multiply(X3,inverse(X3)),inverse(multiply(X10,X2))),X15))),X12))),X13))))=inverse(multiply(X2,multiply(multiply(multiply(X3,inverse(X3)),inverse(multiply(X10,X2))),X15)))), inference(start_rule)).
% 0.23/0.49  cnf(i_0_23, plain, (multiply(X13,inverse(multiply(X12,multiply(multiply(multiply(X11,inverse(X11)),inverse(multiply(inverse(multiply(X2,multiply(multiply(multiply(X3,inverse(X3)),inverse(multiply(X10,X2))),X15))),X12))),X13))))=inverse(multiply(X2,multiply(multiply(multiply(X3,inverse(X3)),inverse(multiply(X10,X2))),X15)))), inference(extension_rule, [i_0_22])).
% 0.23/0.49  cnf(i_0_41, plain, (multiply(X21,inverse(multiply(X20,multiply(multiply(multiply(X16,inverse(X16)),inverse(multiply(X15,X20))),X21))))!=X15), inference(closure_rule, [i_0_3])).
% 0.23/0.49  cnf(i_0_40, plain, (multiply(multiply(X21,inverse(multiply(X20,multiply(multiply(multiply(X16,inverse(X16)),inverse(multiply(X15,X20))),X21)))),multiply(X13,inverse(multiply(X12,multiply(multiply(multiply(X11,inverse(X11)),inverse(multiply(inverse(multiply(X2,multiply(multiply(multiply(X3,inverse(X3)),inverse(multiply(X10,X2))),X15))),X12))),X13)))))=multiply(X15,inverse(multiply(X2,multiply(multiply(multiply(X3,inverse(X3)),inverse(multiply(X10,X2))),X15))))), inference(extension_rule, [i_0_20])).
% 0.23/0.49  cnf(i_0_52, plain, (multiply(X15,inverse(multiply(X2,multiply(multiply(multiply(X3,inverse(X3)),inverse(multiply(X10,X2))),X15))))!=X10), inference(closure_rule, [i_0_3])).
% 0.23/0.49  cnf(i_0_50, plain, (multiply(multiply(X21,inverse(multiply(X20,multiply(multiply(multiply(X16,inverse(X16)),inverse(multiply(X15,X20))),X21)))),multiply(X13,inverse(multiply(X12,multiply(multiply(multiply(X11,inverse(X11)),inverse(multiply(inverse(multiply(X2,multiply(multiply(multiply(X3,inverse(X3)),inverse(multiply(X10,X2))),X15))),X12))),X13)))))=X10), inference(etableau_closure_rule, [i_0_50, ...])).
% 0.23/0.49  # End printing tableau
% 0.23/0.49  # SZS output end
% 0.23/0.49  # Branches closed with saturation will be marked with an "s"
% 0.23/0.49  # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.23/0.49  # We now have 7 tableaux to operate on
% 0.23/0.49  # Found closed tableau during pool population.
% 0.23/0.49  # Proof search is over...
% 0.23/0.49  # Freeing feature tree
%------------------------------------------------------------------------------