%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP410-1 : TPTP v8.1.0. Released v2.6.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 : n017.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:21 EDT 2022 % Result : Unsatisfiable 280.49s 280.84s % Output : CNFRefutation 280.49s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : GRP410-1 : TPTP v8.1.0. Released v2.6.0. % 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.15/0.36 % Computer : n017.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Mon Jun 13 04:24:07 EDT 2022 % 0.15/0.36 % CPUTime : % 0.15/0.39 # No SInE strategy applied % 0.15/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.15/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.15/0.39 # % 0.15/0.39 # Presaturation interreduction done % 0.15/0.39 # Number of axioms: 2 Number of unprocessed: 2 % 0.15/0.39 # Tableaux proof search. % 0.15/0.39 # APR header successfully linked. % 0.15/0.39 # Hello from C++ % 17.48/17.66 # The folding up rule is enabled... % 17.48/17.66 # Local unification is enabled... % 17.48/17.66 # Any saturation attempts will use folding labels... % 17.48/17.66 # 2 beginning clauses after preprocessing and clausification % 17.48/17.66 # Creating start rules for all 1 conjectures. % 17.48/17.66 # There are 1 start rule candidates: % 17.48/17.66 # Found 2 unit axioms. % 17.48/17.66 # 1 start rule tableaux created. % 17.48/17.66 # 0 extension rule candidate clauses % 17.48/17.66 # 2 unit axiom clauses % 17.48/17.66 % 17.48/17.66 # Requested 8, 32 cores available to the main process. % 17.48/17.66 # There are not enough tableaux to fork, creating more from the initial 1 % 17.48/17.66 # Creating equality axioms % 17.48/17.66 # Ran out of tableaux, making start rules for all clauses % 280.49/280.84 # There were 2 total branch saturation attempts. % 280.49/280.84 # There were 0 of these attempts blocked. % 280.49/280.84 # There were 0 deferred branch saturation attempts. % 280.49/280.84 # There were 0 free duplicated saturations. % 280.49/280.84 # There were 1 total successful branch saturations. % 280.49/280.84 # There were 0 successful branch saturations in interreduction. % 280.49/280.84 # There were 0 successful branch saturations on the branch. % 280.49/280.84 # There were 1 successful branch saturations after the branch. % 280.49/280.84 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 280.49/280.84 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 280.49/280.84 # Begin clausification derivation % 280.49/280.84 % 280.49/280.84 # End clausification derivation % 280.49/280.84 # Begin listing active clauses obtained from FOF to CNF conversion % 280.49/280.84 cnf(i_0_3, plain, (multiply(multiply(inverse(multiply(X1,inverse(multiply(X2,X3)))),multiply(X1,inverse(X3))),inverse(multiply(inverse(X3),X3)))=X2)). % 280.49/280.84 cnf(i_0_4, negated_conjecture, (multiply(multiply(inverse(b2),b2),a2)!=a2)). % 280.49/280.84 cnf(i_0_6, plain, (X4=X4)). % 280.49/280.84 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 280.49/280.84 # Begin printing tableau % 280.49/280.84 # Found 5 steps % 280.49/280.84 cnf(i_0_3, plain, (multiply(multiply(inverse(multiply(X11,inverse(multiply(X13,X12)))),multiply(X11,inverse(X12))),inverse(multiply(inverse(X12),X12)))=X13), inference(start_rule)). % 280.49/280.84 cnf(i_0_12, plain, (multiply(multiply(inverse(multiply(X11,inverse(multiply(X13,X12)))),multiply(X11,inverse(X12))),inverse(multiply(inverse(X12),X12)))=X13), inference(extension_rule, [i_0_11])). % 280.49/280.84 cnf(i_0_25, plain, (inverse(multiply(multiply(inverse(multiply(X11,inverse(multiply(X13,X12)))),multiply(X11,inverse(X12))),inverse(multiply(inverse(X12),X12))))=inverse(X13)), inference(extension_rule, [i_0_10])). % 280.49/280.84 cnf(i_0_36, plain, (X3!=multiply(multiply(inverse(multiply(X1,inverse(multiply(X3,X3)))),multiply(X1,inverse(X3))),inverse(multiply(inverse(X3),X3)))), inference(closure_rule, [i_0_3])). % 280.49/280.84 cnf(i_0_34, plain, (multiply(inverse(multiply(multiply(inverse(multiply(X11,inverse(multiply(X13,X12)))),multiply(X11,inverse(X12))),inverse(multiply(inverse(X12),X12)))),X3)=multiply(inverse(X13),multiply(multiply(inverse(multiply(X1,inverse(multiply(X3,X3)))),multiply(X1,inverse(X3))),inverse(multiply(inverse(X3),X3))))), inference(etableau_closure_rule, [i_0_34, ...])). % 280.49/280.84 # End printing tableau % 280.49/280.84 # SZS output end % 280.49/280.84 # Branches closed with saturation will be marked with an "s" % 280.49/280.84 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux. % 280.49/280.84 # We now have 9 tableaux to operate on % 280.49/280.84 # Found closed tableau during pool population. % 280.49/280.84 # Proof search is over... % 280.49/280.84 # Freeing feature tree %------------------------------------------------------------------------------