%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP341-1 : TPTP v8.1.0. Released v2.5.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 : n003.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:06:03 EDT 2022 % Result : Unsatisfiable 0.20s 0.50s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : GRP341-1 : TPTP v8.1.0. Released v2.5.0. % 0.04/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.35 % Computer : n003.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Tue Jun 14 09:18:40 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: 39 Number of unprocessed: 39 % 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.38 # The folding up rule is enabled... % 0.20/0.38 # Local unification is enabled... % 0.20/0.38 # Any saturation attempts will use folding labels... % 0.20/0.38 # 39 beginning clauses after preprocessing and clausification % 0.20/0.38 # Creating start rules for all 36 conjectures. % 0.20/0.38 # There are 36 start rule candidates: % 0.20/0.38 # Found 3 unit axioms. % 0.20/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.20/0.38 # 36 start rule tableaux created. % 0.20/0.38 # 36 extension rule candidate clauses % 0.20/0.38 # 3 unit axiom clauses % 0.20/0.38 % 0.20/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.50 # There were 12 total branch saturation attempts. % 0.20/0.50 # There were 0 of these attempts blocked. % 0.20/0.50 # There were 0 deferred branch saturation attempts. % 0.20/0.50 # There were 0 free duplicated saturations. % 0.20/0.50 # There were 12 total successful branch saturations. % 0.20/0.50 # There were 0 successful branch saturations in interreduction. % 0.20/0.50 # There were 0 successful branch saturations on the branch. % 0.20/0.50 # There were 12 successful branch saturations after the branch. % 0.20/0.50 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.50 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.50 # Begin clausification derivation % 0.20/0.50 % 0.20/0.50 # End clausification derivation % 0.20/0.50 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.50 cnf(i_0_40, plain, (multiply(identity,X1)=X1)). % 0.20/0.50 cnf(i_0_41, plain, (multiply(inverse(X1),X1)=identity)). % 0.20/0.50 cnf(i_0_42, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 0.20/0.50 cnf(i_0_52, negated_conjecture, (inverse(sk_c1)=sk_c7|inverse(sk_c5)=sk_c6)). % 0.20/0.50 cnf(i_0_66, negated_conjecture, (inverse(sk_c2)=sk_c6|inverse(sk_c5)=sk_c6)). % 0.20/0.50 cnf(i_0_51, negated_conjecture, (inverse(sk_c1)=sk_c7|inverse(sk_c3)=sk_c7)). % 0.20/0.50 cnf(i_0_65, negated_conjecture, (inverse(sk_c2)=sk_c6|inverse(sk_c3)=sk_c7)). % 0.20/0.50 cnf(i_0_54, negated_conjecture, (inverse(sk_c1)=sk_c7|inverse(sk_c4)=sk_c6)). % 0.20/0.50 cnf(i_0_68, negated_conjecture, (inverse(sk_c2)=sk_c6|inverse(sk_c4)=sk_c6)). % 0.20/0.50 cnf(i_0_45, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c5|inverse(sk_c5)=sk_c6)). % 0.20/0.50 cnf(i_0_59, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c7|inverse(sk_c5)=sk_c6)). % 0.20/0.50 cnf(i_0_73, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|inverse(sk_c5)=sk_c6)). % 0.20/0.50 cnf(i_0_44, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c5|inverse(sk_c3)=sk_c7)). % 0.20/0.50 cnf(i_0_58, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c7|inverse(sk_c3)=sk_c7)). % 0.20/0.50 cnf(i_0_72, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|inverse(sk_c3)=sk_c7)). % 0.20/0.50 cnf(i_0_47, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c5|inverse(sk_c4)=sk_c6)). % 0.20/0.50 cnf(i_0_61, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c7|inverse(sk_c4)=sk_c6)). % 0.20/0.50 cnf(i_0_75, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|inverse(sk_c4)=sk_c6)). % 0.20/0.50 cnf(i_0_56, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c7|inverse(sk_c1)=sk_c7)). % 0.20/0.50 cnf(i_0_55, negated_conjecture, (multiply(sk_c5,sk_c7)=sk_c6|inverse(sk_c1)=sk_c7)). % 0.20/0.50 cnf(i_0_50, negated_conjecture, (multiply(sk_c3,sk_c7)=sk_c6|inverse(sk_c1)=sk_c7)). % 0.20/0.50 cnf(i_0_53, negated_conjecture, (multiply(sk_c4,sk_c6)=sk_c5|inverse(sk_c1)=sk_c7)). % 0.20/0.50 cnf(i_0_70, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c7|inverse(sk_c2)=sk_c6)). % 0.20/0.50 cnf(i_0_69, negated_conjecture, (multiply(sk_c5,sk_c7)=sk_c6|inverse(sk_c2)=sk_c6)). % 0.20/0.50 cnf(i_0_64, negated_conjecture, (multiply(sk_c3,sk_c7)=sk_c6|inverse(sk_c2)=sk_c6)). % 0.20/0.50 cnf(i_0_67, negated_conjecture, (multiply(sk_c4,sk_c6)=sk_c5|inverse(sk_c2)=sk_c6)). % 0.20/0.50 cnf(i_0_49, negated_conjecture, (multiply(sk_c5,sk_c6)=sk_c7|multiply(sk_c6,sk_c7)=sk_c5)). % 0.20/0.50 cnf(i_0_48, negated_conjecture, (multiply(sk_c5,sk_c7)=sk_c6|multiply(sk_c6,sk_c7)=sk_c5)). % 0.20/0.50 cnf(i_0_43, negated_conjecture, (multiply(sk_c3,sk_c7)=sk_c6|multiply(sk_c6,sk_c7)=sk_c5)). % 0.20/0.50 cnf(i_0_46, negated_conjecture, (multiply(sk_c4,sk_c6)=sk_c5|multiply(sk_c6,sk_c7)=sk_c5)). % 0.20/0.50 cnf(i_0_63, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c7|multiply(sk_c5,sk_c6)=sk_c7)). % 0.20/0.50 cnf(i_0_77, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|multiply(sk_c5,sk_c6)=sk_c7)). % 0.20/0.50 cnf(i_0_62, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c7|multiply(sk_c5,sk_c7)=sk_c6)). % 0.20/0.50 cnf(i_0_76, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|multiply(sk_c5,sk_c7)=sk_c6)). % 0.20/0.50 cnf(i_0_57, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c7|multiply(sk_c3,sk_c7)=sk_c6)). % 0.20/0.50 cnf(i_0_71, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|multiply(sk_c3,sk_c7)=sk_c6)). % 0.20/0.50 cnf(i_0_60, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c7|multiply(sk_c4,sk_c6)=sk_c5)). % 0.20/0.50 cnf(i_0_74, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|multiply(sk_c4,sk_c6)=sk_c5)). % 0.20/0.50 cnf(i_0_78, negated_conjecture, (multiply(sk_c6,sk_c7)!=sk_c5|multiply(sk_c5,sk_c6)!=sk_c7|multiply(sk_c5,sk_c7)!=sk_c6|multiply(X1,sk_c6)!=sk_c5|multiply(X2,sk_c7)!=sk_c6|multiply(X3,sk_c5)!=sk_c6|multiply(X4,sk_c6)!=sk_c7|inverse(sk_c5)!=sk_c6|inverse(X1)!=sk_c6|inverse(X2)!=sk_c7|inverse(X3)!=sk_c6|inverse(X4)!=sk_c7)). % 0.20/0.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.50 # Begin printing tableau % 0.20/0.50 # Found 18 steps % 0.20/0.50 cnf(i_0_71, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c6|multiply(sk_c3,sk_c7)=sk_c6), inference(start_rule)). % 0.20/0.50 cnf(i_0_95, plain, (multiply(sk_c2,sk_c5)=sk_c6), inference(extension_rule, [i_0_78])). % 0.20/0.50 cnf(i_0_161, plain, (multiply(sk_c6,sk_c7)!=sk_c5), inference(extension_rule, [i_0_46])). % 0.20/0.50 cnf(i_0_96, plain, (multiply(sk_c3,sk_c7)=sk_c6), inference(etableau_closure_rule, [i_0_96, ...])). % 0.20/0.50 cnf(i_0_162, plain, (multiply(sk_c5,sk_c6)!=sk_c7), inference(etableau_closure_rule, [i_0_162, ...])). % 0.20/0.50 cnf(i_0_163, plain, (multiply(sk_c5,sk_c7)!=sk_c6), inference(etableau_closure_rule, [i_0_163, ...])). % 0.20/0.50 cnf(i_0_168, plain, (inverse(sk_c5)!=sk_c6), inference(etableau_closure_rule, [i_0_168, ...])). % 0.20/0.50 cnf(i_0_171, plain, (inverse(sk_c2)!=sk_c6), inference(etableau_closure_rule, [i_0_171, ...])). % 0.20/0.50 cnf(i_0_189, plain, (multiply(sk_c4,sk_c6)=sk_c5), inference(etableau_closure_rule, [i_0_189, ...])). % 0.20/0.50 cnf(i_0_164, plain, (multiply(sk_c4,sk_c6)!=sk_c5), inference(extension_rule, [i_0_60])). % 0.20/0.50 cnf(i_0_169, plain, (inverse(sk_c4)!=sk_c6), inference(etableau_closure_rule, [i_0_169, ...])). % 0.20/0.50 cnf(i_0_2713, plain, (multiply(sk_c1,sk_c6)=sk_c7), inference(etableau_closure_rule, [i_0_2713, ...])). % 0.20/0.50 cnf(i_0_165, plain, (multiply(sk_c3,sk_c7)!=sk_c6), inference(extension_rule, [i_0_57])). % 0.20/0.50 cnf(i_0_170, plain, (inverse(sk_c3)!=sk_c7), inference(etableau_closure_rule, [i_0_170, ...])). % 0.20/0.50 cnf(i_0_2988, plain, (multiply(sk_c1,sk_c6)=sk_c7), inference(etableau_closure_rule, [i_0_2988, ...])). % 0.20/0.50 cnf(i_0_167, plain, (multiply(sk_c5,sk_c6)!=sk_c7), inference(extension_rule, [i_0_63])). % 0.20/0.50 cnf(i_0_172, plain, (inverse(sk_c5)!=sk_c7), inference(etableau_closure_rule, [i_0_172, ...])). % 0.20/0.50 cnf(i_0_3231, plain, (multiply(sk_c1,sk_c6)=sk_c7), inference(etableau_closure_rule, [i_0_3231, ...])). % 0.20/0.50 # End printing tableau % 0.20/0.50 # SZS output end % 0.20/0.50 # Branches closed with saturation will be marked with an "s" % 0.20/0.50 # Child (21236) has found a proof. % 0.20/0.50 % 0.20/0.50 # Proof search is over... % 0.20/0.50 # Freeing feature tree %------------------------------------------------------------------------------