TSTP Solution File: GRP039-6 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP039-6 : TPTP v8.1.0. Released v1.0.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 : n027.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.07s 0.36s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : GRP039-6 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.07/0.31 % Computer : n027.cluster.edu
% 0.07/0.31 % Model : x86_64 x86_64
% 0.07/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.31 % Memory : 8042.1875MB
% 0.07/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.31 % CPULimit : 300
% 0.07/0.31 % WCLimit : 600
% 0.07/0.31 % DateTime : Tue Jun 14 08:05:18 EDT 2022
% 0.07/0.32 % CPUTime :
% 0.07/0.33 # No SInE strategy applied
% 0.07/0.33 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.07/0.33 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.07/0.33 #
% 0.07/0.33 # Presaturation interreduction done
% 0.07/0.33 # Number of axioms: 22 Number of unprocessed: 22
% 0.07/0.33 # Tableaux proof search.
% 0.07/0.33 # APR header successfully linked.
% 0.07/0.33 # Hello from C++
% 0.07/0.33 # The folding up rule is enabled...
% 0.07/0.33 # Local unification is enabled...
% 0.07/0.33 # Any saturation attempts will use folding labels...
% 0.07/0.33 # 22 beginning clauses after preprocessing and clausification
% 0.07/0.33 # Creating start rules for all 4 conjectures.
% 0.07/0.33 # There are 4 start rule candidates:
% 0.07/0.33 # Found 9 unit axioms.
% 0.07/0.33 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.07/0.33 # 4 start rule tableaux created.
% 0.07/0.33 # 13 extension rule candidate clauses
% 0.07/0.33 # 9 unit axiom clauses
% 0.07/0.33
% 0.07/0.33 # Requested 8, 32 cores available to the main process.
% 0.07/0.33 # There are not enough tableaux to fork, creating more from the initial 4
% 0.07/0.33 # Returning from population with 22 new_tableaux and 0 remaining starting tableaux.
% 0.07/0.33 # We now have 22 tableaux to operate on
% 0.07/0.36 # There were 3 total branch saturation attempts.
% 0.07/0.36 # There were 0 of these attempts blocked.
% 0.07/0.36 # There were 0 deferred branch saturation attempts.
% 0.07/0.36 # There were 0 free duplicated saturations.
% 0.07/0.36 # There were 3 total successful branch saturations.
% 0.07/0.36 # There were 0 successful branch saturations in interreduction.
% 0.07/0.36 # There were 0 successful branch saturations on the branch.
% 0.07/0.36 # There were 3 successful branch saturations after the branch.
% 0.07/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.36 # Begin clausification derivation
% 0.07/0.36
% 0.07/0.36 # End clausification derivation
% 0.07/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.07/0.36 cnf(i_0_41, negated_conjecture, (subgroup_member(b))).
% 0.07/0.36 cnf(i_0_43, negated_conjecture, (product(a,c,d))).
% 0.07/0.36 cnf(i_0_42, negated_conjecture, (product(b,inverse(a),c))).
% 0.07/0.36 cnf(i_0_36, plain, (subgroup_member(identity))).
% 0.07/0.36 cnf(i_0_30, plain, (product(X1,identity,X1))).
% 0.07/0.36 cnf(i_0_29, plain, (product(identity,X1,X1))).
% 0.07/0.36 cnf(i_0_32, plain, (product(X1,inverse(X1),identity))).
% 0.07/0.36 cnf(i_0_31, plain, (product(inverse(X1),X1,identity))).
% 0.07/0.36 cnf(i_0_44, negated_conjecture, (~subgroup_member(d))).
% 0.07/0.36 cnf(i_0_27, plain, (subgroup_member(inverse(X1))|~subgroup_member(X1))).
% 0.07/0.36 cnf(i_0_23, plain, (subgroup_member(X1)|~subgroup_member(X2)|~equalish(X2,X1))).
% 0.07/0.36 cnf(i_0_28, plain, (subgroup_member(X1)|~product(X2,X3,X1)|~subgroup_member(X3)|~subgroup_member(X2))).
% 0.07/0.36 cnf(i_0_39, plain, (subgroup_member(element_in_O2(X1,X2))|subgroup_member(X1)|subgroup_member(X2))).
% 0.07/0.36 cnf(i_0_40, plain, (product(X1,element_in_O2(X1,X2),X2)|subgroup_member(X1)|subgroup_member(X2))).
% 0.07/0.36 cnf(i_0_37, plain, (equalish(X1,X2)|~product(X3,X1,X4)|~product(X3,X2,X4))).
% 0.07/0.36 cnf(i_0_38, plain, (equalish(X1,X2)|~product(X1,X3,X4)|~product(X2,X3,X4))).
% 0.07/0.36 cnf(i_0_25, plain, (equalish(element_in_O2(X1,X2),element_in_O2(X1,X3))|~equalish(X2,X3))).
% 0.07/0.36 cnf(i_0_26, plain, (equalish(element_in_O2(X1,X2),element_in_O2(X3,X2))|~equalish(X1,X3))).
% 0.07/0.36 cnf(i_0_35, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.07/0.36 cnf(i_0_24, plain, (product(X1,X2,X3)|~product(X1,X2,X4)|~equalish(X4,X3))).
% 0.07/0.36 cnf(i_0_34, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))).
% 0.07/0.36 cnf(i_0_33, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 0.07/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.07/0.36 # Begin printing tableau
% 0.07/0.36 # Found 8 steps
% 0.07/0.36 cnf(i_0_42, negated_conjecture, (product(b,inverse(a),c)), inference(start_rule)).
% 0.07/0.36 cnf(i_0_46, plain, (product(b,inverse(a),c)), inference(extension_rule, [i_0_33])).
% 0.07/0.36 cnf(i_0_124, plain, (~product(identity,inverse(a),inverse(a))), inference(closure_rule, [i_0_29])).
% 0.07/0.36 cnf(i_0_126, plain, (~product(inverse(b),b,identity)), inference(closure_rule, [i_0_31])).
% 0.07/0.36 cnf(i_0_123, plain, (product(inverse(b),c,inverse(a))), inference(extension_rule, [i_0_28])).
% 0.07/0.36 cnf(i_0_132, plain, (subgroup_member(inverse(a))), inference(etableau_closure_rule, [i_0_132, ...])).
% 0.07/0.36 cnf(i_0_134, plain, (~subgroup_member(c)), inference(etableau_closure_rule, [i_0_134, ...])).
% 0.07/0.36 cnf(i_0_135, plain, (~subgroup_member(inverse(b))), inference(etableau_closure_rule, [i_0_135, ...])).
% 0.07/0.36 # End printing tableau
% 0.07/0.36 # SZS output end
% 0.07/0.36 # Branches closed with saturation will be marked with an "s"
% 0.07/0.36 # Child (32026) has found a proof.
% 0.07/0.36
% 0.07/0.36 # Proof search is over...
% 0.07/0.36 # Freeing feature tree
%------------------------------------------------------------------------------