TSTP Solution File: GRP038-3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP038-3 : 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 : 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:04:06 EDT 2022
% Result : Unsatisfiable 0.09s 0.30s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRP038-3 : TPTP v8.1.0. Released v1.0.0.
% 0.05/0.09 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Tue Jun 14 06:53:12 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.09/0.29 # No SInE strategy applied
% 0.09/0.29 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.09/0.29 # and selection function SelectCQIPrecWNTNp.
% 0.09/0.29 #
% 0.09/0.29 # Presaturation interreduction done
% 0.09/0.29 # Number of axioms: 15 Number of unprocessed: 15
% 0.09/0.29 # Tableaux proof search.
% 0.09/0.29 # APR header successfully linked.
% 0.09/0.29 # Hello from C++
% 0.09/0.30 # The folding up rule is enabled...
% 0.09/0.30 # Local unification is enabled...
% 0.09/0.30 # Any saturation attempts will use folding labels...
% 0.09/0.30 # 15 beginning clauses after preprocessing and clausification
% 0.09/0.30 # Creating start rules for all 1 conjectures.
% 0.09/0.30 # There are 1 start rule candidates:
% 0.09/0.30 # Found 10 unit axioms.
% 0.09/0.30 # 1 start rule tableaux created.
% 0.09/0.30 # 5 extension rule candidate clauses
% 0.09/0.30 # 10 unit axiom clauses
% 0.09/0.30
% 0.09/0.30 # Requested 8, 32 cores available to the main process.
% 0.09/0.30 # There are not enough tableaux to fork, creating more from the initial 1
% 0.09/0.30 # There were 1 total branch saturation attempts.
% 0.09/0.30 # There were 0 of these attempts blocked.
% 0.09/0.30 # There were 0 deferred branch saturation attempts.
% 0.09/0.30 # There were 0 free duplicated saturations.
% 0.09/0.30 # There were 1 total successful branch saturations.
% 0.09/0.30 # There were 0 successful branch saturations in interreduction.
% 0.09/0.30 # There were 0 successful branch saturations on the branch.
% 0.09/0.30 # There were 1 successful branch saturations after the branch.
% 0.09/0.30 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.30 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.30 # Begin clausification derivation
% 0.09/0.30
% 0.09/0.30 # End clausification derivation
% 0.09/0.30 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.09/0.30 cnf(i_0_26, plain, (subgroup_member(identity))).
% 0.09/0.30 cnf(i_0_27, hypothesis, (subgroup_member(a))).
% 0.09/0.30 cnf(i_0_28, hypothesis, (subgroup_member(b))).
% 0.09/0.30 cnf(i_0_17, plain, (product(X1,identity,X1))).
% 0.09/0.30 cnf(i_0_16, plain, (product(identity,X1,X1))).
% 0.09/0.30 cnf(i_0_19, plain, (product(X1,inverse(X1),identity))).
% 0.09/0.30 cnf(i_0_18, plain, (product(inverse(X1),X1,identity))).
% 0.09/0.30 cnf(i_0_20, plain, (product(X1,X2,multiply(X1,X2)))).
% 0.09/0.30 cnf(i_0_29, hypothesis, (product(a,inverse(b),c))).
% 0.09/0.30 cnf(i_0_30, negated_conjecture, (~subgroup_member(c))).
% 0.09/0.30 cnf(i_0_25, plain, (subgroup_member(inverse(X1))|~subgroup_member(X1))).
% 0.09/0.30 cnf(i_0_24, plain, (subgroup_member(X1)|~subgroup_member(X2)|~subgroup_member(X3)|~product(X3,inverse(X2),X1))).
% 0.09/0.30 cnf(i_0_21, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.09/0.30 cnf(i_0_23, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))).
% 0.09/0.30 cnf(i_0_22, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 0.09/0.30 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.09/0.30 # Begin printing tableau
% 0.09/0.30 # Found 8 steps
% 0.09/0.30 cnf(i_0_30, negated_conjecture, (~subgroup_member(c)), inference(start_rule)).
% 0.09/0.30 cnf(i_0_31, plain, (~subgroup_member(c)), inference(extension_rule, [i_0_24])).
% 0.09/0.30 cnf(i_0_35, plain, (~subgroup_member(identity)), inference(closure_rule, [i_0_26])).
% 0.09/0.30 cnf(i_0_36, plain, (~subgroup_member(identity)), inference(closure_rule, [i_0_26])).
% 0.09/0.30 cnf(i_0_37, plain, (~product(identity,inverse(identity),c)), inference(extension_rule, [i_0_22])).
% 0.09/0.30 cnf(i_0_63, plain, (~product(c,identity,c)), inference(closure_rule, [i_0_17])).
% 0.09/0.30 cnf(i_0_65, plain, (~product(identity,c,c)), inference(closure_rule, [i_0_16])).
% 0.09/0.30 cnf(i_0_64, plain, (~product(c,identity,inverse(identity))), inference(etableau_closure_rule, [i_0_64, ...])).
% 0.09/0.30 # End printing tableau
% 0.09/0.30 # SZS output end
% 0.09/0.30 # Branches closed with saturation will be marked with an "s"
% 0.09/0.30 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
% 0.09/0.30 # We now have 2 tableaux to operate on
% 0.09/0.30 # Found closed tableau during pool population.
% 0.09/0.30 # Proof search is over...
% 0.09/0.30 # Freeing feature tree
%------------------------------------------------------------------------------