%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : GRP418-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 : 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:06:23 EDT 2022 % Result : Unsatisfiable 0.47s 0.62s % Output : CNFRefutation 0.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : GRP418-1 : TPTP v8.1.0. Released v2.6.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.15/0.35 % Computer : n018.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 600 % 0.15/0.35 % DateTime : Tue Jun 14 08:32:43 EDT 2022 % 0.15/0.35 % CPUTime : % 0.15/0.38 # No SInE strategy applied % 0.15/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.15/0.38 # and selection function SelectComplexExceptUniqMaxHorn. % 0.15/0.38 # % 0.15/0.38 # Presaturation interreduction done % 0.15/0.38 # Number of axioms: 2 Number of unprocessed: 2 % 0.15/0.38 # Tableaux proof search. % 0.15/0.38 # APR header successfully linked. % 0.15/0.38 # Hello from C++ % 0.22/0.49 # The folding up rule is enabled... % 0.22/0.49 # Local unification is enabled... % 0.22/0.49 # Any saturation attempts will use folding labels... % 0.22/0.49 # 2 beginning clauses after preprocessing and clausification % 0.22/0.49 # Creating start rules for all 1 conjectures. % 0.22/0.49 # There are 1 start rule candidates: % 0.22/0.49 # Found 2 unit axioms. % 0.22/0.49 # 1 start rule tableaux created. % 0.22/0.49 # 0 extension rule candidate clauses % 0.22/0.49 # 2 unit axiom clauses % 0.22/0.49 % 0.22/0.49 # Requested 8, 32 cores available to the main process. % 0.22/0.49 # There are not enough tableaux to fork, creating more from the initial 1 % 0.22/0.49 # Creating equality axioms % 0.22/0.49 # Ran out of tableaux, making start rules for all clauses % 0.47/0.62 # There were 2 total branch saturation attempts. % 0.47/0.62 # There were 0 of these attempts blocked. % 0.47/0.62 # There were 0 deferred branch saturation attempts. % 0.47/0.62 # There were 0 free duplicated saturations. % 0.47/0.62 # There were 2 total successful branch saturations. % 0.47/0.62 # There were 0 successful branch saturations in interreduction. % 0.47/0.62 # There were 0 successful branch saturations on the branch. % 0.47/0.62 # There were 2 successful branch saturations after the branch. % 0.47/0.62 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.47/0.62 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.47/0.62 # Begin clausification derivation % 0.47/0.62 % 0.47/0.62 # End clausification derivation % 0.47/0.62 # Begin listing active clauses obtained from FOF to CNF conversion % 0.47/0.62 cnf(i_0_3, plain, (inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)))=X2)). % 0.47/0.62 cnf(i_0_4, negated_conjecture, (multiply(inverse(a1),a1)!=multiply(inverse(b1),b1))). % 0.47/0.62 cnf(i_0_6, plain, (X4=X4)). % 0.47/0.62 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.47/0.62 # Begin printing tableau % 0.47/0.62 # Found 6 steps % 0.47/0.62 cnf(i_0_3, plain, (inverse(multiply(inverse(multiply(X18,inverse(multiply(inverse(b1),inverse(multiply(X19,inverse(multiply(inverse(X19),X19)))))))),multiply(X18,X19)))=b1), inference(start_rule)). % 0.47/0.62 cnf(i_0_12, plain, (inverse(multiply(inverse(multiply(X18,inverse(multiply(inverse(b1),inverse(multiply(X19,inverse(multiply(inverse(X19),X19)))))))),multiply(X18,X19)))=b1), inference(extension_rule, [i_0_11])). % 0.47/0.62 cnf(i_0_25, plain, (inverse(multiply(inverse(multiply(X23,inverse(multiply(inverse(inverse(b1)),inverse(multiply(X22,inverse(multiply(inverse(X22),X22)))))))),multiply(X23,X22)))!=inverse(b1)), inference(closure_rule, [i_0_3])). % 0.47/0.62 cnf(i_0_24, plain, (multiply(inverse(multiply(inverse(multiply(X23,inverse(multiply(inverse(inverse(b1)),inverse(multiply(X22,inverse(multiply(inverse(X22),X22)))))))),multiply(X23,X22))),inverse(multiply(inverse(multiply(X18,inverse(multiply(inverse(b1),inverse(multiply(X19,inverse(multiply(inverse(X19),X19)))))))),multiply(X18,X19))))=multiply(inverse(b1),b1)), inference(extension_rule, [i_0_9])). % 0.47/0.62 cnf(i_0_31, plain, (multiply(inverse(a1),a1)=multiply(inverse(b1),b1)), inference(closure_rule, [i_0_4])). % 0.47/0.62 cnf(i_0_32, plain, (multiply(inverse(a1),a1)!=multiply(inverse(multiply(inverse(multiply(X23,inverse(multiply(inverse(inverse(b1)),inverse(multiply(X22,inverse(multiply(inverse(X22),X22)))))))),multiply(X23,X22))),inverse(multiply(inverse(multiply(X18,inverse(multiply(inverse(b1),inverse(multiply(X19,inverse(multiply(inverse(X19),X19)))))))),multiply(X18,X19))))), inference(etableau_closure_rule, [i_0_32, ...])). % 0.47/0.62 # End printing tableau % 0.47/0.62 # SZS output end % 0.47/0.62 # Branches closed with saturation will be marked with an "s" % 0.47/0.62 # Returning from population with 7 new_tableaux and 0 remaining starting tableaux. % 0.47/0.62 # We now have 7 tableaux to operate on % 0.47/0.62 # Found closed tableau during pool population. % 0.47/0.62 # Proof search is over... % 0.47/0.62 # Freeing feature tree %------------------------------------------------------------------------------