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