%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP319-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 : n018.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:57 EDT 2022 % Result : Unsatisfiable 7.04s 1.30s % Output : CNFRefutation 7.04s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP319-1 : TPTP v8.1.0. Released v2.5.0. % 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.12/0.34 % Computer : n018.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Tue Jun 14 00:12:58 EDT 2022 % 0.12/0.34 % CPUTime : % 0.12/0.37 # No SInE strategy applied % 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.12/0.37 # % 0.12/0.37 # Presaturation interreduction done % 0.12/0.37 # Number of axioms: 40 Number of unprocessed: 40 % 0.12/0.37 # Tableaux proof search. % 0.12/0.37 # APR header successfully linked. % 0.12/0.37 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 40 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 37 conjectures. % 0.12/0.37 # There are 37 start rule candidates: % 0.12/0.37 # Found 3 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 37 start rule tableaux created. % 0.12/0.37 # 37 extension rule candidate clauses % 0.12/0.37 # 3 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 6.74/1.23 # Creating equality axioms % 6.74/1.23 # Ran out of tableaux, making start rules for all clauses % 6.74/1.23 # Creating equality axioms % 6.74/1.23 # Ran out of tableaux, making start rules for all clauses % 7.04/1.24 # Creating equality axioms % 7.04/1.24 # Ran out of tableaux, making start rules for all clauses % 7.04/1.24 # Creating equality axioms % 7.04/1.24 # Ran out of tableaux, making start rules for all clauses % 7.04/1.25 # Creating equality axioms % 7.04/1.25 # Ran out of tableaux, making start rules for all clauses % 7.04/1.25 # Creating equality axioms % 7.04/1.25 # Ran out of tableaux, making start rules for all clauses % 7.04/1.28 # Creating equality axioms % 7.04/1.28 # Ran out of tableaux, making start rules for all clauses % 7.04/1.30 # There were 2 total branch saturation attempts. % 7.04/1.30 # There were 0 of these attempts blocked. % 7.04/1.30 # There were 0 deferred branch saturation attempts. % 7.04/1.30 # There were 0 free duplicated saturations. % 7.04/1.30 # There were 1 total successful branch saturations. % 7.04/1.30 # There were 0 successful branch saturations in interreduction. % 7.04/1.30 # There were 0 successful branch saturations on the branch. % 7.04/1.30 # There were 1 successful branch saturations after the branch. % 7.04/1.30 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.04/1.30 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.04/1.30 # Begin clausification derivation % 7.04/1.30 % 7.04/1.30 # End clausification derivation % 7.04/1.30 # Begin listing active clauses obtained from FOF to CNF conversion % 7.04/1.30 cnf(i_0_41, plain, (multiply(identity,X1)=X1)). % 7.04/1.30 cnf(i_0_42, plain, (multiply(inverse(X1),X1)=identity)). % 7.04/1.30 cnf(i_0_43, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 7.04/1.30 cnf(i_0_57, negated_conjecture, (inverse(sk_c1)=sk_c8|inverse(sk_c4)=sk_c9)). % 7.04/1.30 cnf(i_0_75, negated_conjecture, (inverse(sk_c2)=sk_c9|inverse(sk_c4)=sk_c9)). % 7.04/1.30 cnf(i_0_59, negated_conjecture, (inverse(sk_c1)=sk_c8|inverse(sk_c5)=sk_c8)). % 7.04/1.30 cnf(i_0_77, negated_conjecture, (inverse(sk_c2)=sk_c9|inverse(sk_c5)=sk_c8)). % 7.04/1.30 cnf(i_0_60, negated_conjecture, (inverse(sk_c1)=sk_c8|inverse(sk_c6)=sk_c7)). % 7.04/1.30 cnf(i_0_78, negated_conjecture, (inverse(sk_c2)=sk_c9|inverse(sk_c6)=sk_c7)). % 7.04/1.30 cnf(i_0_45, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c7|inverse(sk_c4)=sk_c9)). % 7.04/1.30 cnf(i_0_63, negated_conjecture, (multiply(sk_c9,sk_c3)=sk_c8|inverse(sk_c4)=sk_c9)). % 7.04/1.30 cnf(i_0_51, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|inverse(sk_c4)=sk_c9)). % 7.04/1.30 cnf(i_0_69, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|inverse(sk_c4)=sk_c9)). % 7.04/1.30 cnf(i_0_47, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c7|inverse(sk_c5)=sk_c8)). % 7.04/1.30 cnf(i_0_65, negated_conjecture, (multiply(sk_c9,sk_c3)=sk_c8|inverse(sk_c5)=sk_c8)). % 7.04/1.30 cnf(i_0_53, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|inverse(sk_c5)=sk_c8)). % 7.04/1.30 cnf(i_0_71, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|inverse(sk_c5)=sk_c8)). % 7.04/1.30 cnf(i_0_48, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c7|inverse(sk_c6)=sk_c7)). % 7.04/1.30 cnf(i_0_66, negated_conjecture, (multiply(sk_c9,sk_c3)=sk_c8|inverse(sk_c6)=sk_c7)). % 7.04/1.30 cnf(i_0_54, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|inverse(sk_c6)=sk_c7)). % 7.04/1.30 cnf(i_0_72, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|inverse(sk_c6)=sk_c7)). % 7.04/1.30 cnf(i_0_56, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c8|inverse(sk_c1)=sk_c8)). % 7.04/1.30 cnf(i_0_58, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c7|inverse(sk_c1)=sk_c8)). % 7.04/1.30 cnf(i_0_61, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c7|inverse(sk_c1)=sk_c8)). % 7.04/1.30 cnf(i_0_74, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c8|inverse(sk_c2)=sk_c9)). % 7.04/1.30 cnf(i_0_76, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c7|inverse(sk_c2)=sk_c9)). % 7.04/1.30 cnf(i_0_79, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c7|inverse(sk_c2)=sk_c9)). % 7.04/1.30 cnf(i_0_44, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c8|multiply(sk_c8,sk_c9)=sk_c7)). % 7.04/1.30 cnf(i_0_46, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c7|multiply(sk_c8,sk_c9)=sk_c7)). % 7.04/1.30 cnf(i_0_49, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c7|multiply(sk_c8,sk_c9)=sk_c7)). % 7.04/1.30 cnf(i_0_62, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c8|multiply(sk_c9,sk_c3)=sk_c8)). % 7.04/1.30 cnf(i_0_64, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c7|multiply(sk_c9,sk_c3)=sk_c8)). % 7.04/1.30 cnf(i_0_67, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c7|multiply(sk_c9,sk_c3)=sk_c8)). % 7.04/1.30 cnf(i_0_50, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c4,sk_c9)=sk_c8)). % 7.04/1.30 cnf(i_0_68, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c4,sk_c9)=sk_c8)). % 7.04/1.30 cnf(i_0_52, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c5,sk_c8)=sk_c7)). % 7.04/1.30 cnf(i_0_70, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c5,sk_c8)=sk_c7)). % 7.04/1.30 cnf(i_0_55, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c6,sk_c9)=sk_c7)). % 7.04/1.30 cnf(i_0_73, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c6,sk_c9)=sk_c7)). % 7.04/1.30 cnf(i_0_80, negated_conjecture, (multiply(sk_c9,multiply(X1,sk_c9))!=sk_c8|multiply(sk_c8,sk_c9)!=sk_c7|multiply(X2,sk_c9)!=sk_c7|multiply(X3,sk_c8)!=sk_c7|multiply(X4,sk_c9)!=sk_c8|multiply(X5,sk_c8)!=sk_c9|inverse(X2)!=sk_c7|inverse(X3)!=sk_c8|inverse(X4)!=sk_c9|inverse(X1)!=sk_c9|inverse(X5)!=sk_c8)). % 7.04/1.30 cnf(i_0_1504, plain, (X7=X7)). % 7.04/1.30 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 7.04/1.30 # Begin printing tableau % 7.04/1.30 # Found 7 steps % 7.04/1.30 cnf(i_0_1504, plain, (identity=identity), inference(start_rule)). % 7.04/1.30 cnf(i_0_1596, plain, (identity=identity), inference(extension_rule, [i_0_1508])). % 7.04/1.30 cnf(i_0_1689, plain, (multiply(identity,X1)!=X1), inference(closure_rule, [i_0_41])). % 7.04/1.30 cnf(i_0_1687, plain, (multiply(identity,multiply(identity,X1))=multiply(identity,X1)), inference(extension_rule, [i_0_1507])). % 7.04/1.30 cnf(i_0_1779, plain, (multiply(identity,X1)!=X1), inference(closure_rule, [i_0_41])). % 7.04/1.30 cnf(i_0_1777, plain, (multiply(identity,multiply(identity,X1))=X1), inference(extension_rule, [i_0_1509])). % 7.04/1.30 cnf(i_0_64345, plain, (inverse(multiply(identity,multiply(identity,X1)))=inverse(X1)), inference(etableau_closure_rule, [i_0_64345, ...])). % 7.04/1.30 # End printing tableau % 7.04/1.30 # SZS output end % 7.04/1.30 # Branches closed with saturation will be marked with an "s" % 7.04/1.30 # There were 2 total branch saturation attempts. % 7.04/1.30 # There were 0 of these attempts blocked. % 7.04/1.30 # There were 0 deferred branch saturation attempts. % 7.04/1.30 # There were 0 free duplicated saturations. % 7.04/1.30 # There were 1 total successful branch saturations. % 7.04/1.30 # There were 0 successful branch saturations in interreduction. % 7.04/1.30 # There were 0 successful branch saturations on the branch. % 7.04/1.30 # There were 1 successful branch saturations after the branch. % 7.04/1.30 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.04/1.30 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.04/1.30 # Begin clausification derivation % 7.04/1.30 % 7.04/1.30 # End clausification derivation % 7.04/1.30 # Begin listing active clauses obtained from FOF to CNF conversion % 7.04/1.30 cnf(i_0_41, plain, (multiply(identity,X1)=X1)). % 7.04/1.30 cnf(i_0_42, plain, (multiply(inverse(X1),X1)=identity)). % 7.04/1.30 cnf(i_0_43, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 7.04/1.30 cnf(i_0_57, negated_conjecture, (inverse(sk_c1)=sk_c8|inverse(sk_c4)=sk_c9)). % 7.04/1.30 cnf(i_0_75, negated_conjecture, (inverse(sk_c2)=sk_c9|inverse(sk_c4)=sk_c9)). % 7.04/1.30 cnf(i_0_59, negated_conjecture, (inverse(sk_c1)=sk_c8|inverse(sk_c5)=sk_c8)). % 7.04/1.30 cnf(i_0_77, negated_conjecture, (inverse(sk_c2)=sk_c9|inverse(sk_c5)=sk_c8)). % 7.04/1.30 cnf(i_0_60, negated_conjecture, (inverse(sk_c1)=sk_c8|inverse(sk_c6)=sk_c7)). % 7.04/1.30 cnf(i_0_78, negated_conjecture, (inverse(sk_c2)=sk_c9|inverse(sk_c6)=sk_c7)). % 7.04/1.30 cnf(i_0_45, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c7|inverse(sk_c4)=sk_c9)). % 7.04/1.30 cnf(i_0_63, negated_conjecture, (multiply(sk_c9,sk_c3)=sk_c8|inverse(sk_c4)=sk_c9)). % 7.04/1.30 cnf(i_0_51, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|inverse(sk_c4)=sk_c9)). % 7.04/1.30 cnf(i_0_69, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|inverse(sk_c4)=sk_c9)). % 7.04/1.30 cnf(i_0_47, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c7|inverse(sk_c5)=sk_c8)). % 7.04/1.30 cnf(i_0_65, negated_conjecture, (multiply(sk_c9,sk_c3)=sk_c8|inverse(sk_c5)=sk_c8)). % 7.04/1.30 cnf(i_0_53, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|inverse(sk_c5)=sk_c8)). % 7.04/1.30 cnf(i_0_71, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|inverse(sk_c5)=sk_c8)). % 7.04/1.30 cnf(i_0_48, negated_conjecture, (multiply(sk_c8,sk_c9)=sk_c7|inverse(sk_c6)=sk_c7)). % 7.04/1.30 cnf(i_0_66, negated_conjecture, (multiply(sk_c9,sk_c3)=sk_c8|inverse(sk_c6)=sk_c7)). % 7.04/1.30 cnf(i_0_54, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|inverse(sk_c6)=sk_c7)). % 7.04/1.30 cnf(i_0_72, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|inverse(sk_c6)=sk_c7)). % 7.04/1.30 cnf(i_0_56, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c8|inverse(sk_c1)=sk_c8)). % 7.04/1.30 cnf(i_0_58, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c7|inverse(sk_c1)=sk_c8)). % 7.04/1.30 cnf(i_0_61, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c7|inverse(sk_c1)=sk_c8)). % 7.04/1.30 cnf(i_0_74, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c8|inverse(sk_c2)=sk_c9)). % 7.04/1.30 cnf(i_0_76, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c7|inverse(sk_c2)=sk_c9)). % 7.04/1.30 cnf(i_0_79, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c7|inverse(sk_c2)=sk_c9)). % 7.04/1.30 cnf(i_0_44, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c8|multiply(sk_c8,sk_c9)=sk_c7)). % 7.04/1.30 cnf(i_0_46, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c7|multiply(sk_c8,sk_c9)=sk_c7)). % 7.04/1.30 cnf(i_0_49, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c7|multiply(sk_c8,sk_c9)=sk_c7)). % 7.04/1.30 cnf(i_0_62, negated_conjecture, (multiply(sk_c4,sk_c9)=sk_c8|multiply(sk_c9,sk_c3)=sk_c8)). % 7.04/1.30 cnf(i_0_64, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c7|multiply(sk_c9,sk_c3)=sk_c8)). % 7.04/1.30 cnf(i_0_67, negated_conjecture, (multiply(sk_c6,sk_c9)=sk_c7|multiply(sk_c9,sk_c3)=sk_c8)). % 7.04/1.30 cnf(i_0_50, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c4,sk_c9)=sk_c8)). % 7.04/1.30 cnf(i_0_68, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c4,sk_c9)=sk_c8)). % 7.04/1.30 cnf(i_0_52, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c5,sk_c8)=sk_c7)). % 7.04/1.30 cnf(i_0_70, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c5,sk_c8)=sk_c7)). % 7.04/1.30 cnf(i_0_55, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c6,sk_c9)=sk_c7)). % 7.04/1.30 cnf(i_0_73, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c6,sk_c9)=sk_c7)). % 7.04/1.30 cnf(i_0_80, negated_conjecture, (multiply(sk_c9,multiply(X1,sk_c9))!=sk_c8|multiply(sk_c8,sk_c9)!=sk_c7|multiply(X2,sk_c9)!=sk_c7|multiply(X3,sk_c8)!=sk_c7|multiply(X4,sk_c9)!=sk_c8|multiply(X5,sk_c8)!=sk_c9|inverse(X2)!=sk_c7|inverse(X3)!=sk_c8|inverse(X4)!=sk_c9|inverse(X1)!=sk_c9|inverse(X5)!=sk_c8)). % 7.04/1.30 cnf(i_0_1670, plain, (X7=X7)). % 7.04/1.30 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 7.04/1.30 # Begin printing tableau % 7.04/1.30 # Found 7 steps % 7.04/1.30 cnf(i_0_1670, plain, (identity=identity), inference(start_rule)). % 7.04/1.30 cnf(i_0_1762, plain, (identity=identity), inference(extension_rule, [i_0_1674])). % 7.04/1.30 cnf(i_0_1855, plain, (multiply(identity,X2)!=X2), inference(closure_rule, [i_0_41])). % 7.04/1.30 cnf(i_0_1853, plain, (multiply(identity,multiply(identity,X2))=multiply(identity,X2)), inference(extension_rule, [i_0_1673])). % 7.04/1.30 cnf(i_0_1945, plain, (multiply(identity,X2)!=X2), inference(closure_rule, [i_0_41])). % 7.04/1.30 cnf(i_0_1943, plain, (multiply(identity,multiply(identity,X2))=X2), inference(extension_rule, [i_0_1675])). % 7.04/1.30 cnf(i_0_64511, plain, (inverse(multiply(identity,multiply(identity,X2)))=inverse(X2)), inference(etableau_closure_rule, [i_0_64511, ...])). % 7.04/1.30 # End printing tableau % 7.04/1.30 # SZS output end % 7.04/1.30 # Branches closed with saturation will be marked with an "s" % 7.04/1.30 # Child (25750) has found a proof. % 7.04/1.30 % 7.04/1.30 # Proof search is over... % 7.04/1.30 # Freeing feature tree %------------------------------------------------------------------------------