TSTP Solution File: GRP658-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP658-10 : TPTP v8.1.0. Released v8.1.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 : n005.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:47 EDT 2022
% Result : Unsatisfiable 0.09s 0.28s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.06 % Problem : GRP658-10 : TPTP v8.1.0. Released v8.1.0.
% 0.02/0.07 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.06/0.25 % Computer : n005.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 600
% 0.06/0.25 % DateTime : Tue Jun 14 02:00:23 EDT 2022
% 0.06/0.25 % CPUTime :
% 0.09/0.27 # No SInE strategy applied
% 0.09/0.27 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.09/0.27 # and selection function SelectNewComplexAHP.
% 0.09/0.27 #
% 0.09/0.27 # Presaturation interreduction done
% 0.09/0.27 # Number of axioms: 6 Number of unprocessed: 6
% 0.09/0.27 # Tableaux proof search.
% 0.09/0.27 # APR header successfully linked.
% 0.09/0.27 # Hello from C++
% 0.09/0.27 # The folding up rule is enabled...
% 0.09/0.27 # Local unification is enabled...
% 0.09/0.27 # Any saturation attempts will use folding labels...
% 0.09/0.27 # 6 beginning clauses after preprocessing and clausification
% 0.09/0.27 # Creating start rules for all 1 conjectures.
% 0.09/0.27 # There are 1 start rule candidates:
% 0.09/0.27 # Found 6 unit axioms.
% 0.09/0.27 # 1 start rule tableaux created.
% 0.09/0.27 # 0 extension rule candidate clauses
% 0.09/0.27 # 6 unit axiom clauses
% 0.09/0.27
% 0.09/0.27 # Requested 8, 32 cores available to the main process.
% 0.09/0.27 # There are not enough tableaux to fork, creating more from the initial 1
% 0.09/0.27 # Creating equality axioms
% 0.09/0.27 # Ran out of tableaux, making start rules for all clauses
% 0.09/0.27 # Returning from population with 17 new_tableaux and 0 remaining starting tableaux.
% 0.09/0.27 # We now have 17 tableaux to operate on
% 0.09/0.28 # There were 1 total branch saturation attempts.
% 0.09/0.28 # There were 0 of these attempts blocked.
% 0.09/0.28 # There were 0 deferred branch saturation attempts.
% 0.09/0.28 # There were 0 free duplicated saturations.
% 0.09/0.28 # There were 1 total successful branch saturations.
% 0.09/0.28 # There were 0 successful branch saturations in interreduction.
% 0.09/0.28 # There were 0 successful branch saturations on the branch.
% 0.09/0.28 # There were 1 successful branch saturations after the branch.
% 0.09/0.28 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.28 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.28 # Begin clausification derivation
% 0.09/0.28
% 0.09/0.28 # End clausification derivation
% 0.09/0.28 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.09/0.28 cnf(i_0_8, plain, (ld(X1,mult(X1,X2))=X2)).
% 0.09/0.28 cnf(i_0_7, plain, (mult(X1,ld(X1,X2))=X2)).
% 0.09/0.28 cnf(i_0_9, plain, (mult(rd(X1,X2),X2)=X1)).
% 0.09/0.28 cnf(i_0_10, plain, (rd(mult(X1,X2),X2)=X1)).
% 0.09/0.28 cnf(i_0_11, plain, (mult(mult(X1,mult(X2,X2)),X3)=mult(mult(X1,X2),mult(X2,X3)))).
% 0.09/0.28 cnf(i_0_12, negated_conjecture, (tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1))!=tuple(x1(X1),x1_2(X1)))).
% 0.09/0.28 cnf(i_0_14, plain, (X4=X4)).
% 0.09/0.28 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.09/0.28 # Begin printing tableau
% 0.09/0.28 # Found 5 steps
% 0.09/0.28 cnf(i_0_8, plain, (ld(X5,mult(X5,X4))=X4), inference(start_rule)).
% 0.09/0.28 cnf(i_0_24, plain, (ld(X5,mult(X5,X4))=X4), inference(extension_rule, [i_0_22])).
% 0.09/0.28 cnf(i_0_49, plain, (x1_2(ld(X5,mult(X5,X4)))=x1_2(X4)), inference(extension_rule, [i_0_17])).
% 0.09/0.28 cnf(i_0_60, plain, (x1_2(X4)!=ld(X1,mult(X1,x1_2(X4)))), inference(closure_rule, [i_0_8])).
% 0.09/0.28 cnf(i_0_58, plain, (x1_2(ld(X5,mult(X5,X4)))=ld(X1,mult(X1,x1_2(X4)))), inference(etableau_closure_rule, [i_0_58, ...])).
% 0.09/0.28 # End printing tableau
% 0.09/0.28 # SZS output end
% 0.09/0.28 # Branches closed with saturation will be marked with an "s"
% 0.09/0.28 # There were 1 total branch saturation attempts.
% 0.09/0.28 # There were 0 of these attempts blocked.
% 0.09/0.28 # There were 0 deferred branch saturation attempts.
% 0.09/0.28 # There were 0 free duplicated saturations.
% 0.09/0.28 # There were 1 total successful branch saturations.
% 0.09/0.28 # There were 0 successful branch saturations in interreduction.
% 0.09/0.28 # There were 0 successful branch saturations on the branch.
% 0.09/0.28 # There were 1 successful branch saturations after the branch.
% 0.09/0.28 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.28 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.28 # Begin clausification derivation
% 0.09/0.28
% 0.09/0.28 # End clausification derivation
% 0.09/0.28 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.09/0.28 cnf(i_0_8, plain, (ld(X1,mult(X1,X2))=X2)).
% 0.09/0.28 cnf(i_0_7, plain, (mult(X1,ld(X1,X2))=X2)).
% 0.09/0.28 cnf(i_0_9, plain, (mult(rd(X1,X2),X2)=X1)).
% 0.09/0.28 cnf(i_0_10, plain, (rd(mult(X1,X2),X2)=X1)).
% 0.09/0.28 cnf(i_0_11, plain, (mult(mult(X1,mult(X2,X2)),X3)=mult(mult(X1,X2),mult(X2,X3)))).
% 0.09/0.28 cnf(i_0_12, negated_conjecture, (tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1))!=tuple(x1(X1),x1_2(X1)))).
% 0.09/0.28 cnf(i_0_14, plain, (X4=X4)).
% 0.09/0.28 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.09/0.28 # Begin printing tableau
% 0.09/0.28 # Found 6 steps
% 0.09/0.28 cnf(i_0_8, plain, (ld(X9,mult(X9,X6))=X6), inference(start_rule)).
% 0.09/0.28 cnf(i_0_24, plain, (ld(X9,mult(X9,X6))=X6), inference(extension_rule, [i_0_23])).
% 0.09/0.28 cnf(i_0_52, plain, (ld(X1,mult(X1,X4))!=X4), inference(closure_rule, [i_0_8])).
% 0.09/0.28 cnf(i_0_51, plain, (tuple(ld(X1,mult(X1,X4)),ld(X9,mult(X9,X6)))=tuple(X4,X6)), inference(extension_rule, [i_0_17])).
% 0.09/0.28 cnf(i_0_60, plain, (tuple(X4,X6)!=ld(X1,mult(X1,tuple(X4,X6)))), inference(closure_rule, [i_0_8])).
% 0.09/0.28 cnf(i_0_58, plain, (tuple(ld(X1,mult(X1,X4)),ld(X9,mult(X9,X6)))=ld(X1,mult(X1,tuple(X4,X6)))), inference(etableau_closure_rule, [i_0_58, ...])).
% 0.09/0.28 # End printing tableau
% 0.09/0.28 # SZS output end
% 0.09/0.28 # Branches closed with saturation will be marked with an "s"
% 0.09/0.28 # There were 1 total branch saturation attempts.
% 0.09/0.28 # There were 0 of these attempts blocked.
% 0.09/0.28 # There were 0 deferred branch saturation attempts.
% 0.09/0.28 # There were 0 free duplicated saturations.
% 0.09/0.28 # There were 1 total successful branch saturations.
% 0.09/0.28 # There were 0 successful branch saturations in interreduction.
% 0.09/0.28 # There were 0 successful branch saturations on the branch.
% 0.09/0.28 # There were 1 successful branch saturations after the branch.
% 0.09/0.28 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.28 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.28 # Begin clausification derivation
% 0.09/0.28
% 0.09/0.28 # End clausification derivation
% 0.09/0.28 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.09/0.28 cnf(i_0_8, plain, (ld(X1,mult(X1,X2))=X2)).
% 0.09/0.28 cnf(i_0_7, plain, (mult(X1,ld(X1,X2))=X2)).
% 0.09/0.28 cnf(i_0_9, plain, (mult(rd(X1,X2),X2)=X1)).
% 0.09/0.28 cnf(i_0_10, plain, (rd(mult(X1,X2),X2)=X1)).
% 0.09/0.28 cnf(i_0_11, plain, (mult(mult(X1,mult(X2,X2)),X3)=mult(mult(X1,X2),mult(X2,X3)))).
% 0.09/0.28 cnf(i_0_12, negated_conjecture, (tuple(mult(X1,x1(X1)),mult(x1_2(X1),X1))!=tuple(x1(X1),x1_2(X1)))).
% 0.09/0.28 cnf(i_0_14, plain, (X4=X4)).
% 0.09/0.28 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.09/0.28 # Begin printing tableau
% 0.09/0.28 # Found 6 steps
% 0.09/0.28 cnf(i_0_8, plain, (ld(X7,mult(X7,X4))=X4), inference(start_rule)).
% 0.09/0.28 cnf(i_0_24, plain, (ld(X7,mult(X7,X4))=X4), inference(extension_rule, [i_0_23])).
% 0.09/0.28 cnf(i_0_53, plain, (ld(X1,mult(X1,X6))!=X6), inference(closure_rule, [i_0_8])).
% 0.09/0.28 cnf(i_0_51, plain, (tuple(ld(X7,mult(X7,X4)),ld(X1,mult(X1,X6)))=tuple(X4,X6)), inference(extension_rule, [i_0_17])).
% 0.09/0.28 cnf(i_0_60, plain, (tuple(X4,X6)!=ld(X1,mult(X1,tuple(X4,X6)))), inference(closure_rule, [i_0_8])).
% 0.09/0.28 cnf(i_0_58, plain, (tuple(ld(X7,mult(X7,X4)),ld(X1,mult(X1,X6)))=ld(X1,mult(X1,tuple(X4,X6)))), inference(etableau_closure_rule, [i_0_58, ...])).
% 0.09/0.28 # End printing tableau
% 0.09/0.28 # SZS output end
% 0.09/0.28 # Branches closed with saturation will be marked with an "s"
% 0.09/0.28 # Child (21243) has found a proof.
% 0.09/0.28
% 0.09/0.28 # Proof search is over...
% 0.09/0.28 # Freeing feature tree
%------------------------------------------------------------------------------