%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP239-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:35 EDT 2022 % Result : Unsatisfiable 202.80s 25.98s % Output : CNFRefutation 202.80s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : GRP239-1 : TPTP v8.1.0. Released v2.5.0. % 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.14/0.36 % Computer : n018.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 600 % 0.14/0.36 % DateTime : Tue Jun 14 12:33:58 EDT 2022 % 0.14/0.36 % CPUTime : % 0.14/0.39 # No SInE strategy applied % 0.14/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.39 # % 0.14/0.39 # Presaturation interreduction done % 0.14/0.39 # Number of axioms: 46 Number of unprocessed: 46 % 0.14/0.39 # Tableaux proof search. % 0.14/0.39 # APR header successfully linked. % 0.14/0.39 # Hello from C++ % 0.14/0.39 # The folding up rule is enabled... % 0.14/0.39 # Local unification is enabled... % 0.14/0.39 # Any saturation attempts will use folding labels... % 0.14/0.39 # 46 beginning clauses after preprocessing and clausification % 0.14/0.39 # Creating start rules for all 43 conjectures. % 0.14/0.39 # There are 43 start rule candidates: % 0.14/0.39 # Found 3 unit axioms. % 0.14/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.39 # 43 start rule tableaux created. % 0.14/0.39 # 43 extension rule candidate clauses % 0.14/0.39 # 3 unit axiom clauses % 0.14/0.39 % 0.14/0.39 # Requested 8, 32 cores available to the main process. % 4.11/0.93 # Creating equality axioms % 4.11/0.93 # Ran out of tableaux, making start rules for all clauses % 4.42/0.95 # Creating equality axioms % 4.42/0.95 # Ran out of tableaux, making start rules for all clauses % 4.42/0.95 # Creating equality axioms % 4.42/0.95 # Ran out of tableaux, making start rules for all clauses % 4.42/0.96 # Creating equality axioms % 4.42/0.96 # Ran out of tableaux, making start rules for all clauses % 4.42/0.96 # Creating equality axioms % 4.42/0.96 # Ran out of tableaux, making start rules for all clauses % 4.42/0.97 # Creating equality axioms % 4.42/0.97 # Ran out of tableaux, making start rules for all clauses % 4.42/0.98 # Creating equality axioms % 4.42/0.98 # Ran out of tableaux, making start rules for all clauses % 4.42/1.01 # Creating equality axioms % 4.42/1.01 # Ran out of tableaux, making start rules for all clauses % 202.80/25.98 # There were 55 total branch saturation attempts. % 202.80/25.98 # There were 0 of these attempts blocked. % 202.80/25.98 # There were 0 deferred branch saturation attempts. % 202.80/25.98 # There were 0 free duplicated saturations. % 202.80/25.98 # There were 15 total successful branch saturations. % 202.80/25.98 # There were 0 successful branch saturations in interreduction. % 202.80/25.98 # There were 0 successful branch saturations on the branch. % 202.80/25.98 # There were 15 successful branch saturations after the branch. % 202.80/25.98 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 202.80/25.98 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 202.80/25.98 # Begin clausification derivation % 202.80/25.98 % 202.80/25.98 # End clausification derivation % 202.80/25.98 # Begin listing active clauses obtained from FOF to CNF conversion % 202.80/25.98 cnf(i_0_47, plain, (multiply(identity,X1)=X1)). % 202.80/25.98 cnf(i_0_48, plain, (multiply(inverse(X1),X1)=identity)). % 202.80/25.98 cnf(i_0_49, plain, (multiply(multiply(X1,X2),X3)=multiply(X1,multiply(X2,X3)))). % 202.80/25.98 cnf(i_0_50, negated_conjecture, (inverse(sk_c4)=sk_c9|inverse(sk_c9)=sk_c8)). % 202.80/25.98 cnf(i_0_53, negated_conjecture, (inverse(sk_c5)=sk_c8|inverse(sk_c9)=sk_c8)). % 202.80/25.98 cnf(i_0_55, negated_conjecture, (inverse(sk_c6)=sk_c7|inverse(sk_c9)=sk_c8)). % 202.80/25.98 cnf(i_0_57, negated_conjecture, (inverse(sk_c1)=sk_c9|inverse(sk_c4)=sk_c9)). % 202.80/25.98 cnf(i_0_85, negated_conjecture, (inverse(sk_c2)=sk_c9|inverse(sk_c4)=sk_c9)). % 202.80/25.98 cnf(i_0_60, negated_conjecture, (inverse(sk_c1)=sk_c9|inverse(sk_c5)=sk_c8)). % 202.80/25.98 cnf(i_0_88, negated_conjecture, (inverse(sk_c2)=sk_c9|inverse(sk_c5)=sk_c8)). % 202.80/25.98 cnf(i_0_62, negated_conjecture, (inverse(sk_c1)=sk_c9|inverse(sk_c6)=sk_c7)). % 202.80/25.98 cnf(i_0_90, negated_conjecture, (inverse(sk_c2)=sk_c9|inverse(sk_c6)=sk_c7)). % 202.80/25.98 cnf(i_0_51, negated_conjecture, (multiply(sk_c4,sk_c8)=sk_c9|inverse(sk_c9)=sk_c8)). % 202.80/25.98 cnf(i_0_52, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c9|inverse(sk_c9)=sk_c8)). % 202.80/25.98 cnf(i_0_54, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c8|inverse(sk_c9)=sk_c8)). % 202.80/25.98 cnf(i_0_56, negated_conjecture, (multiply(sk_c7,sk_c9)=sk_c8|inverse(sk_c9)=sk_c8)). % 202.80/25.98 cnf(i_0_71, negated_conjecture, (multiply(sk_c9,sk_c3)=sk_c8|inverse(sk_c4)=sk_c9)). % 202.80/25.98 cnf(i_0_64, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|inverse(sk_c4)=sk_c9)). % 202.80/25.98 cnf(i_0_78, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|inverse(sk_c4)=sk_c9)). % 202.80/25.98 cnf(i_0_74, negated_conjecture, (multiply(sk_c9,sk_c3)=sk_c8|inverse(sk_c5)=sk_c8)). % 202.80/25.98 cnf(i_0_67, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|inverse(sk_c5)=sk_c8)). % 202.80/25.98 cnf(i_0_81, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|inverse(sk_c5)=sk_c8)). % 202.80/25.98 cnf(i_0_76, negated_conjecture, (multiply(sk_c9,sk_c3)=sk_c8|inverse(sk_c6)=sk_c7)). % 202.80/25.98 cnf(i_0_69, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|inverse(sk_c6)=sk_c7)). % 202.80/25.98 cnf(i_0_83, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|inverse(sk_c6)=sk_c7)). % 202.80/25.98 cnf(i_0_58, negated_conjecture, (multiply(sk_c4,sk_c8)=sk_c9|inverse(sk_c1)=sk_c9)). % 202.80/25.98 cnf(i_0_59, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c9|inverse(sk_c1)=sk_c9)). % 202.80/25.98 cnf(i_0_61, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c8|inverse(sk_c1)=sk_c9)). % 202.80/25.98 cnf(i_0_63, negated_conjecture, (multiply(sk_c7,sk_c9)=sk_c8|inverse(sk_c1)=sk_c9)). % 202.80/25.98 cnf(i_0_86, negated_conjecture, (multiply(sk_c4,sk_c8)=sk_c9|inverse(sk_c2)=sk_c9)). % 202.80/25.98 cnf(i_0_87, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c9|inverse(sk_c2)=sk_c9)). % 202.80/25.98 cnf(i_0_89, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c8|inverse(sk_c2)=sk_c9)). % 202.80/25.98 cnf(i_0_91, negated_conjecture, (multiply(sk_c7,sk_c9)=sk_c8|inverse(sk_c2)=sk_c9)). % 202.80/25.98 cnf(i_0_72, negated_conjecture, (multiply(sk_c4,sk_c8)=sk_c9|multiply(sk_c9,sk_c3)=sk_c8)). % 202.80/25.98 cnf(i_0_73, negated_conjecture, (multiply(sk_c5,sk_c8)=sk_c9|multiply(sk_c9,sk_c3)=sk_c8)). % 202.80/25.98 cnf(i_0_75, negated_conjecture, (multiply(sk_c6,sk_c7)=sk_c8|multiply(sk_c9,sk_c3)=sk_c8)). % 202.80/25.98 cnf(i_0_77, negated_conjecture, (multiply(sk_c7,sk_c9)=sk_c8|multiply(sk_c9,sk_c3)=sk_c8)). % 202.80/25.98 cnf(i_0_65, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c4,sk_c8)=sk_c9)). % 202.80/25.98 cnf(i_0_79, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c4,sk_c8)=sk_c9)). % 202.80/25.98 cnf(i_0_66, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c5,sk_c8)=sk_c9)). % 202.80/25.98 cnf(i_0_80, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c5,sk_c8)=sk_c9)). % 202.80/25.98 cnf(i_0_68, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c6,sk_c7)=sk_c8)). % 202.80/25.98 cnf(i_0_82, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c6,sk_c7)=sk_c8)). % 202.80/25.98 cnf(i_0_70, negated_conjecture, (multiply(sk_c1,sk_c8)=sk_c9|multiply(sk_c7,sk_c9)=sk_c8)). % 202.80/25.98 cnf(i_0_84, negated_conjecture, (multiply(sk_c2,sk_c9)=sk_c3|multiply(sk_c7,sk_c9)=sk_c8)). % 202.80/25.98 cnf(i_0_92, negated_conjecture, (multiply(sk_c9,multiply(X1,sk_c9))!=sk_c8|multiply(inverse(X2),sk_c9)!=sk_c8|multiply(X2,inverse(X2))!=sk_c8|multiply(X3,sk_c8)!=sk_c9|multiply(X4,sk_c8)!=sk_c9|multiply(X5,sk_c8)!=sk_c9|inverse(sk_c9)!=sk_c8|inverse(X3)!=sk_c8|inverse(X4)!=sk_c9|inverse(X1)!=sk_c9|inverse(X5)!=sk_c9)). % 202.80/25.98 cnf(i_0_1626, plain, (X8=X8)). % 202.80/25.98 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 202.80/25.98 # Begin printing tableau % 202.80/25.98 # Found 6 steps % 202.80/25.98 cnf(i_0_1626, plain, (sk_c2=sk_c2), inference(start_rule)). % 202.80/25.98 cnf(i_0_1730, plain, (sk_c2=sk_c2), inference(extension_rule, [i_0_1631])). % 202.80/25.98 cnf(i_0_1586315, plain, (inverse(sk_c2)=inverse(sk_c2)), inference(extension_rule, [i_0_1629])). % 202.80/25.98 cnf(i_0_2447372, plain, (inverse(sk_c2)!=sk_c9), inference(extension_rule, [i_0_91])). % 202.80/25.98 cnf(i_0_2447371, plain, (inverse(sk_c2)=sk_c9), inference(etableau_closure_rule, [i_0_2447371, ...])). % 202.80/25.98 cnf(i_0_2450774, plain, (multiply(sk_c7,sk_c9)=sk_c8), inference(etableau_closure_rule, [i_0_2450774, ...])). % 202.80/25.98 # End printing tableau % 202.80/25.98 # SZS output end % 202.80/25.98 # Branches closed with saturation will be marked with an "s" % 202.80/25.99 # Child (30775) has found a proof. % 202.80/25.99 % 202.80/25.99 # Proof search is over... % 202.80/25.99 # Freeing feature tree %------------------------------------------------------------------------------