TSTP Solution File: GRP039-7 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP039-7 : TPTP v8.1.0. Bugfixed v1.0.1.
% 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 : n016.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:07 EDT 2022
% Result : Unsatisfiable 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP039-7 : TPTP v8.1.0. Bugfixed v1.0.1.
% 0.07/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 : n016.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 10:39:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic C07_19_nc_SAT001_MinMin_rr
% 0.13/0.37 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 16 Number of unprocessed: 16
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 16 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 4 conjectures.
% 0.13/0.38 # There are 4 start rule candidates:
% 0.13/0.38 # Found 12 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 4 start rule tableaux created.
% 0.13/0.38 # 4 extension rule candidate clauses
% 0.13/0.38 # 12 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.13/0.38 # There are not enough tableaux to fork, creating more from the initial 4
% 0.13/0.38 # There were 1 total branch saturation attempts.
% 0.13/0.38 # There were 0 of these attempts blocked.
% 0.13/0.38 # There were 0 deferred branch saturation attempts.
% 0.13/0.38 # There were 0 free duplicated saturations.
% 0.13/0.38 # There were 1 total successful branch saturations.
% 0.13/0.38 # There were 0 successful branch saturations in interreduction.
% 0.13/0.38 # There were 0 successful branch saturations on the branch.
% 0.13/0.38 # There were 1 successful branch saturations after the branch.
% 0.13/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.38 # Begin clausification derivation
% 0.13/0.38
% 0.13/0.38 # End clausification derivation
% 0.13/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.38 cnf(i_0_29, negated_conjecture, (subgroup_member(b))).
% 0.13/0.38 cnf(i_0_31, negated_conjecture, (multiply(a,c)=d)).
% 0.13/0.38 cnf(i_0_30, negated_conjecture, (multiply(b,inverse(a))=c)).
% 0.13/0.38 cnf(i_0_26, plain, (subgroup_member(identity))).
% 0.13/0.38 cnf(i_0_25, plain, (inverse(identity)=identity)).
% 0.13/0.38 cnf(i_0_24, plain, (inverse(inverse(X1))=X1)).
% 0.13/0.38 cnf(i_0_22, plain, (multiply(X1,identity)=X1)).
% 0.13/0.38 cnf(i_0_17, plain, (multiply(identity,X1)=X1)).
% 0.13/0.38 cnf(i_0_23, plain, (multiply(X1,inverse(X1))=identity)).
% 0.13/0.38 cnf(i_0_18, plain, (multiply(inverse(X1),X1)=identity)).
% 0.13/0.38 cnf(i_0_19, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))).
% 0.13/0.38 cnf(i_0_32, negated_conjecture, (~subgroup_member(d))).
% 0.13/0.38 cnf(i_0_20, plain, (subgroup_member(inverse(X1))|~subgroup_member(X1))).
% 0.13/0.38 cnf(i_0_21, plain, (subgroup_member(multiply(X1,X2))|~subgroup_member(X2)|~subgroup_member(X1))).
% 0.13/0.38 cnf(i_0_27, plain, (subgroup_member(element_in_O2(X1,X2))|subgroup_member(X1)|subgroup_member(X2))).
% 0.13/0.38 cnf(i_0_28, plain, (multiply(X1,element_in_O2(X1,X2))=X2|subgroup_member(X1)|subgroup_member(X2))).
% 0.13/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.38 # Begin printing tableau
% 0.13/0.38 # Found 5 steps
% 0.13/0.38 cnf(i_0_29, negated_conjecture, (subgroup_member(b)), inference(start_rule)).
% 0.13/0.38 cnf(i_0_37, plain, (subgroup_member(b)), inference(extension_rule, [i_0_21])).
% 0.13/0.38 cnf(i_0_74, plain, (~subgroup_member(identity)), inference(closure_rule, [i_0_26])).
% 0.13/0.38 cnf(i_0_73, plain, (subgroup_member(multiply(b,identity))), inference(extension_rule, [i_0_20])).
% 0.13/0.38 cnf(i_0_82, plain, (subgroup_member(inverse(multiply(b,identity)))), inference(etableau_closure_rule, [i_0_82, ...])).
% 0.13/0.38 # End printing tableau
% 0.13/0.38 # SZS output end
% 0.13/0.38 # Branches closed with saturation will be marked with an "s"
% 0.13/0.38 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.38 # We now have 7 tableaux to operate on
% 0.13/0.38 # Found closed tableau during pool population.
% 0.13/0.38 # Proof search is over...
% 0.13/0.38 # Freeing feature tree
%------------------------------------------------------------------------------