%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP026-1 : TPTP v8.1.0. Bugfixed v2.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 : n020.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.46s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GRP026-1 : TPTP v8.1.0. Bugfixed v2.0.0. % 0.03/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 : n020.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.35 % DateTime : Mon Jun 13 18:11:20 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.38 # No SInE strategy applied % 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.38 # % 0.20/0.38 # Presaturation interreduction done % 0.20/0.38 # Number of axioms: 45 Number of unprocessed: 45 % 0.20/0.38 # Tableaux proof search. % 0.20/0.38 # APR header successfully linked. % 0.20/0.38 # Hello from C++ % 0.20/0.39 # The folding up rule is enabled... % 0.20/0.39 # Local unification is enabled... % 0.20/0.39 # Any saturation attempts will use folding labels... % 0.20/0.39 # 45 beginning clauses after preprocessing and clausification % 0.20/0.39 # Creating start rules for all 1 conjectures. % 0.20/0.39 # There are 1 start rule candidates: % 0.20/0.39 # Found 37 unit axioms. % 0.20/0.39 # 1 start rule tableaux created. % 0.20/0.39 # 8 extension rule candidate clauses % 0.20/0.39 # 37 unit axiom clauses % 0.20/0.39 % 0.20/0.39 # Requested 8, 32 cores available to the main process. % 0.20/0.39 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.46 # There were 4 total branch saturation attempts. % 0.20/0.46 # There were 0 of these attempts blocked. % 0.20/0.46 # There were 0 deferred branch saturation attempts. % 0.20/0.46 # There were 1 free duplicated saturations. % 0.20/0.46 # There were 4 total successful branch saturations. % 0.20/0.46 # There were 0 successful branch saturations in interreduction. % 0.20/0.46 # There were 0 successful branch saturations on the branch. % 0.20/0.46 # There were 3 successful branch saturations after the branch. % 0.20/0.46 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.46 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.46 # Begin clausification derivation % 0.20/0.46 % 0.20/0.46 # End clausification derivation % 0.20/0.46 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.46 cnf(i_0_83, hypothesis, (an_isomorphism(a)=f)). % 0.20/0.46 cnf(i_0_89, hypothesis, (product(g1,d1,d2,d3))). % 0.20/0.46 cnf(i_0_84, hypothesis, (an_isomorphism(b)=g)). % 0.20/0.46 cnf(i_0_85, hypothesis, (an_isomorphism(c)=h)). % 0.20/0.46 cnf(i_0_57, hypothesis, (group_member(a,g1))). % 0.20/0.46 cnf(i_0_60, hypothesis, (group_member(f,g2))). % 0.20/0.46 cnf(i_0_58, hypothesis, (group_member(b,g1))). % 0.20/0.46 cnf(i_0_59, hypothesis, (group_member(c,g1))). % 0.20/0.46 cnf(i_0_61, hypothesis, (group_member(g,g2))). % 0.20/0.46 cnf(i_0_62, hypothesis, (group_member(h,g2))). % 0.20/0.46 cnf(i_0_86, hypothesis, (group_member(d1,g1))). % 0.20/0.46 cnf(i_0_87, hypothesis, (group_member(d2,g1))). % 0.20/0.46 cnf(i_0_88, hypothesis, (group_member(d3,g1))). % 0.20/0.46 cnf(i_0_74, hypothesis, (product(g2,f,f,f))). % 0.20/0.46 cnf(i_0_75, hypothesis, (product(g2,f,g,g))). % 0.20/0.46 cnf(i_0_46, plain, (group_member(identity_for(X1),X1))). % 0.20/0.46 cnf(i_0_77, hypothesis, (product(g2,f,h,h))). % 0.20/0.46 cnf(i_0_48, plain, (product(X1,X2,identity_for(X1),X2))). % 0.20/0.46 cnf(i_0_47, plain, (product(X1,identity_for(X1),X2,X2))). % 0.20/0.46 cnf(i_0_65, hypothesis, (product(g1,a,a,a))). % 0.20/0.46 cnf(i_0_76, hypothesis, (product(g2,g,f,g))). % 0.20/0.46 cnf(i_0_79, hypothesis, (product(g2,g,g,h))). % 0.20/0.46 cnf(i_0_80, hypothesis, (product(g2,g,h,f))). % 0.20/0.46 cnf(i_0_78, hypothesis, (product(g2,h,f,h))). % 0.20/0.46 cnf(i_0_81, hypothesis, (product(g2,h,g,f))). % 0.20/0.46 cnf(i_0_82, hypothesis, (product(g2,h,h,g))). % 0.20/0.46 cnf(i_0_66, hypothesis, (product(g1,a,b,b))). % 0.20/0.46 cnf(i_0_68, hypothesis, (product(g1,a,c,c))). % 0.20/0.46 cnf(i_0_67, hypothesis, (product(g1,b,a,b))). % 0.20/0.46 cnf(i_0_70, hypothesis, (product(g1,b,b,c))). % 0.20/0.46 cnf(i_0_71, hypothesis, (product(g1,b,c,a))). % 0.20/0.46 cnf(i_0_69, hypothesis, (product(g1,c,a,c))). % 0.20/0.46 cnf(i_0_72, hypothesis, (product(g1,c,b,a))). % 0.20/0.46 cnf(i_0_73, hypothesis, (product(g1,c,c,b))). % 0.20/0.46 cnf(i_0_51, plain, (product(X1,X2,inverse(X1,X2),identity_for(X1)))). % 0.20/0.46 cnf(i_0_50, plain, (product(X1,inverse(X1,X2),X2,identity_for(X1)))). % 0.20/0.46 cnf(i_0_90, negated_conjecture, (~product(g2,an_isomorphism(d1),an_isomorphism(d2),an_isomorphism(d3)))). % 0.20/0.46 cnf(i_0_49, plain, (group_member(inverse(X1,X2),X1)|~group_member(X2,X1))). % 0.20/0.46 cnf(i_0_63, hypothesis, (X1=c|X1=b|X1=a|~group_member(X1,g1))). % 0.20/0.46 cnf(i_0_64, hypothesis, (X1=h|X1=g|X1=f|~group_member(X1,g2))). % 0.20/0.46 cnf(i_0_53, plain, (group_member(multiply(X1,X2,X3),X1)|~group_member(X3,X1)|~group_member(X2,X1))). % 0.20/0.46 cnf(i_0_54, plain, (X1=X2|~product(X3,X4,X5,X2)|~product(X3,X4,X5,X1))). % 0.20/0.46 cnf(i_0_52, plain, (product(X1,X2,X3,multiply(X1,X2,X3))|~group_member(X3,X1)|~group_member(X2,X1))). % 0.20/0.46 cnf(i_0_56, plain, (product(X1,X2,X3,X4)|~product(X1,X5,X3,X6)|~product(X1,X7,X6,X4)|~product(X1,X7,X5,X2))). % 0.20/0.46 cnf(i_0_55, plain, (product(X1,X2,X3,X4)|~product(X1,X5,X6,X4)|~product(X1,X7,X6,X3)|~product(X1,X2,X7,X5))). % 0.20/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.46 # Begin printing tableau % 0.20/0.46 # Found 10 steps % 0.20/0.46 cnf(i_0_90, negated_conjecture, (~product(g2,an_isomorphism(d1),an_isomorphism(d2),an_isomorphism(d3))), inference(start_rule)). % 0.20/0.46 cnf(i_0_91, plain, (~product(g2,an_isomorphism(d1),an_isomorphism(d2),an_isomorphism(d3))), inference(extension_rule, [i_0_55])). % 0.20/0.46 cnf(i_0_116, plain, (~product(g2,an_isomorphism(d3),identity_for(g2),an_isomorphism(d3))), inference(closure_rule, [i_0_48])). % 0.20/0.46 cnf(i_0_117, plain, (~product(g2,multiply(g2,an_isomorphism(d2),identity_for(g2)),identity_for(g2),an_isomorphism(d2))), inference(extension_rule, [i_0_56])). % 0.20/0.46 cnf(i_0_650, plain, (~product(g2,identity_for(g2),identity_for(g2),identity_for(g2))), inference(closure_rule, [i_0_48])). % 0.20/0.46 cnf(i_0_651, plain, (~product(g2,an_isomorphism(d2),identity_for(g2),an_isomorphism(d2))), inference(closure_rule, [i_0_48])). % 0.20/0.46 cnf(i_0_652, plain, (~product(g2,an_isomorphism(d2),identity_for(g2),multiply(g2,an_isomorphism(d2),identity_for(g2)))), inference(extension_rule, [i_0_52])). % 0.20/0.46 cnf(i_0_782, plain, (~group_member(identity_for(g2),g2)), inference(closure_rule, [i_0_46])). % 0.20/0.46 cnf(i_0_118, plain, (~product(g2,an_isomorphism(d1),multiply(g2,an_isomorphism(d2),identity_for(g2)),an_isomorphism(d3))), inference(etableau_closure_rule, [i_0_118, ...])). % 0.20/0.46 cnf(i_0_783, plain, (~group_member(an_isomorphism(d2),g2)), inference(etableau_closure_rule, [i_0_783, ...])). % 0.20/0.46 # End printing tableau % 0.20/0.46 # SZS output end % 0.20/0.46 # Branches closed with saturation will be marked with an "s" % 0.20/0.46 # Returning from population with 4 new_tableaux and 0 remaining starting tableaux. % 0.20/0.46 # We now have 4 tableaux to operate on % 0.20/0.46 # Found closed tableau during pool population. % 0.20/0.46 # Proof search is over... % 0.20/0.46 # Freeing feature tree %------------------------------------------------------------------------------