%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : BOO067-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 : n024.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 : Thu Jul 14 23:38:32 EDT 2022 % Result : Unsatisfiable 0.60s 0.83s % Output : CNFRefutation 0.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : BOO067-1 : TPTP v8.1.0. Released v2.6.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.35 % Computer : n024.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Wed Jun 1 16:25:51 EDT 2022 % 0.13/0.35 % CPUTime : % 0.13/0.38 # No SInE strategy applied % 0.13/0.38 # Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN % 0.13/0.38 # and selection function PSelectComplexExceptUniqMaxHorn. % 0.13/0.38 # % 0.13/0.38 # Number of axioms: 2 Number of unprocessed: 2 % 0.13/0.38 # Tableaux proof search. % 0.13/0.38 # APR header successfully linked. % 0.13/0.38 # Hello from C++ % 0.20/0.43 # The folding up rule is enabled... % 0.20/0.43 # Local unification is enabled... % 0.20/0.43 # Any saturation attempts will use folding labels... % 0.20/0.43 # 2 beginning clauses after preprocessing and clausification % 0.20/0.43 # Creating start rules for all 1 conjectures. % 0.20/0.43 # There are 1 start rule candidates: % 0.20/0.43 # Found 2 unit axioms. % 0.20/0.43 # 1 start rule tableaux created. % 0.20/0.43 # 0 extension rule candidate clauses % 0.20/0.43 # 2 unit axiom clauses % 0.20/0.43 % 0.20/0.43 # Requested 8, 32 cores available to the main process. % 0.20/0.43 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.43 # Creating equality axioms % 0.20/0.43 # Ran out of tableaux, making start rules for all clauses % 0.59/0.75 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux. % 0.59/0.75 # We now have 8 tableaux to operate on % 0.60/0.83 # There were 7 total branch saturation attempts. % 0.60/0.83 # There were 0 of these attempts blocked. % 0.60/0.83 # There were 0 deferred branch saturation attempts. % 0.60/0.83 # There were 3 free duplicated saturations. % 0.60/0.83 # There were 7 total successful branch saturations. % 0.60/0.83 # There were 0 successful branch saturations in interreduction. % 0.60/0.83 # There were 0 successful branch saturations on the branch. % 0.60/0.83 # There were 4 successful branch saturations after the branch. % 0.60/0.83 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.60/0.83 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.60/0.83 # Begin clausification derivation % 0.60/0.83 % 0.60/0.83 # End clausification derivation % 0.60/0.83 # Begin listing active clauses obtained from FOF to CNF conversion % 0.60/0.83 cnf(i_0_4, negated_conjecture, (multiply(multiply(d,e,a),b,multiply(d,e,c))!=multiply(d,e,multiply(a,b,c)))). % 0.60/0.83 cnf(i_0_3, plain, (multiply(multiply(X1,inverse(X1),X2),inverse(multiply(multiply(X3,X4,X5),X6,multiply(X3,X4,X7))),multiply(X4,multiply(X7,X6,X5),X3))=X2)). % 0.60/0.83 cnf(i_0_6, plain, (X8=X8)). % 0.60/0.83 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.60/0.83 # Begin printing tableau % 0.60/0.83 # Found 6 steps % 0.60/0.83 cnf(i_0_3, plain, (multiply(multiply(X18,inverse(X18),multiply(d,e,multiply(a,b,c))),inverse(multiply(multiply(X17,X16,X15),X14,multiply(X17,X16,X13))),multiply(X16,multiply(X13,X14,X15),X17))=multiply(d,e,multiply(a,b,c))), inference(start_rule)). % 0.60/0.83 cnf(i_0_13, plain, (multiply(multiply(X18,inverse(X18),multiply(d,e,multiply(a,b,c))),inverse(multiply(multiply(X17,X16,X15),X14,multiply(X17,X16,X13))),multiply(X16,multiply(X13,X14,X15),X17))=multiply(d,e,multiply(a,b,c))), inference(extension_rule, [i_0_9])). % 0.60/0.83 cnf(i_0_25700, plain, (multiply(multiply(d,e,a),b,multiply(d,e,c))=multiply(d,e,multiply(a,b,c))), inference(closure_rule, [i_0_4])). % 0.60/0.83 cnf(i_0_25701, plain, (multiply(multiply(d,e,a),b,multiply(d,e,c))!=multiply(multiply(X18,inverse(X18),multiply(d,e,multiply(a,b,c))),inverse(multiply(multiply(X17,X16,X15),X14,multiply(X17,X16,X13))),multiply(X16,multiply(X13,X14,X15),X17))), inference(extension_rule, [i_0_9])). % 0.60/0.83 cnf(i_0_25830, plain, (multiply(multiply(d,e,a),b,multiply(d,e,c))!=multiply(multiply(X1,inverse(X1),multiply(multiply(d,e,a),b,multiply(d,e,c))),inverse(multiply(multiply(X3,X4,X5),X6,multiply(X3,X4,X7))),multiply(X4,multiply(X7,X6,X5),X3))), inference(closure_rule, [i_0_3])). % 0.60/0.83 cnf(i_0_25831, plain, (multiply(multiply(X1,inverse(X1),multiply(multiply(d,e,a),b,multiply(d,e,c))),inverse(multiply(multiply(X3,X4,X5),X6,multiply(X3,X4,X7))),multiply(X4,multiply(X7,X6,X5),X3))!=multiply(multiply(X18,inverse(X18),multiply(d,e,multiply(a,b,c))),inverse(multiply(multiply(X17,X16,X15),X14,multiply(X17,X16,X13))),multiply(X16,multiply(X13,X14,X15),X17))), inference(etableau_closure_rule, [i_0_25831, ...])). % 0.60/0.83 # End printing tableau % 0.60/0.83 # SZS output end % 0.60/0.83 # Branches closed with saturation will be marked with an "s" % 0.60/0.83 # Child (27894) has found a proof. % 0.60/0.83 % 0.60/0.83 # Proof search is over... % 0.60/0.83 # Freeing feature tree %------------------------------------------------------------------------------