TSTP Solution File: GRP048-10 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP048-10 : TPTP v8.1.0. Released v7.5.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 : n025.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:10 EDT 2022
% Result : Unsatisfiable 22.81s 3.30s
% Output : CNFRefutation 22.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP048-10 : TPTP v8.1.0. Released v7.5.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 07:17:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.13/0.36 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.13/0.36 #
% 0.13/0.36 # Number of axioms: 10 Number of unprocessed: 10
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.36 # The folding up rule is enabled...
% 0.13/0.36 # Local unification is enabled...
% 0.13/0.36 # Any saturation attempts will use folding labels...
% 0.13/0.36 # 10 beginning clauses after preprocessing and clausification
% 0.13/0.36 # Creating start rules for all 1 conjectures.
% 0.13/0.36 # There are 1 start rule candidates:
% 0.13/0.36 # Found 10 unit axioms.
% 0.13/0.36 # 1 start rule tableaux created.
% 0.13/0.36 # 0 extension rule candidate clauses
% 0.13/0.36 # 10 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.36 # Creating equality axioms
% 0.13/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.36 # Returning from population with 24 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.36 # We now have 24 tableaux to operate on
% 22.81/3.30 # There were 1 total branch saturation attempts.
% 22.81/3.30 # There were 0 of these attempts blocked.
% 22.81/3.30 # There were 0 deferred branch saturation attempts.
% 22.81/3.30 # There were 0 free duplicated saturations.
% 22.81/3.30 # There were 1 total successful branch saturations.
% 22.81/3.30 # There were 0 successful branch saturations in interreduction.
% 22.81/3.30 # There were 0 successful branch saturations on the branch.
% 22.81/3.30 # There were 1 successful branch saturations after the branch.
% 22.81/3.30 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.81/3.30 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.81/3.30 # Begin clausification derivation
% 22.81/3.30
% 22.81/3.30 # End clausification derivation
% 22.81/3.30 # Begin listing active clauses obtained from FOF to CNF conversion
% 22.81/3.30 cnf(i_0_19, hypothesis, (equalish(a,b)=true)).
% 22.81/3.30 cnf(i_0_20, negated_conjecture, (equalish(inverse(a),inverse(b))!=true)).
% 22.81/3.30 cnf(i_0_12, plain, (product(identity,X1,X1)=true)).
% 22.81/3.30 cnf(i_0_13, plain, (product(inverse(X1),X1,identity)=true)).
% 22.81/3.30 cnf(i_0_14, plain, (product(X1,X2,multiply(X1,X2))=true)).
% 22.81/3.30 cnf(i_0_11, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 22.81/3.30 cnf(i_0_15, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X2,X4),true,equalish(X4,X3),true),true)=true)).
% 22.81/3.30 cnf(i_0_18, plain, (ifeq(equalish(X1,X2),true,ifeq(product(X3,X4,X1),true,product(X3,X4,X2),true),true)=true)).
% 22.81/3.30 cnf(i_0_17, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X3,X5),true,ifeq(product(X4,X1,X6),true,product(X6,X2,X5),true),true),true)=true)).
% 22.81/3.30 cnf(i_0_16, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X4,X1),true,product(X6,X5,X3),true),true),true)=true)).
% 22.81/3.30 cnf(i_0_22, plain, (X7=X7)).
% 22.81/3.30 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 22.81/3.30 # Begin printing tableau
% 22.81/3.30 # Found 8 steps
% 22.81/3.30 cnf(i_0_19, hypothesis, (equalish(a,b)=true), inference(start_rule)).
% 22.81/3.30 cnf(i_0_31, plain, (equalish(a,b)=true), inference(extension_rule, [i_0_29])).
% 22.81/3.30 cnf(i_0_61, plain, (equalish(a,b)!=true), inference(closure_rule, [i_0_19])).
% 22.81/3.30 cnf(i_0_60, plain, (multiply(equalish(a,b),equalish(a,b))=multiply(true,true)), inference(extension_rule, [i_0_26])).
% 22.81/3.30 cnf(i_0_160, plain, (equalish(a,b)!=true), inference(closure_rule, [i_0_19])).
% 22.81/3.30 cnf(i_0_161, plain, (equalish(a,b)!=true), inference(closure_rule, [i_0_19])).
% 22.81/3.30 cnf(i_0_162, plain, (equalish(a,b)!=true), inference(closure_rule, [i_0_19])).
% 22.81/3.30 cnf(i_0_158, plain, (ifeq(multiply(equalish(a,b),equalish(a,b)),equalish(a,b),equalish(a,b),equalish(a,b))=ifeq(multiply(true,true),true,true,true)), inference(etableau_closure_rule, [i_0_158, ...])).
% 22.81/3.30 # End printing tableau
% 22.81/3.30 # SZS output end
% 22.81/3.30 # Branches closed with saturation will be marked with an "s"
% 23.43/3.31 # There were 1 total branch saturation attempts.
% 23.43/3.31 # There were 0 of these attempts blocked.
% 23.43/3.31 # There were 0 deferred branch saturation attempts.
% 23.43/3.31 # There were 0 free duplicated saturations.
% 23.43/3.31 # There were 1 total successful branch saturations.
% 23.43/3.31 # There were 0 successful branch saturations in interreduction.
% 23.43/3.31 # There were 0 successful branch saturations on the branch.
% 23.43/3.31 # There were 1 successful branch saturations after the branch.
% 23.43/3.31 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 23.43/3.31 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 23.43/3.31 # Begin clausification derivation
% 23.43/3.31
% 23.43/3.31 # End clausification derivation
% 23.43/3.31 # Begin listing active clauses obtained from FOF to CNF conversion
% 23.43/3.31 cnf(i_0_19, hypothesis, (equalish(a,b)=true)).
% 23.43/3.31 cnf(i_0_20, negated_conjecture, (equalish(inverse(a),inverse(b))!=true)).
% 23.43/3.31 cnf(i_0_12, plain, (product(identity,X1,X1)=true)).
% 23.43/3.31 cnf(i_0_13, plain, (product(inverse(X1),X1,identity)=true)).
% 23.43/3.31 cnf(i_0_14, plain, (product(X1,X2,multiply(X1,X2))=true)).
% 23.43/3.31 cnf(i_0_11, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 23.43/3.31 cnf(i_0_15, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X2,X4),true,equalish(X4,X3),true),true)=true)).
% 23.43/3.31 cnf(i_0_18, plain, (ifeq(equalish(X1,X2),true,ifeq(product(X3,X4,X1),true,product(X3,X4,X2),true),true)=true)).
% 23.43/3.31 cnf(i_0_17, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X3,X5),true,ifeq(product(X4,X1,X6),true,product(X6,X2,X5),true),true),true)=true)).
% 23.43/3.31 cnf(i_0_16, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X4,X1),true,product(X6,X5,X3),true),true),true)=true)).
% 23.43/3.31 cnf(i_0_22, plain, (X7=X7)).
% 23.43/3.31 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 23.43/3.31 # Begin printing tableau
% 23.43/3.31 # Found 9 steps
% 23.43/3.31 cnf(i_0_19, hypothesis, (equalish(a,b)=true), inference(start_rule)).
% 23.43/3.31 cnf(i_0_31, plain, (equalish(a,b)=true), inference(extension_rule, [i_0_27])).
% 23.43/3.31 cnf(i_0_55, plain, (equalish(a,b)!=true), inference(closure_rule, [i_0_19])).
% 23.43/3.31 cnf(i_0_57, plain, (equalish(a,b)!=true), inference(closure_rule, [i_0_19])).
% 23.43/3.31 cnf(i_0_54, plain, (product(equalish(a,b),equalish(a,b),equalish(a,b))=product(true,true,true)), inference(extension_rule, [i_0_26])).
% 23.43/3.31 cnf(i_0_154, plain, (equalish(a,b)!=true), inference(closure_rule, [i_0_19])).
% 23.43/3.31 cnf(i_0_155, plain, (equalish(a,b)!=true), inference(closure_rule, [i_0_19])).
% 23.43/3.31 cnf(i_0_156, plain, (equalish(a,b)!=true), inference(closure_rule, [i_0_19])).
% 23.43/3.31 cnf(i_0_152, plain, (ifeq(product(equalish(a,b),equalish(a,b),equalish(a,b)),equalish(a,b),equalish(a,b),equalish(a,b))=ifeq(product(true,true,true),true,true,true)), inference(etableau_closure_rule, [i_0_152, ...])).
% 23.43/3.31 # End printing tableau
% 23.43/3.31 # SZS output end
% 23.43/3.31 # Branches closed with saturation will be marked with an "s"
% 23.43/3.31 # Child (30610) has found a proof.
% 23.43/3.31
% 23.43/3.31 # Proof search is over...
% 23.43/3.31 # Freeing feature tree
%------------------------------------------------------------------------------