%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP291-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 : n011.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:05:49 EDT 2022 % Result : Unsatisfiable 1.59s 0.56s % Output : CNFRefutation 1.59s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : GRP291-1 : TPTP v8.1.0. Released v2.5.0. % 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n011.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Tue Jun 14 00:12:19 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.36 # % 0.12/0.36 # Presaturation interreduction done % 0.12/0.36 # Number of axioms: 29 Number of unprocessed: 29 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.36 # The folding up rule is enabled... % 0.12/0.36 # Local unification is enabled... % 0.12/0.36 # Any saturation attempts will use folding labels... % 0.12/0.36 # 29 beginning clauses after preprocessing and clausification % 0.12/0.36 # Creating start rules for all 26 conjectures. % 0.12/0.36 # There are 26 start rule candidates: % 0.12/0.36 # Found 3 unit axioms. % 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.36 # 26 start rule tableaux created. % 0.12/0.36 # 26 extension rule candidate clauses % 0.12/0.36 # 3 unit axiom clauses % 0.12/0.36 % 0.12/0.36 # Requested 8, 32 cores available to the main process. % 1.59/0.56 # There were 12 total branch saturation attempts. % 1.59/0.56 # There were 0 of these attempts blocked. % 1.59/0.56 # There were 0 deferred branch saturation attempts. % 1.59/0.56 # There were 0 free duplicated saturations. % 1.59/0.56 # There were 12 total successful branch saturations. % 1.59/0.56 # There were 0 successful branch saturations in interreduction. % 1.59/0.56 # There were 0 successful branch saturations on the branch. % 1.59/0.56 # There were 12 successful branch saturations after the branch. % 1.59/0.56 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.59/0.56 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.59/0.56 # Begin clausification derivation % 1.59/0.56 % 1.59/0.56 # End clausification derivation % 1.59/0.56 # Begin listing active clauses obtained from FOF to CNF conversion % 1.59/0.56 cnf(i_0_30, plain, (multiply(identity,X1)=X1)). % 1.59/0.56 cnf(i_0_31, plain, (multiply(inverse(X1),X1)=identity)). % 1.59/0.56 cnf(i_0_32, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 1.59/0.56 cnf(i_0_44, negated_conjecture, (inverse(sk_c1)=sk_c7|inverse(sk_c3)=sk_c7)). % 1.59/0.56 cnf(i_0_54, negated_conjecture, (inverse(sk_c2)=sk_c5|inverse(sk_c3)=sk_c7)). % 1.59/0.56 cnf(i_0_46, negated_conjecture, (inverse(sk_c1)=sk_c7|inverse(sk_c4)=sk_c6)). % 1.59/0.56 cnf(i_0_56, negated_conjecture, (inverse(sk_c2)=sk_c5|inverse(sk_c4)=sk_c6)). % 1.59/0.56 cnf(i_0_34, negated_conjecture, (multiply(sk_c7,sk_c6)=sk_c5|inverse(sk_c3)=sk_c7)). % 1.59/0.56 cnf(i_0_39, negated_conjecture, (multiply(sk_c1,sk_c7)=sk_c6|inverse(sk_c3)=sk_c7)). % 1.59/0.56 cnf(i_0_49, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c7|inverse(sk_c3)=sk_c7)). % 1.59/0.56 cnf(i_0_36, negated_conjecture, (multiply(sk_c7,sk_c6)=sk_c5|inverse(sk_c4)=sk_c6)). % 1.59/0.56 cnf(i_0_41, negated_conjecture, (multiply(sk_c1,sk_c7)=sk_c6|inverse(sk_c4)=sk_c6)). % 1.59/0.56 cnf(i_0_51, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c7|inverse(sk_c4)=sk_c6)). % 1.59/0.56 cnf(i_0_43, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c5|inverse(sk_c1)=sk_c7)). % 1.59/0.56 cnf(i_0_45, negated_conjecture, (multiply(sk_c3,sk_c6)=sk_c7|inverse(sk_c1)=sk_c7)). % 1.59/0.56 cnf(i_0_47, negated_conjecture, (multiply(sk_c4,sk_c5)=sk_c6|inverse(sk_c1)=sk_c7)). % 1.59/0.56 cnf(i_0_53, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c5|inverse(sk_c2)=sk_c5)). % 1.59/0.56 cnf(i_0_55, negated_conjecture, (multiply(sk_c3,sk_c6)=sk_c7|inverse(sk_c2)=sk_c5)). % 1.59/0.56 cnf(i_0_57, negated_conjecture, (multiply(sk_c4,sk_c5)=sk_c6|inverse(sk_c2)=sk_c5)). % 1.59/0.56 cnf(i_0_33, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c5|multiply(sk_c7,sk_c6)=sk_c5)). % 1.59/0.56 cnf(i_0_35, negated_conjecture, (multiply(sk_c3,sk_c6)=sk_c7|multiply(sk_c7,sk_c6)=sk_c5)). % 1.59/0.56 cnf(i_0_37, negated_conjecture, (multiply(sk_c4,sk_c5)=sk_c6|multiply(sk_c7,sk_c6)=sk_c5)). % 1.59/0.56 cnf(i_0_38, negated_conjecture, (multiply(sk_c1,sk_c7)=sk_c6|multiply(sk_c6,sk_c7)=sk_c5)). % 1.59/0.56 cnf(i_0_48, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c7|multiply(sk_c6,sk_c7)=sk_c5)). % 1.59/0.56 cnf(i_0_40, negated_conjecture, (multiply(sk_c1,sk_c7)=sk_c6|multiply(sk_c3,sk_c6)=sk_c7)). % 1.59/0.56 cnf(i_0_50, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c7|multiply(sk_c3,sk_c6)=sk_c7)). % 1.59/0.56 cnf(i_0_42, negated_conjecture, (multiply(sk_c1,sk_c7)=sk_c6|multiply(sk_c4,sk_c5)=sk_c6)). % 1.59/0.56 cnf(i_0_52, negated_conjecture, (multiply(sk_c2,sk_c5)=sk_c7|multiply(sk_c4,sk_c5)=sk_c6)). % 1.59/0.56 cnf(i_0_58, negated_conjecture, (multiply(sk_c7,sk_c6)!=sk_c5|multiply(sk_c6,sk_c7)!=sk_c5|multiply(X1,sk_c5)!=sk_c6|multiply(X2,sk_c6)!=sk_c7|multiply(X3,sk_c5)!=sk_c7|multiply(X4,sk_c7)!=sk_c6|inverse(X1)!=sk_c6|inverse(X2)!=sk_c7|inverse(X3)!=sk_c5|inverse(X4)!=sk_c7)). % 1.59/0.56 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 1.59/0.56 # Begin printing tableau % 1.59/0.56 # Found 17 steps % 1.59/0.56 cnf(i_0_43, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c5|inverse(sk_c1)=sk_c7), inference(start_rule)). % 1.59/0.56 cnf(i_0_97, plain, (multiply(sk_c6,sk_c7)=sk_c5), inference(extension_rule, [i_0_58])). % 1.59/0.56 cnf(i_0_179, plain, (multiply(sk_c7,sk_c6)!=sk_c5), inference(extension_rule, [i_0_37])). % 1.59/0.56 cnf(i_0_98, plain, (inverse(sk_c1)=sk_c7), inference(etableau_closure_rule, [i_0_98, ...])). % 1.59/0.56 cnf(i_0_201, plain, (multiply(sk_c4,sk_c5)=sk_c6), inference(etableau_closure_rule, [i_0_201, ...])). % 1.59/0.56 cnf(i_0_181, plain, (multiply(sk_c4,sk_c5)!=sk_c6), inference(extension_rule, [i_0_52])). % 1.59/0.56 cnf(i_0_185, plain, (inverse(sk_c4)!=sk_c6), inference(etableau_closure_rule, [i_0_185, ...])). % 1.59/0.56 cnf(i_0_10506, plain, (multiply(sk_c2,sk_c5)=sk_c7), inference(etableau_closure_rule, [i_0_10506, ...])). % 1.59/0.56 cnf(i_0_183, plain, (multiply(sk_c2,sk_c5)!=sk_c7), inference(extension_rule, [i_0_49])). % 1.59/0.56 cnf(i_0_187, plain, (inverse(sk_c2)!=sk_c5), inference(etableau_closure_rule, [i_0_187, ...])). % 1.59/0.56 cnf(i_0_11037, plain, (inverse(sk_c3)=sk_c7), inference(etableau_closure_rule, [i_0_11037, ...])). % 1.59/0.56 cnf(i_0_184, plain, (multiply(sk_c1,sk_c7)!=sk_c6), inference(extension_rule, [i_0_40])). % 1.59/0.56 cnf(i_0_188, plain, (inverse(sk_c1)!=sk_c7), inference(etableau_closure_rule, [i_0_188, ...])). % 1.59/0.56 cnf(i_0_11220, plain, (multiply(sk_c3,sk_c6)=sk_c7), inference(etableau_closure_rule, [i_0_11220, ...])). % 1.59/0.56 cnf(i_0_186, plain, (inverse(sk_c1)!=sk_c7), inference(extension_rule, [i_0_45])). % 1.59/0.56 cnf(i_0_182, plain, (multiply(sk_c1,sk_c6)!=sk_c7), inference(etableau_closure_rule, [i_0_182, ...])). % 1.59/0.56 cnf(i_0_11424, plain, (multiply(sk_c3,sk_c6)=sk_c7), inference(etableau_closure_rule, [i_0_11424, ...])). % 1.59/0.56 # End printing tableau % 1.59/0.56 # SZS output end % 1.59/0.56 # Branches closed with saturation will be marked with an "s" % 1.59/0.57 # Child (626) has found a proof. % 1.59/0.57 % 1.59/0.57 # Proof search is over... % 1.59/0.57 # Freeing feature tree %------------------------------------------------------------------------------