%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP300-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 : n029.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:52 EDT 2022 % Result : Unsatisfiable 0.13s 0.39s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GRP300-1 : TPTP v8.1.0. Released v2.5.0. % 0.11/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.33 % Computer : n029.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % 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 18:06:10 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.36 # No SInE strategy applied % 0.13/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.36 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.36 # % 0.13/0.36 # Presaturation interreduction done % 0.13/0.36 # Number of axioms: 28 Number of unprocessed: 28 % 0.13/0.36 # Tableaux proof search. % 0.13/0.36 # APR header successfully linked. % 0.13/0.36 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 28 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 25 conjectures. % 0.13/0.37 # There are 25 start rule candidates: % 0.13/0.37 # Found 3 unit axioms. % 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.13/0.37 # 25 start rule tableaux created. % 0.13/0.37 # 25 extension rule candidate clauses % 0.13/0.37 # 3 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.39 # There were 8 total branch saturation attempts. % 0.13/0.39 # There were 0 of these attempts blocked. % 0.13/0.39 # There were 0 deferred branch saturation attempts. % 0.13/0.39 # There were 1 free duplicated saturations. % 0.13/0.39 # There were 8 total successful branch saturations. % 0.13/0.39 # There were 0 successful branch saturations in interreduction. % 0.13/0.39 # There were 0 successful branch saturations on the branch. % 0.13/0.39 # There were 7 successful branch saturations after the branch. % 0.13/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.39 # Begin clausification derivation % 0.13/0.39 % 0.13/0.39 # End clausification derivation % 0.13/0.39 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.39 cnf(i_0_29, plain, (multiply(identity,X1)=X1)). % 0.13/0.39 cnf(i_0_30, plain, (multiply(inverse(X1),X1)=identity)). % 0.13/0.39 cnf(i_0_31, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 0.13/0.39 cnf(i_0_47, negated_conjecture, (inverse(sk_c1)=sk_c6|inverse(sk_c6)=sk_c4)). % 0.13/0.39 cnf(i_0_46, negated_conjecture, (inverse(sk_c1)=sk_c6|inverse(sk_c2)=sk_c6)). % 0.13/0.39 cnf(i_0_49, negated_conjecture, (inverse(sk_c1)=sk_c6|inverse(sk_c3)=sk_c4)). % 0.13/0.39 cnf(i_0_35, negated_conjecture, (multiply(sk_c6,sk_c5)=sk_c4|inverse(sk_c6)=sk_c4)). % 0.13/0.39 cnf(i_0_53, negated_conjecture, (multiply(sk_c4,sk_c6)=sk_c5|inverse(sk_c6)=sk_c4)). % 0.13/0.39 cnf(i_0_41, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c5|inverse(sk_c6)=sk_c4)). % 0.13/0.39 cnf(i_0_34, negated_conjecture, (multiply(sk_c6,sk_c5)=sk_c4|inverse(sk_c2)=sk_c6)). % 0.13/0.39 cnf(i_0_52, negated_conjecture, (multiply(sk_c4,sk_c6)=sk_c5|inverse(sk_c2)=sk_c6)). % 0.13/0.39 cnf(i_0_40, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c5|inverse(sk_c2)=sk_c6)). % 0.13/0.39 cnf(i_0_37, negated_conjecture, (multiply(sk_c6,sk_c5)=sk_c4|inverse(sk_c3)=sk_c4)). % 0.13/0.39 cnf(i_0_55, negated_conjecture, (multiply(sk_c4,sk_c6)=sk_c5|inverse(sk_c3)=sk_c4)). % 0.13/0.39 cnf(i_0_43, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c5|inverse(sk_c3)=sk_c4)). % 0.13/0.39 cnf(i_0_44, negated_conjecture, (multiply(sk_c5,sk_c4)=sk_c6|inverse(sk_c1)=sk_c6)). % 0.13/0.39 cnf(i_0_45, negated_conjecture, (multiply(sk_c2,sk_c6)=sk_c5|inverse(sk_c1)=sk_c6)). % 0.13/0.39 cnf(i_0_48, negated_conjecture, (multiply(sk_c3,sk_c4)=sk_c5|inverse(sk_c1)=sk_c6)). % 0.13/0.39 cnf(i_0_32, negated_conjecture, (multiply(sk_c5,sk_c4)=sk_c6|multiply(sk_c6,sk_c5)=sk_c4)). % 0.13/0.39 cnf(i_0_33, negated_conjecture, (multiply(sk_c2,sk_c6)=sk_c5|multiply(sk_c6,sk_c5)=sk_c4)). % 0.13/0.39 cnf(i_0_36, negated_conjecture, (multiply(sk_c3,sk_c4)=sk_c5|multiply(sk_c6,sk_c5)=sk_c4)). % 0.13/0.39 cnf(i_0_50, negated_conjecture, (multiply(sk_c4,sk_c6)=sk_c5|multiply(sk_c5,sk_c4)=sk_c6)). % 0.13/0.39 cnf(i_0_38, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c5|multiply(sk_c5,sk_c4)=sk_c6)). % 0.13/0.39 cnf(i_0_51, negated_conjecture, (multiply(sk_c2,sk_c6)=sk_c5|multiply(sk_c4,sk_c6)=sk_c5)). % 0.13/0.39 cnf(i_0_54, negated_conjecture, (multiply(sk_c3,sk_c4)=sk_c5|multiply(sk_c4,sk_c6)=sk_c5)). % 0.13/0.39 cnf(i_0_39, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c5|multiply(sk_c2,sk_c6)=sk_c5)). % 0.13/0.39 cnf(i_0_42, negated_conjecture, (multiply(sk_c1,sk_c6)=sk_c5|multiply(sk_c3,sk_c4)=sk_c5)). % 0.13/0.39 cnf(i_0_56, negated_conjecture, (multiply(sk_c6,sk_c5)!=sk_c4|multiply(sk_c5,sk_c4)!=sk_c6|multiply(sk_c4,sk_c6)!=sk_c5|multiply(X1,sk_c4)!=sk_c5|multiply(X2,sk_c6)!=sk_c5|multiply(X3,sk_c6)!=sk_c5|inverse(sk_c6)!=sk_c4|inverse(X1)!=sk_c4|inverse(X2)!=sk_c6|inverse(X3)!=sk_c6)). % 0.13/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.39 # Begin printing tableau % 0.13/0.39 # Found 14 steps % 0.13/0.39 cnf(i_0_55, negated_conjecture, (multiply(sk_c4,sk_c6)=sk_c5|inverse(sk_c3)=sk_c4), inference(start_rule)). % 0.13/0.39 cnf(i_0_93, plain, (multiply(sk_c4,sk_c6)=sk_c5), inference(extension_rule, [i_0_56])). % 0.13/0.39 cnf(i_0_177, plain, (multiply(sk_c4,sk_c6)!=sk_c5), inference(closure_rule, [i_0_93])). % 0.13/0.39 cnf(i_0_178, plain, (multiply(sk_c4,sk_c6)!=sk_c5), inference(closure_rule, [i_0_93])). % 0.13/0.39 cnf(i_0_173, plain, (multiply(sk_c6,sk_c5)!=sk_c4), inference(extension_rule, [i_0_36])). % 0.13/0.39 cnf(i_0_94, plain, (inverse(sk_c3)=sk_c4), inference(etableau_closure_rule, [i_0_94, ...])). % 0.13/0.39 cnf(i_0_174, plain, (multiply(sk_c5,sk_c4)!=sk_c6), inference(etableau_closure_rule, [i_0_174, ...])). % 0.13/0.39 cnf(i_0_179, plain, (inverse(sk_c6)!=sk_c4), inference(etableau_closure_rule, [i_0_179, ...])). % 0.13/0.39 cnf(i_0_181, plain, (inverse(sk_c4)!=sk_c6), inference(etableau_closure_rule, [i_0_181, ...])). % 0.13/0.39 cnf(i_0_182, plain, (inverse(sk_c4)!=sk_c6), inference(etableau_closure_rule, [i_0_182, ...])). % 0.13/0.39 cnf(i_0_195, plain, (multiply(sk_c3,sk_c4)=sk_c5), inference(etableau_closure_rule, [i_0_195, ...])). % 0.13/0.39 cnf(i_0_176, plain, (multiply(sk_c3,sk_c4)!=sk_c5), inference(extension_rule, [i_0_42])). % 0.13/0.39 cnf(i_0_180, plain, (inverse(sk_c3)!=sk_c4), inference(etableau_closure_rule, [i_0_180, ...])). % 0.13/0.39 cnf(i_0_865, plain, (multiply(sk_c1,sk_c6)=sk_c5), inference(etableau_closure_rule, [i_0_865, ...])). % 0.13/0.39 # End printing tableau % 0.13/0.39 # SZS output end % 0.13/0.39 # Branches closed with saturation will be marked with an "s" % 0.13/0.39 # Child (25818) has found a proof. % 0.13/0.39 % 0.13/0.39 # Proof search is over... % 0.13/0.39 # Freeing feature tree %------------------------------------------------------------------------------