TSTP Solution File: GRP063-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP063-1 : TPTP v8.1.0. Bugfixed v2.3.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:04:14 EDT 2022
% Result : Unsatisfiable 0.20s 0.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP063-1 : TPTP v8.1.0. Bugfixed v2.3.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.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 06:33:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.37 #
% 0.20/0.37 # Presaturation interreduction done
% 0.20/0.37 # Number of axioms: 4 Number of unprocessed: 4
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 4 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 1 conjectures.
% 0.20/0.37 # There are 1 start rule candidates:
% 0.20/0.37 # Found 3 unit axioms.
% 0.20/0.37 # 1 start rule tableaux created.
% 0.20/0.37 # 1 extension rule candidate clauses
% 0.20/0.37 # 3 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.20/0.37 # Creating equality axioms
% 0.20/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.20/0.37 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.37 # We now have 11 tableaux to operate on
% 0.20/0.39 # There were 1 total branch saturation attempts.
% 0.20/0.39 # There were 0 of these attempts blocked.
% 0.20/0.39 # There were 0 deferred branch saturation attempts.
% 0.20/0.39 # There were 0 free duplicated saturations.
% 0.20/0.39 # There were 1 total successful branch saturations.
% 0.20/0.39 # There were 0 successful branch saturations in interreduction.
% 0.20/0.39 # There were 0 successful branch saturations on the branch.
% 0.20/0.39 # There were 1 successful branch saturations after the branch.
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_7, plain, (divide(divide(X1,X1),X2)=inverse(X2))).
% 0.20/0.39 cnf(i_0_6, plain, (divide(X1,inverse(X2))=multiply(X1,X2))).
% 0.20/0.39 cnf(i_0_5, plain, (divide(X1,divide(divide(inverse(X2),X3),divide(inverse(X1),X3)))=X2)).
% 0.20/0.39 cnf(i_0_8, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3))|multiply(inverse(a1),a1)!=multiply(inverse(b1),b1)|multiply(multiply(inverse(b2),b2),a2)!=a2)).
% 0.20/0.39 cnf(i_0_21, plain, (X4=X4)).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 6 steps
% 0.20/0.39 cnf(i_0_7, plain, (divide(divide(X9,X9),X10)=inverse(X10)), inference(start_rule)).
% 0.20/0.39 cnf(i_0_28, plain, (divide(divide(X9,X9),X10)=inverse(X10)), inference(extension_rule, [i_0_26])).
% 0.20/0.39 cnf(i_0_49, plain, (divide(divide(inverse(inverse(X10)),inverse(inverse(X10))),inverse(X10))!=inverse(inverse(X10))), inference(closure_rule, [i_0_7])).
% 0.20/0.39 cnf(i_0_48, plain, (multiply(divide(divide(inverse(inverse(X10)),inverse(inverse(X10))),inverse(X10)),divide(divide(X9,X9),X10))=multiply(inverse(inverse(X10)),inverse(X10))), inference(extension_rule, [i_0_24])).
% 0.20/0.39 cnf(i_0_62, plain, (multiply(inverse(inverse(X10)),inverse(X10))!=divide(inverse(inverse(X10)),inverse(inverse(X10)))), inference(closure_rule, [i_0_6])).
% 0.20/0.39 cnf(i_0_60, plain, (multiply(divide(divide(inverse(inverse(X10)),inverse(inverse(X10))),inverse(X10)),divide(divide(X9,X9),X10))=divide(inverse(inverse(X10)),inverse(inverse(X10)))), inference(etableau_closure_rule, [i_0_60, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.39 # There were 1 total branch saturation attempts.
% 0.20/0.39 # There were 0 of these attempts blocked.
% 0.20/0.39 # There were 0 deferred branch saturation attempts.
% 0.20/0.39 # There were 0 free duplicated saturations.
% 0.20/0.39 # There were 1 total successful branch saturations.
% 0.20/0.39 # There were 0 successful branch saturations in interreduction.
% 0.20/0.39 # There were 0 successful branch saturations on the branch.
% 0.20/0.39 # There were 1 successful branch saturations after the branch.
% 0.20/0.39 # There were 1 total branch saturation attempts.
% 0.20/0.39 # There were 0 of these attempts blocked.
% 0.20/0.39 # There were 0 deferred branch saturation attempts.
% 0.20/0.39 # There were 0 free duplicated saturations.
% 0.20/0.39 # There were 1 total successful branch saturations.
% 0.20/0.39 # There were 0 successful branch saturations in interreduction.
% 0.20/0.39 # There were 0 successful branch saturations on the branch.
% 0.20/0.39 # There were 1 successful branch saturations after the branch.
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_7, plain, (divide(divide(X1,X1),X2)=inverse(X2))).
% 0.20/0.39 cnf(i_0_6, plain, (divide(X1,inverse(X2))=multiply(X1,X2))).
% 0.20/0.39 cnf(i_0_5, plain, (divide(X1,divide(divide(inverse(X2),X3),divide(inverse(X1),X3)))=X2)).
% 0.20/0.39 cnf(i_0_8, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3))|multiply(inverse(a1),a1)!=multiply(inverse(b1),b1)|multiply(multiply(inverse(b2),b2),a2)!=a2)).
% 0.20/0.39 cnf(i_0_21, plain, (X4=X4)).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 6 steps
% 0.20/0.39 cnf(i_0_7, plain, (divide(divide(X13,X13),X14)=inverse(X14)), inference(start_rule)).
% 0.20/0.39 cnf(i_0_28, plain, (divide(divide(X13,X13),X14)=inverse(X14)), inference(extension_rule, [i_0_25])).
% 0.20/0.39 cnf(i_0_46, plain, (divide(divide(inverse(X14),inverse(X14)),X14)!=inverse(X14)), inference(closure_rule, [i_0_7])).
% 0.20/0.39 cnf(i_0_45, plain, (divide(divide(divide(inverse(X14),inverse(X14)),X14),divide(divide(X13,X13),X14))=divide(inverse(X14),inverse(X14))), inference(extension_rule, [i_0_24])).
% 0.20/0.39 cnf(i_0_62, plain, (divide(inverse(X14),inverse(X14))!=multiply(inverse(X14),X14)), inference(closure_rule, [i_0_6])).
% 0.20/0.39 cnf(i_0_60, plain, (divide(divide(divide(inverse(X14),inverse(X14)),X14),divide(divide(X13,X13),X14))=multiply(inverse(X14),X14)), inference(etableau_closure_rule, [i_0_60, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.39 # There were 1 total branch saturation attempts.
% 0.20/0.39 # There were 0 of these attempts blocked.
% 0.20/0.39 # There were 0 deferred branch saturation attempts.
% 0.20/0.39 # There were 0 free duplicated saturations.
% 0.20/0.39 # There were 1 total successful branch saturations.
% 0.20/0.39 # There were 0 successful branch saturations in interreduction.
% 0.20/0.39 # There were 0 successful branch saturations on the branch.
% 0.20/0.39 # There were 1 successful branch saturations after the branch.
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_7, plain, (divide(divide(X1,X1),X2)=inverse(X2))).
% 0.20/0.39 cnf(i_0_6, plain, (divide(X1,inverse(X2))=multiply(X1,X2))).
% 0.20/0.39 cnf(i_0_5, plain, (divide(X1,divide(divide(inverse(X2),X3),divide(inverse(X1),X3)))=X2)).
% 0.20/0.39 cnf(i_0_8, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3))|multiply(inverse(a1),a1)!=multiply(inverse(b1),b1)|multiply(multiply(inverse(b2),b2),a2)!=a2)).
% 0.20/0.39 cnf(i_0_21, plain, (X4=X4)).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 6 steps
% 0.20/0.39 cnf(i_0_7, plain, (divide(divide(X13,X13),X14)=inverse(X14)), inference(start_rule)).
% 0.20/0.39 cnf(i_0_28, plain, (divide(divide(X13,X13),X14)=inverse(X14)), inference(extension_rule, [i_0_26])).
% 0.20/0.39 cnf(i_0_50, plain, (divide(divide(X11,X11),X12)!=inverse(X12)), inference(closure_rule, [i_0_7])).
% 0.20/0.39 cnf(i_0_48, plain, (multiply(divide(divide(X13,X13),X14),divide(divide(X11,X11),X12))=multiply(inverse(X14),inverse(X12))), inference(extension_rule, [i_0_25])).
% 0.20/0.39 cnf(i_0_136, plain, (divide(divide(X1,X1),X2)!=inverse(X2)), inference(closure_rule, [i_0_7])).
% 0.20/0.39 cnf(i_0_134, plain, (divide(multiply(divide(divide(X13,X13),X14),divide(divide(X11,X11),X12)),divide(divide(X1,X1),X2))=divide(multiply(inverse(X14),inverse(X12)),inverse(X2))), inference(etableau_closure_rule, [i_0_134, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_7, plain, (divide(divide(X1,X1),X2)=inverse(X2))).
% 0.20/0.39 cnf(i_0_6, plain, (divide(X1,inverse(X2))=multiply(X1,X2))).
% 0.20/0.39 cnf(i_0_5, plain, (divide(X1,divide(divide(inverse(X2),X3),divide(inverse(X1),X3)))=X2)).
% 0.20/0.39 cnf(i_0_8, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3))|multiply(inverse(a1),a1)!=multiply(inverse(b1),b1)|multiply(multiply(inverse(b2),b2),a2)!=a2)).
% 0.20/0.39 cnf(i_0_21, plain, (X4=X4)).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 6 steps
% 0.20/0.39 cnf(i_0_7, plain, (divide(divide(X11,X11),X12)=inverse(X12)), inference(start_rule)).
% 0.20/0.39 cnf(i_0_28, plain, (divide(divide(X11,X11),X12)=inverse(X12)), inference(extension_rule, [i_0_25])).
% 0.20/0.39 cnf(i_0_47, plain, (divide(divide(inverse(X12),inverse(X12)),X2)!=inverse(X2)), inference(closure_rule, [i_0_7])).
% 0.20/0.39 cnf(i_0_45, plain, (divide(divide(divide(X11,X11),X12),divide(divide(inverse(X12),inverse(X12)),X2))=divide(inverse(X12),inverse(X2))), inference(extension_rule, [i_0_24])).
% 0.20/0.39 cnf(i_0_62, plain, (divide(inverse(X12),inverse(X2))!=multiply(inverse(X12),X2)), inference(closure_rule, [i_0_6])).
% 0.20/0.39 cnf(i_0_60, plain, (divide(divide(divide(X11,X11),X12),divide(divide(inverse(X12),inverse(X12)),X2))=multiply(inverse(X12),X2)), inference(etableau_closure_rule, [i_0_60, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.39 # There were 1 total branch saturation attempts.
% 0.20/0.39 # There were 0 of these attempts blocked.
% 0.20/0.39 # There were 0 deferred branch saturation attempts.
% 0.20/0.39 # There were 0 free duplicated saturations.
% 0.20/0.39 # There were 1 total successful branch saturations.
% 0.20/0.39 # There were 0 successful branch saturations in interreduction.
% 0.20/0.39 # There were 0 successful branch saturations on the branch.
% 0.20/0.39 # There were 1 successful branch saturations after the branch.
% 0.20/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39 # Begin clausification derivation
% 0.20/0.39
% 0.20/0.39 # End clausification derivation
% 0.20/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39 cnf(i_0_7, plain, (divide(divide(X1,X1),X2)=inverse(X2))).
% 0.20/0.39 cnf(i_0_6, plain, (divide(X1,inverse(X2))=multiply(X1,X2))).
% 0.20/0.39 cnf(i_0_5, plain, (divide(X1,divide(divide(inverse(X2),X3),divide(inverse(X1),X3)))=X2)).
% 0.20/0.39 cnf(i_0_8, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3))|multiply(inverse(a1),a1)!=multiply(inverse(b1),b1)|multiply(multiply(inverse(b2),b2),a2)!=a2)).
% 0.20/0.39 cnf(i_0_21, plain, (X4=X4)).
% 0.20/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.39 # Begin printing tableau
% 0.20/0.39 # Found 6 steps
% 0.20/0.39 cnf(i_0_7, plain, (divide(divide(X11,X11),X5)=inverse(X5)), inference(start_rule)).
% 0.20/0.39 cnf(i_0_28, plain, (divide(divide(X11,X11),X5)=inverse(X5)), inference(extension_rule, [i_0_24])).
% 0.20/0.39 cnf(i_0_43, plain, (divide(divide(X11,X11),X5)!=inverse(X5)), inference(closure_rule, [i_0_7])).
% 0.20/0.39 cnf(i_0_42, plain, (inverse(X5)=inverse(X5)), inference(extension_rule, [i_0_25])).
% 0.20/0.39 cnf(i_0_130, plain, (divide(divide(X1,X1),X2)!=inverse(X2)), inference(closure_rule, [i_0_7])).
% 0.20/0.39 cnf(i_0_128, plain, (divide(inverse(X5),divide(divide(X1,X1),X2))=divide(inverse(X5),inverse(X2))), inference(etableau_closure_rule, [i_0_128, ...])).
% 0.20/0.39 # End printing tableau
% 0.20/0.39 # SZS output end
% 0.20/0.39 # Branches closed with saturation will be marked with an "s"
% 0.20/0.39 # Child (19098) has found a proof.
% 0.20/0.39
% 0.20/0.39 # Proof search is over...
% 0.20/0.39 # Freeing feature tree
%------------------------------------------------------------------------------