%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP062-1 : TPTP v8.1.0. Released v1.0.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 : n005.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:04:14 EDT 2022 % Result : Unsatisfiable 0.48s 0.65s % Output : CNFRefutation 0.48s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP062-1 : TPTP v8.1.0. Released v1.0.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.13/0.34 % Computer : n005.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % 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 10:10:24 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 2 Number of unprocessed: 2 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.39/0.62 # The folding up rule is enabled... % 0.39/0.62 # Local unification is enabled... % 0.39/0.62 # Any saturation attempts will use folding labels... % 0.39/0.62 # 2 beginning clauses after preprocessing and clausification % 0.39/0.62 # Creating start rules for all 1 conjectures. % 0.39/0.62 # There are 1 start rule candidates: % 0.39/0.62 # Found 1 unit axioms. % 0.39/0.62 # 1 start rule tableaux created. % 0.39/0.62 # 1 extension rule candidate clauses % 0.39/0.62 # 1 unit axiom clauses % 0.39/0.62 % 0.39/0.62 # Requested 8, 32 cores available to the main process. % 0.39/0.62 # There are not enough tableaux to fork, creating more from the initial 1 % 0.39/0.62 # Creating equality axioms % 0.39/0.62 # Ran out of tableaux, making start rules for all clauses % 0.48/0.65 # There were 1 total branch saturation attempts. % 0.48/0.65 # There were 0 of these attempts blocked. % 0.48/0.65 # There were 0 deferred branch saturation attempts. % 0.48/0.65 # There were 0 free duplicated saturations. % 0.48/0.65 # There were 1 total successful branch saturations. % 0.48/0.65 # There were 0 successful branch saturations in interreduction. % 0.48/0.65 # There were 0 successful branch saturations on the branch. % 0.48/0.65 # There were 1 successful branch saturations after the branch. % 0.48/0.65 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.48/0.65 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.48/0.65 # Begin clausification derivation % 0.48/0.65 % 0.48/0.65 # End clausification derivation % 0.48/0.65 # Begin listing active clauses obtained from FOF to CNF conversion % 0.48/0.65 cnf(i_0_3, plain, (inverse(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(X1,X2)))))))=X4)). % 0.48/0.65 cnf(i_0_4, negated_conjecture, (multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3))|multiply(inverse(a1),a1)!=multiply(inverse(b1),b1)|multiply(multiply(inverse(b2),b2),a2)!=a2)). % 0.48/0.65 cnf(i_0_17, plain, (X5=X5)). % 0.48/0.65 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.48/0.65 # Begin printing tableau % 0.48/0.65 # Found 6 steps % 0.48/0.65 cnf(i_0_3, plain, (inverse(multiply(X13,multiply(X12,multiply(multiply(X11,inverse(X11)),inverse(multiply(X14,multiply(X13,X12)))))))=X14), inference(start_rule)). % 0.48/0.65 cnf(i_0_23, plain, (inverse(multiply(X13,multiply(X12,multiply(multiply(X11,inverse(X11)),inverse(multiply(X14,multiply(X13,X12)))))))=X14), inference(extension_rule, [i_0_22])). % 0.48/0.65 cnf(i_0_41, plain, (inverse(multiply(X21,multiply(X20,multiply(multiply(X16,inverse(X16)),inverse(multiply(X15,multiply(X21,X20)))))))!=X15), inference(closure_rule, [i_0_3])). % 0.48/0.65 cnf(i_0_40, plain, (multiply(inverse(multiply(X21,multiply(X20,multiply(multiply(X16,inverse(X16)),inverse(multiply(X15,multiply(X21,X20))))))),inverse(multiply(X13,multiply(X12,multiply(multiply(X11,inverse(X11)),inverse(multiply(X14,multiply(X13,X12))))))))=multiply(X15,X14)), inference(extension_rule, [i_0_20])). % 0.48/0.65 cnf(i_0_52, plain, (multiply(X15,X14)!=inverse(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(multiply(X15,X14),multiply(X1,X2)))))))), inference(closure_rule, [i_0_3])). % 0.48/0.65 cnf(i_0_50, plain, (multiply(inverse(multiply(X21,multiply(X20,multiply(multiply(X16,inverse(X16)),inverse(multiply(X15,multiply(X21,X20))))))),inverse(multiply(X13,multiply(X12,multiply(multiply(X11,inverse(X11)),inverse(multiply(X14,multiply(X13,X12))))))))=inverse(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(multiply(X15,X14),multiply(X1,X2)))))))), inference(etableau_closure_rule, [i_0_50, ...])). % 0.48/0.65 # End printing tableau % 0.48/0.65 # SZS output end % 0.48/0.65 # Branches closed with saturation will be marked with an "s" % 0.48/0.65 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 0.48/0.65 # We now have 7 tableaux to operate on % 0.48/0.65 # Found closed tableau during pool population. % 0.48/0.65 # Proof search is over... % 0.48/0.65 # Freeing feature tree %------------------------------------------------------------------------------