TSTP Solution File: GRP025-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP025-1 : TPTP v8.1.0. Bugfixed v1.2.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 : n026.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:00 EDT 2022
% Result : Unsatisfiable 0.20s 0.40s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP025-1 : TPTP v8.1.0. Bugfixed v1.2.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 : n026.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 05:36:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 32 Number of unprocessed: 32
% 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 # 32 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 1 conjectures.
% 0.13/0.38 # There are 1 start rule candidates:
% 0.13/0.38 # Found 24 unit axioms.
% 0.13/0.38 # 1 start rule tableaux created.
% 0.13/0.38 # 8 extension rule candidate clauses
% 0.13/0.38 # 24 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 1
% 0.20/0.40 # There were 4 total branch saturation attempts.
% 0.20/0.40 # There were 0 of these attempts blocked.
% 0.20/0.40 # There were 0 deferred branch saturation attempts.
% 0.20/0.40 # There were 1 free duplicated saturations.
% 0.20/0.40 # There were 4 total successful branch saturations.
% 0.20/0.40 # There were 0 successful branch saturations in interreduction.
% 0.20/0.40 # There were 0 successful branch saturations on the branch.
% 0.20/0.40 # There were 3 successful branch saturations after the branch.
% 0.20/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.40 # Begin clausification derivation
% 0.20/0.40
% 0.20/0.40 # End clausification derivation
% 0.20/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40 cnf(i_0_58, hypothesis, (an_isomorphism(a)=c)).
% 0.20/0.40 cnf(i_0_63, hypothesis, (product(g1,d1,d2,d3))).
% 0.20/0.40 cnf(i_0_59, hypothesis, (an_isomorphism(b)=d)).
% 0.20/0.40 cnf(i_0_46, hypothesis, (group_member(c,g2))).
% 0.20/0.40 cnf(i_0_44, hypothesis, (group_member(a,g1))).
% 0.20/0.40 cnf(i_0_47, hypothesis, (group_member(d,g2))).
% 0.20/0.40 cnf(i_0_45, hypothesis, (group_member(b,g1))).
% 0.20/0.40 cnf(i_0_60, hypothesis, (group_member(d1,g1))).
% 0.20/0.40 cnf(i_0_61, hypothesis, (group_member(d2,g1))).
% 0.20/0.40 cnf(i_0_62, hypothesis, (group_member(d3,g1))).
% 0.20/0.40 cnf(i_0_33, plain, (group_member(identity_for(X1),X1))).
% 0.20/0.40 cnf(i_0_54, hypothesis, (product(g2,c,c,c))).
% 0.20/0.40 cnf(i_0_55, hypothesis, (product(g2,c,d,d))).
% 0.20/0.40 cnf(i_0_56, hypothesis, (product(g2,d,c,d))).
% 0.20/0.40 cnf(i_0_57, hypothesis, (product(g2,d,d,c))).
% 0.20/0.40 cnf(i_0_50, hypothesis, (product(g1,a,a,a))).
% 0.20/0.40 cnf(i_0_35, plain, (product(X1,X2,identity_for(X1),X2))).
% 0.20/0.40 cnf(i_0_34, plain, (product(X1,identity_for(X1),X2,X2))).
% 0.20/0.40 cnf(i_0_51, hypothesis, (product(g1,a,b,b))).
% 0.20/0.40 cnf(i_0_52, hypothesis, (product(g1,b,a,b))).
% 0.20/0.40 cnf(i_0_53, hypothesis, (product(g1,b,b,a))).
% 0.20/0.40 cnf(i_0_38, plain, (product(X1,X2,inverse(X1,X2),identity_for(X1)))).
% 0.20/0.40 cnf(i_0_37, plain, (product(X1,inverse(X1,X2),X2,identity_for(X1)))).
% 0.20/0.40 cnf(i_0_64, negated_conjecture, (~product(g2,an_isomorphism(d1),an_isomorphism(d2),an_isomorphism(d3)))).
% 0.20/0.40 cnf(i_0_48, hypothesis, (X1=b|X1=a|~group_member(X1,g1))).
% 0.20/0.40 cnf(i_0_49, hypothesis, (X1=d|X1=c|~group_member(X1,g2))).
% 0.20/0.40 cnf(i_0_36, plain, (group_member(inverse(X1,X2),X1)|~group_member(X2,X1))).
% 0.20/0.40 cnf(i_0_40, plain, (group_member(multiply(X1,X2,X3),X1)|~group_member(X3,X1)|~group_member(X2,X1))).
% 0.20/0.40 cnf(i_0_41, plain, (X1=X2|~product(X3,X4,X5,X2)|~product(X3,X4,X5,X1))).
% 0.20/0.40 cnf(i_0_39, plain, (product(X1,X2,X3,multiply(X1,X2,X3))|~group_member(X3,X1)|~group_member(X2,X1))).
% 0.20/0.40 cnf(i_0_43, plain, (product(X1,X2,X3,X4)|~product(X1,X5,X3,X6)|~product(X1,X7,X6,X4)|~product(X1,X7,X5,X2))).
% 0.20/0.40 cnf(i_0_42, plain, (product(X1,X2,X3,X4)|~product(X1,X5,X6,X4)|~product(X1,X7,X6,X3)|~product(X1,X2,X7,X5))).
% 0.20/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.40 # Begin printing tableau
% 0.20/0.40 # Found 10 steps
% 0.20/0.40 cnf(i_0_64, negated_conjecture, (~product(g2,an_isomorphism(d1),an_isomorphism(d2),an_isomorphism(d3))), inference(start_rule)).
% 0.20/0.40 cnf(i_0_65, plain, (~product(g2,an_isomorphism(d1),an_isomorphism(d2),an_isomorphism(d3))), inference(extension_rule, [i_0_42])).
% 0.20/0.40 cnf(i_0_88, plain, (~product(g2,an_isomorphism(d3),identity_for(g2),an_isomorphism(d3))), inference(closure_rule, [i_0_35])).
% 0.20/0.40 cnf(i_0_89, plain, (~product(g2,multiply(g2,an_isomorphism(d2),identity_for(g2)),identity_for(g2),an_isomorphism(d2))), inference(extension_rule, [i_0_43])).
% 0.20/0.40 cnf(i_0_242, plain, (~product(g2,identity_for(g2),identity_for(g2),identity_for(g2))), inference(closure_rule, [i_0_35])).
% 0.20/0.40 cnf(i_0_243, plain, (~product(g2,an_isomorphism(d2),identity_for(g2),an_isomorphism(d2))), inference(closure_rule, [i_0_35])).
% 0.20/0.40 cnf(i_0_244, plain, (~product(g2,an_isomorphism(d2),identity_for(g2),multiply(g2,an_isomorphism(d2),identity_for(g2)))), inference(extension_rule, [i_0_39])).
% 0.20/0.40 cnf(i_0_364, plain, (~group_member(identity_for(g2),g2)), inference(closure_rule, [i_0_33])).
% 0.20/0.40 cnf(i_0_90, plain, (~product(g2,an_isomorphism(d1),multiply(g2,an_isomorphism(d2),identity_for(g2)),an_isomorphism(d3))), inference(etableau_closure_rule, [i_0_90, ...])).
% 0.20/0.40 cnf(i_0_365, plain, (~group_member(an_isomorphism(d2),g2)), inference(etableau_closure_rule, [i_0_365, ...])).
% 0.20/0.40 # End printing tableau
% 0.20/0.40 # SZS output end
% 0.20/0.40 # Branches closed with saturation will be marked with an "s"
% 0.20/0.40 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux.
% 0.20/0.40 # We now have 4 tableaux to operate on
% 0.20/0.40 # Found closed tableau during pool population.
% 0.20/0.40 # Proof search is over...
% 0.20/0.40 # Freeing feature tree
%------------------------------------------------------------------------------