TSTP Solution File: GRP654+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP654+1 : TPTP v8.1.0. Released v4.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 : 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 09:07:43 EDT 2022
% Result : Theorem 27.20s 3.78s
% Output : CNFRefutation 27.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP654+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 20:29:38 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.38 # No SInE strategy applied
% 0.21/0.38 # Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.21/0.38 # and selection function SelectNewComplexAHP.
% 0.21/0.38 #
% 0.21/0.38 # Number of axioms: 6 Number of unprocessed: 6
% 0.21/0.38 # Tableaux proof search.
% 0.21/0.38 # APR header successfully linked.
% 0.21/0.38 # Hello from C++
% 0.21/0.38 # The folding up rule is enabled...
% 0.21/0.38 # Local unification is enabled...
% 0.21/0.38 # Any saturation attempts will use folding labels...
% 0.21/0.38 # 6 beginning clauses after preprocessing and clausification
% 0.21/0.38 # Creating start rules for all 1 conjectures.
% 0.21/0.38 # There are 1 start rule candidates:
% 0.21/0.38 # Found 5 unit axioms.
% 0.21/0.38 # 1 start rule tableaux created.
% 0.21/0.38 # 1 extension rule candidate clauses
% 0.21/0.38 # 5 unit axiom clauses
% 0.21/0.38
% 0.21/0.38 # Requested 8, 32 cores available to the main process.
% 0.21/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.38 # Creating equality axioms
% 0.21/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.21/0.38 # Returning from population with 13 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.38 # We now have 13 tableaux to operate on
% 27.20/3.78 # There were 1 total branch saturation attempts.
% 27.20/3.78 # There were 0 of these attempts blocked.
% 27.20/3.78 # There were 0 deferred branch saturation attempts.
% 27.20/3.78 # There were 0 free duplicated saturations.
% 27.20/3.78 # There were 1 total successful branch saturations.
% 27.20/3.78 # There were 0 successful branch saturations in interreduction.
% 27.20/3.78 # There were 0 successful branch saturations on the branch.
% 27.20/3.78 # There were 1 successful branch saturations after the branch.
% 27.20/3.78 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.20/3.78 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.20/3.78 # Begin clausification derivation
% 27.20/3.78
% 27.20/3.78 # End clausification derivation
% 27.20/3.78 # Begin listing active clauses obtained from FOF to CNF conversion
% 27.20/3.78 cnf(i_0_2, plain, (ld(X1,mult(X1,X2))=X2)).
% 27.20/3.78 cnf(i_0_1, plain, (mult(X1,ld(X1,X2))=X2)).
% 27.20/3.78 cnf(i_0_3, plain, (mult(rd(X1,X2),X2)=X1)).
% 27.20/3.78 cnf(i_0_4, plain, (rd(mult(X1,X2),X2)=X1)).
% 27.20/3.78 cnf(i_0_6, negated_conjecture, (mult(X1,esk2_1(X1))!=esk2_1(X1)|mult(esk1_1(X1),X1)!=esk1_1(X1))).
% 27.20/3.78 cnf(i_0_5, plain, (mult(mult(mult(X1,X2),X1),X3)=mult(X1,mult(X2,mult(X1,X3))))).
% 27.20/3.78 cnf(i_0_13, plain, (X20=X20)).
% 27.20/3.78 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 27.20/3.78 # Begin printing tableau
% 27.20/3.78 # Found 6 steps
% 27.20/3.78 cnf(i_0_2, plain, (ld(X9,mult(X9,mult(X4,X5)))=mult(X4,X5)), inference(start_rule)).
% 27.20/3.78 cnf(i_0_20, plain, (ld(X9,mult(X9,mult(X4,X5)))=mult(X4,X5)), inference(extension_rule, [i_0_17])).
% 27.20/3.78 cnf(i_0_38, plain, (ld(X4,mult(X4,X4))!=X4), inference(closure_rule, [i_0_2])).
% 27.20/3.78 cnf(i_0_37, plain, (ld(ld(X4,mult(X4,X4)),ld(X9,mult(X9,mult(X4,X5))))=ld(X4,mult(X4,X5))), inference(extension_rule, [i_0_16])).
% 27.20/3.78 cnf(i_0_54, plain, (ld(X4,mult(X4,X5))!=X5), inference(closure_rule, [i_0_2])).
% 27.20/3.78 cnf(i_0_52, plain, (ld(ld(X4,mult(X4,X4)),ld(X9,mult(X9,mult(X4,X5))))=X5), inference(etableau_closure_rule, [i_0_52, ...])).
% 27.20/3.78 # End printing tableau
% 27.20/3.78 # SZS output end
% 27.20/3.78 # Branches closed with saturation will be marked with an "s"
% 27.20/3.79 # There were 1 total branch saturation attempts.
% 27.20/3.79 # There were 0 of these attempts blocked.
% 27.20/3.79 # There were 0 deferred branch saturation attempts.
% 27.20/3.79 # There were 0 free duplicated saturations.
% 27.20/3.79 # There were 1 total successful branch saturations.
% 27.20/3.79 # There were 0 successful branch saturations in interreduction.
% 27.20/3.79 # There were 0 successful branch saturations on the branch.
% 27.20/3.79 # There were 1 successful branch saturations after the branch.
% 27.20/3.79 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.20/3.79 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.20/3.79 # Begin clausification derivation
% 27.20/3.79
% 27.20/3.79 # End clausification derivation
% 27.20/3.79 # Begin listing active clauses obtained from FOF to CNF conversion
% 27.20/3.79 cnf(i_0_2, plain, (ld(X1,mult(X1,X2))=X2)).
% 27.20/3.79 cnf(i_0_1, plain, (mult(X1,ld(X1,X2))=X2)).
% 27.20/3.79 cnf(i_0_3, plain, (mult(rd(X1,X2),X2)=X1)).
% 27.20/3.79 cnf(i_0_4, plain, (rd(mult(X1,X2),X2)=X1)).
% 27.20/3.79 cnf(i_0_6, negated_conjecture, (mult(X1,esk2_1(X1))!=esk2_1(X1)|mult(esk1_1(X1),X1)!=esk1_1(X1))).
% 27.20/3.79 cnf(i_0_5, plain, (mult(mult(mult(X1,X2),X1),X3)=mult(X1,mult(X2,mult(X1,X3))))).
% 27.20/3.79 cnf(i_0_13, plain, (X20=X20)).
% 27.20/3.79 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 27.20/3.79 # Begin printing tableau
% 27.20/3.79 # Found 6 steps
% 27.20/3.79 cnf(i_0_2, plain, (ld(X7,mult(X7,X4))=X4), inference(start_rule)).
% 27.20/3.79 cnf(i_0_20, plain, (ld(X7,mult(X7,X4))=X4), inference(extension_rule, [i_0_17])).
% 27.20/3.79 cnf(i_0_39, plain, (ld(X4,mult(X4,mult(X4,X5)))!=mult(X4,X5)), inference(closure_rule, [i_0_2])).
% 27.20/3.79 cnf(i_0_37, plain, (ld(ld(X7,mult(X7,X4)),ld(X4,mult(X4,mult(X4,X5))))=ld(X4,mult(X4,X5))), inference(extension_rule, [i_0_16])).
% 27.20/3.79 cnf(i_0_54, plain, (ld(X4,mult(X4,X5))!=X5), inference(closure_rule, [i_0_2])).
% 27.20/3.79 cnf(i_0_52, plain, (ld(ld(X7,mult(X7,X4)),ld(X4,mult(X4,mult(X4,X5))))=X5), inference(etableau_closure_rule, [i_0_52, ...])).
% 27.20/3.79 # End printing tableau
% 27.20/3.79 # SZS output end
% 27.20/3.79 # Branches closed with saturation will be marked with an "s"
% 27.20/3.79 # Child (7081) has found a proof.
% 27.20/3.79
% 27.20/3.79 # Proof search is over...
% 27.20/3.79 # Freeing feature tree
%------------------------------------------------------------------------------