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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : GRP523-1 : TPTP v8.1.0. Released v2.6.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 : n024.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:06:50 EDT 2022

% Result   : Unsatisfiable 0.21s 0.41s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : GRP523-1 : TPTP v8.1.0. Released v2.6.0.
% 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.14/0.36  % Computer : n024.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 09:58:33 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.21/0.39  # No SInE strategy applied
% 0.21/0.39  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S04AN
% 0.21/0.39  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.21/0.39  #
% 0.21/0.39  # Presaturation interreduction done
% 0.21/0.39  # Number of axioms: 4 Number of unprocessed: 4
% 0.21/0.39  # Tableaux proof search.
% 0.21/0.39  # APR header successfully linked.
% 0.21/0.39  # Hello from C++
% 0.21/0.39  # The folding up rule is enabled...
% 0.21/0.39  # Local unification is enabled...
% 0.21/0.39  # Any saturation attempts will use folding labels...
% 0.21/0.39  # 4 beginning clauses after preprocessing and clausification
% 0.21/0.39  # Creating start rules for all 1 conjectures.
% 0.21/0.39  # There are 1 start rule candidates:
% 0.21/0.39  # Found 4 unit axioms.
% 0.21/0.39  # 1 start rule tableaux created.
% 0.21/0.39  # 0 extension rule candidate clauses
% 0.21/0.39  # 4 unit axiom clauses
% 0.21/0.39  
% 0.21/0.39  # Requested 8, 32 cores available to the main process.
% 0.21/0.39  # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.39  # Creating equality axioms
% 0.21/0.39  # Ran out of tableaux, making start rules for all clauses
% 0.21/0.39  # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.39  # We now have 11 tableaux to operate on
% 0.21/0.41  # There were 1 total branch saturation attempts.
% 0.21/0.41  # There were 0 of these attempts blocked.
% 0.21/0.41  # There were 0 deferred branch saturation attempts.
% 0.21/0.41  # There were 0 free duplicated saturations.
% 0.21/0.41  # There were 1 total successful branch saturations.
% 0.21/0.41  # There were 0 successful branch saturations in interreduction.
% 0.21/0.41  # There were 0 successful branch saturations on the branch.
% 0.21/0.41  # There were 1 successful branch saturations after the branch.
% 0.21/0.41  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.41  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.41  # Begin clausification derivation
% 0.21/0.41  
% 0.21/0.41  # End clausification derivation
% 0.21/0.41  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.41  cnf(i_0_6, plain, (divide(X1,divide(divide(X2,X2),X3))=multiply(X1,X3))).
% 0.21/0.41  cnf(i_0_5, plain, (divide(X1,divide(X2,divide(X3,divide(X1,X2))))=X3)).
% 0.21/0.41  cnf(i_0_7, plain, (inverse(X1)=divide(divide(X2,X2),X1))).
% 0.21/0.41  cnf(i_0_8, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)))).
% 0.21/0.41  cnf(i_0_10, plain, (X4=X4)).
% 0.21/0.41  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.41  # Begin printing tableau
% 0.21/0.41  # Found 5 steps
% 0.21/0.41  cnf(i_0_6, plain, (divide(X8,divide(divide(X7,X7),X6))=multiply(X8,X6)), inference(start_rule)).
% 0.21/0.41  cnf(i_0_17, plain, (divide(X8,divide(divide(X7,X7),X6))=multiply(X8,X6)), inference(extension_rule, [i_0_16])).
% 0.21/0.41  cnf(i_0_35, plain, (inverse(divide(X8,divide(divide(X7,X7),X6)))=inverse(multiply(X8,X6))), inference(extension_rule, [i_0_13])).
% 0.21/0.41  cnf(i_0_43, plain, (inverse(multiply(X8,X6))!=divide(divide(X2,X2),multiply(X8,X6))), inference(closure_rule, [i_0_7])).
% 0.21/0.41  cnf(i_0_41, plain, (inverse(divide(X8,divide(divide(X7,X7),X6)))=divide(divide(X2,X2),multiply(X8,X6))), inference(etableau_closure_rule, [i_0_41, ...])).
% 0.21/0.41  # End printing tableau
% 0.21/0.41  # SZS output end
% 0.21/0.41  # Branches closed with saturation will be marked with an "s"
% 0.21/0.41  # There were 1 total branch saturation attempts.
% 0.21/0.41  # There were 0 of these attempts blocked.
% 0.21/0.41  # There were 0 deferred branch saturation attempts.
% 0.21/0.41  # There were 0 free duplicated saturations.
% 0.21/0.41  # There were 1 total successful branch saturations.
% 0.21/0.41  # There were 0 successful branch saturations in interreduction.
% 0.21/0.41  # There were 0 successful branch saturations on the branch.
% 0.21/0.41  # There were 1 successful branch saturations after the branch.
% 0.21/0.41  # There were 1 total branch saturation attempts.
% 0.21/0.41  # There were 0 of these attempts blocked.
% 0.21/0.41  # There were 0 deferred branch saturation attempts.
% 0.21/0.41  # There were 0 free duplicated saturations.
% 0.21/0.41  # There were 1 total successful branch saturations.
% 0.21/0.41  # There were 0 successful branch saturations in interreduction.
% 0.21/0.41  # There were 0 successful branch saturations on the branch.
% 0.21/0.41  # There were 1 successful branch saturations after the branch.
% 0.21/0.41  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.41  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.41  # Begin clausification derivation
% 0.21/0.41  
% 0.21/0.41  # End clausification derivation
% 0.21/0.41  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.41  cnf(i_0_6, plain, (divide(X1,divide(divide(X2,X2),X3))=multiply(X1,X3))).
% 0.21/0.41  cnf(i_0_5, plain, (divide(X1,divide(X2,divide(X3,divide(X1,X2))))=X3)).
% 0.21/0.41  cnf(i_0_7, plain, (inverse(X1)=divide(divide(X2,X2),X1))).
% 0.21/0.41  cnf(i_0_8, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)))).
% 0.21/0.41  cnf(i_0_10, plain, (X4=X4)).
% 0.21/0.41  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.41  # Begin printing tableau
% 0.21/0.41  # Found 6 steps
% 0.21/0.41  cnf(i_0_6, plain, (divide(a3,divide(divide(multiply(a3,multiply(b3,c3)),multiply(a3,multiply(b3,c3))),multiply(b3,c3)))=multiply(a3,multiply(b3,c3))), inference(start_rule)).
% 0.21/0.41  cnf(i_0_17, plain, (divide(a3,divide(divide(multiply(a3,multiply(b3,c3)),multiply(a3,multiply(b3,c3))),multiply(b3,c3)))=multiply(a3,multiply(b3,c3))), inference(extension_rule, [i_0_13])).
% 0.21/0.41  cnf(i_0_26, plain, (multiply(multiply(a3,b3),c3)=multiply(a3,multiply(b3,c3))), inference(closure_rule, [i_0_8])).
% 0.21/0.41  cnf(i_0_27, plain, (multiply(multiply(a3,b3),c3)!=divide(a3,divide(divide(multiply(a3,multiply(b3,c3)),multiply(a3,multiply(b3,c3))),multiply(b3,c3)))), inference(extension_rule, [i_0_13])).
% 0.21/0.41  cnf(i_0_43, plain, (multiply(a3,multiply(b3,c3))!=divide(a3,divide(divide(multiply(a3,multiply(b3,c3)),multiply(a3,multiply(b3,c3))),multiply(b3,c3)))), inference(closure_rule, [i_0_6])).
% 0.21/0.41  cnf(i_0_42, plain, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3))), inference(etableau_closure_rule, [i_0_42, ...])).
% 0.21/0.41  # End printing tableau
% 0.21/0.41  # SZS output end
% 0.21/0.41  # Branches closed with saturation will be marked with an "s"
% 0.21/0.41  # There were 1 total branch saturation attempts.
% 0.21/0.41  # There were 0 of these attempts blocked.
% 0.21/0.41  # There were 0 deferred branch saturation attempts.
% 0.21/0.41  # There were 0 free duplicated saturations.
% 0.21/0.41  # There were 1 total successful branch saturations.
% 0.21/0.41  # There were 0 successful branch saturations in interreduction.
% 0.21/0.41  # There were 0 successful branch saturations on the branch.
% 0.21/0.41  # There were 1 successful branch saturations after the branch.
% 0.21/0.41  # Child (21775) has found a proof.
% 0.21/0.41  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.41  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.41  # Begin clausification derivation
% 0.21/0.41  
% 0.21/0.41  # End clausification derivation
% 0.21/0.41  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.41  cnf(i_0_6, plain, (divide(X1,divide(divide(X2,X2),X3))=multiply(X1,X3))).
% 0.21/0.41  cnf(i_0_5, plain, (divide(X1,divide(X2,divide(X3,divide(X1,X2))))=X3)).
% 0.21/0.41  cnf(i_0_7, plain, (inverse(X1)=divide(divide(X2,X2),X1))).
% 0.21/0.41  cnf(i_0_8, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)))).
% 0.21/0.41  cnf(i_0_10, plain, (X4=X4)).
% 0.21/0.41  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.21/0.41  # Begin printing tableau
% 0.21/0.41  # Found 6 steps
% 0.21/0.41  cnf(i_0_6, plain, (divide(X8,divide(divide(X9,X9),X10))=multiply(X8,X10)), inference(start_rule)).
% 0.21/0.41  cnf(i_0_17, plain, (divide(X8,divide(divide(X9,X9),X10))=multiply(X8,X10)), inference(extension_rule, [i_0_14])).
% 0.21/0.41  cnf(i_0_30, plain, (divide(X20,divide(divide(X19,X19),X18))!=multiply(X20,X18)), inference(closure_rule, [i_0_6])).
% 0.21/0.41  cnf(i_0_29, plain, (divide(divide(X20,divide(divide(X19,X19),X18)),divide(X8,divide(divide(X9,X9),X10)))=divide(multiply(X20,X18),multiply(X8,X10))), inference(extension_rule, [i_0_15])).
% 0.21/0.41  cnf(i_0_93, plain, (divide(X1,divide(divide(X2,X2),X3))!=multiply(X1,X3)), inference(closure_rule, [i_0_6])).
% 0.21/0.41  cnf(i_0_91, plain, (multiply(divide(divide(X20,divide(divide(X19,X19),X18)),divide(X8,divide(divide(X9,X9),X10))),divide(X1,divide(divide(X2,X2),X3)))=multiply(divide(multiply(X20,X18),multiply(X8,X10)),multiply(X1,X3))), inference(etableau_closure_rule, [i_0_91, ...])).
% 0.21/0.41  # End printing tableau
% 0.21/0.41  # SZS output end
% 0.21/0.41  # Branches closed with saturation will be marked with an "s"
% 0.21/0.41  
% 0.21/0.41  # Proof search is over...
% 0.21/0.41  # Freeing feature tree
%------------------------------------------------------------------------------