TSTP Solution File: GRP544-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP544-1 : TPTP v8.1.0. Bugfixed v2.7.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 : n028.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:56 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP544-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.11/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 12:14:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.12/0.37 # and selection function SelectNewComplexAHP.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 5 Number of unprocessed: 5
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 5 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 1 conjectures.
% 0.12/0.37 # There are 1 start rule candidates:
% 0.12/0.37 # Found 5 unit axioms.
% 0.12/0.37 # 1 start rule tableaux created.
% 0.12/0.37 # 0 extension rule candidate clauses
% 0.12/0.37 # 5 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.37 # Creating equality axioms
% 0.12/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.12/0.37 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.37 # We now have 12 tableaux to operate on
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_9, plain, (divide(X1,X1)=identity)).
% 0.12/0.37 cnf(i_0_8, plain, (divide(identity,X1)=inverse(X1))).
% 0.12/0.37 cnf(i_0_7, plain, (divide(X1,inverse(X2))=multiply(X1,X2))).
% 0.12/0.37 cnf(i_0_6, plain, (divide(inverse(divide(divide(divide(X1,X2),X3),X1)),X3)=X2)).
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (multiply(a,b)!=multiply(b,a))).
% 0.12/0.37 cnf(i_0_12, plain, (X4=X4)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 5 steps
% 0.12/0.37 cnf(i_0_9, plain, (divide(X4,X4)=identity), inference(start_rule)).
% 0.12/0.37 cnf(i_0_19, plain, (divide(X4,X4)=identity), inference(extension_rule, [i_0_18])).
% 0.12/0.37 cnf(i_0_38, plain, (inverse(divide(X4,X4))=inverse(identity)), inference(extension_rule, [i_0_15])).
% 0.12/0.37 cnf(i_0_46, plain, (inverse(identity)!=divide(identity,identity)), inference(closure_rule, [i_0_8])).
% 0.12/0.37 cnf(i_0_44, plain, (inverse(divide(X4,X4))=divide(identity,identity)), inference(etableau_closure_rule, [i_0_44, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # There were 1 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 1 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 1 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_9, plain, (divide(X1,X1)=identity)).
% 0.12/0.37 cnf(i_0_8, plain, (divide(identity,X1)=inverse(X1))).
% 0.12/0.37 cnf(i_0_7, plain, (divide(X1,inverse(X2))=multiply(X1,X2))).
% 0.12/0.37 cnf(i_0_6, plain, (divide(inverse(divide(divide(divide(X1,X2),X3),X1)),X3)=X2)).
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (multiply(a,b)!=multiply(b,a))).
% 0.12/0.37 cnf(i_0_12, plain, (X4=X4)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 6 steps
% 0.12/0.37 cnf(i_0_9, plain, (divide(X6,X6)=identity), inference(start_rule)).
% 0.12/0.37 cnf(i_0_19, plain, (divide(X6,X6)=identity), inference(extension_rule, [i_0_17])).
% 0.12/0.37 cnf(i_0_37, plain, (divide(identity,identity)!=identity), inference(closure_rule, [i_0_9])).
% 0.12/0.37 cnf(i_0_35, plain, (multiply(divide(X6,X6),divide(identity,identity))=multiply(identity,identity)), inference(extension_rule, [i_0_15])).
% 0.12/0.37 cnf(i_0_46, plain, (multiply(identity,identity)!=divide(identity,inverse(identity))), inference(closure_rule, [i_0_7])).
% 0.12/0.37 cnf(i_0_44, plain, (multiply(divide(X6,X6),divide(identity,identity))=divide(identity,inverse(identity))), inference(etableau_closure_rule, [i_0_44, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_9, plain, (divide(X1,X1)=identity)).
% 0.12/0.37 cnf(i_0_8, plain, (divide(identity,X1)=inverse(X1))).
% 0.12/0.37 cnf(i_0_7, plain, (divide(X1,inverse(X2))=multiply(X1,X2))).
% 0.12/0.37 cnf(i_0_6, plain, (divide(inverse(divide(divide(divide(X1,X2),X3),X1)),X3)=X2)).
% 0.12/0.37 cnf(i_0_10, negated_conjecture, (multiply(a,b)!=multiply(b,a))).
% 0.12/0.37 cnf(i_0_12, plain, (X4=X4)).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 6 steps
% 0.12/0.37 cnf(i_0_9, plain, (divide(X7,X7)=identity), inference(start_rule)).
% 0.12/0.37 cnf(i_0_19, plain, (divide(X7,X7)=identity), inference(extension_rule, [i_0_17])).
% 0.12/0.37 cnf(i_0_36, plain, (divide(identity,identity)!=identity), inference(closure_rule, [i_0_9])).
% 0.12/0.37 cnf(i_0_35, plain, (multiply(divide(identity,identity),divide(X7,X7))=multiply(identity,identity)), inference(extension_rule, [i_0_15])).
% 0.12/0.37 cnf(i_0_46, plain, (multiply(identity,identity)!=divide(identity,inverse(identity))), inference(closure_rule, [i_0_7])).
% 0.12/0.37 cnf(i_0_44, plain, (multiply(divide(identity,identity),divide(X7,X7))=divide(identity,inverse(identity))), inference(etableau_closure_rule, [i_0_44, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Child (11262) has found a proof.
% 0.12/0.37
% 0.12/0.38 # Proof search is over...
% 0.12/0.38 # Freeing feature tree
%------------------------------------------------------------------------------